/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:17:19,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:17:19,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:17:19,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:17:19,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:17:19,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:17:19,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:17:19,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:17:19,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:17:19,742 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:17:19,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:17:19,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:17:19,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:17:19,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:17:19,745 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:17:19,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:17:19,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:17:19,746 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:17:19,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:17:19,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:17:19,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:17:19,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:17:19,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:17:19,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:17:19,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:17:19,748 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:17:19,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:17:19,749 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:17:19,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:17:19,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:17:19,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:17:19,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:17:19,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:17:19,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:17:19,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:17:19,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:17:19,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:17:19,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:17:19,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:17:19,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:17:19,752 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:17:19,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:17:19,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:17:19,752 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:17:19,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:17:20,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:17:20,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:17:20,019 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:17:20,019 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:17:20,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2023-12-15 20:17:21,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:17:21,355 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:17:21,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2023-12-15 20:17:21,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f1a1fd9/288bb40a29844d4fb92f769e9a0bb55c/FLAG338d69ad3 [2023-12-15 20:17:21,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f1a1fd9/288bb40a29844d4fb92f769e9a0bb55c [2023-12-15 20:17:21,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:17:21,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:17:21,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:17:21,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:17:21,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:17:21,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33064e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21, skipping insertion in model container [2023-12-15 20:17:21,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:17:21,580 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2023-12-15 20:17:21,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:17:21,663 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:17:21,673 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2023-12-15 20:17:21,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:17:21,733 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:17:21,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21 WrapperNode [2023-12-15 20:17:21,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:17:21,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:17:21,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:17:21,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:17:21,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,783 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2023-12-15 20:17:21,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:17:21,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:17:21,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:17:21,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:17:21,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,818 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:17:21,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:17:21,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:17:21,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:17:21,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:17:21,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (1/1) ... [2023-12-15 20:17:21,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:17:21,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:17:21,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:17:21,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:17:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:17:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:17:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:17:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:17:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:17:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:17:22,001 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:17:22,005 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:17:22,412 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:17:22,466 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:17:22,466 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:17:22,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:17:22 BoogieIcfgContainer [2023-12-15 20:17:22,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:17:22,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:17:22,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:17:22,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:17:22,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:17:21" (1/3) ... [2023-12-15 20:17:22,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd2176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:17:22, skipping insertion in model container [2023-12-15 20:17:22,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:17:21" (2/3) ... [2023-12-15 20:17:22,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd2176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:17:22, skipping insertion in model container [2023-12-15 20:17:22,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:17:22" (3/3) ... [2023-12-15 20:17:22,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2023-12-15 20:17:22,487 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:17:22,488 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:17:22,530 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:17:22,535 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fc892a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:17:22,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:17:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 53 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-15 20:17:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 20:17:22,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:22,559 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:22,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:22,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1711964463, now seen corresponding path program 1 times [2023-12-15 20:17:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580828286] [2023-12-15 20:17:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580828286] [2023-12-15 20:17:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580828286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:17:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906462811] [2023-12-15 20:17:22,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:23,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:17:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:17:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:17:23,029 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 53 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-15 20:17:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:23,096 INFO L93 Difference]: Finished difference Result 155 states and 284 transitions. [2023-12-15 20:17:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:17:23,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 152 [2023-12-15 20:17:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:23,108 INFO L225 Difference]: With dead ends: 155 [2023-12-15 20:17:23,108 INFO L226 Difference]: Without dead ends: 77 [2023-12-15 20:17:23,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:17:23,117 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:23,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:17:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-15 20:17:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-15 20:17:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-15 20:17:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2023-12-15 20:17:23,164 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 152 [2023-12-15 20:17:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:23,164 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2023-12-15 20:17:23,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-15 20:17:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2023-12-15 20:17:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 20:17:23,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:23,167 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:23,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:17:23,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:23,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 748106645, now seen corresponding path program 1 times [2023-12-15 20:17:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:23,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36183259] [2023-12-15 20:17:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36183259] [2023-12-15 20:17:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36183259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:17:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290096573] [2023-12-15 20:17:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:24,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:17:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:17:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:17:24,199 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:24,323 INFO L93 Difference]: Finished difference Result 182 states and 294 transitions. [2023-12-15 20:17:24,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:17:24,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 154 [2023-12-15 20:17:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:24,326 INFO L225 Difference]: With dead ends: 182 [2023-12-15 20:17:24,326 INFO L226 Difference]: Without dead ends: 106 [2023-12-15 20:17:24,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:17:24,328 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 113 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:24,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 262 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:17:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-15 20:17:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2023-12-15 20:17:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 63 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-15 20:17:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 144 transitions. [2023-12-15 20:17:24,344 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 144 transitions. Word has length 154 [2023-12-15 20:17:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:24,348 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 144 transitions. [2023-12-15 20:17:24,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 144 transitions. [2023-12-15 20:17:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 20:17:24,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:24,357 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:24,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:17:24,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:24,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash 355079635, now seen corresponding path program 1 times [2023-12-15 20:17:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873594191] [2023-12-15 20:17:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873594191] [2023-12-15 20:17:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873594191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:17:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501504310] [2023-12-15 20:17:24,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:24,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:17:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:17:24,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:17:24,858 INFO L87 Difference]: Start difference. First operand 89 states and 144 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:25,078 INFO L93 Difference]: Finished difference Result 266 states and 431 transitions. [2023-12-15 20:17:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:17:25,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 154 [2023-12-15 20:17:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:25,085 INFO L225 Difference]: With dead ends: 266 [2023-12-15 20:17:25,086 INFO L226 Difference]: Without dead ends: 178 [2023-12-15 20:17:25,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:17:25,092 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 144 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:25,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 420 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:17:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-15 20:17:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2023-12-15 20:17:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 20:17:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 210 transitions. [2023-12-15 20:17:25,129 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 210 transitions. Word has length 154 [2023-12-15 20:17:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:25,130 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 210 transitions. [2023-12-15 20:17:25,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 210 transitions. [2023-12-15 20:17:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:17:25,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:25,132 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:17:25,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:25,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 70906026, now seen corresponding path program 1 times [2023-12-15 20:17:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472780911] [2023-12-15 20:17:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:25,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:25,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472780911] [2023-12-15 20:17:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472780911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:17:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640696348] [2023-12-15 20:17:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:25,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:17:25,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:25,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:17:25,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:17:25,445 INFO L87 Difference]: Start difference. First operand 132 states and 210 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:25,531 INFO L93 Difference]: Finished difference Result 279 states and 447 transitions. [2023-12-15 20:17:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:17:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2023-12-15 20:17:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:25,533 INFO L225 Difference]: With dead ends: 279 [2023-12-15 20:17:25,533 INFO L226 Difference]: Without dead ends: 191 [2023-12-15 20:17:25,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:17:25,537 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 59 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:25,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 345 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:17:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-15 20:17:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2023-12-15 20:17:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 20:17:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 290 transitions. [2023-12-15 20:17:25,555 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 290 transitions. Word has length 155 [2023-12-15 20:17:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:25,558 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 290 transitions. [2023-12-15 20:17:25,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 290 transitions. [2023-12-15 20:17:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:17:25,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:25,561 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:25,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:17:25,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:25,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 750964396, now seen corresponding path program 1 times [2023-12-15 20:17:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635973561] [2023-12-15 20:17:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-15 20:17:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635973561] [2023-12-15 20:17:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635973561] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:17:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245601253] [2023-12-15 20:17:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:25,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:17:25,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:17:25,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:17:25,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:17:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:26,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 20:17:26,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:17:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2023-12-15 20:17:26,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:17:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-15 20:17:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245601253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:17:26,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:17:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-15 20:17:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651794736] [2023-12-15 20:17:26,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:17:26,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:17:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:17:26,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:17:26,490 INFO L87 Difference]: Start difference. First operand 182 states and 290 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2023-12-15 20:17:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:26,652 INFO L93 Difference]: Finished difference Result 344 states and 534 transitions. [2023-12-15 20:17:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:17:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 155 [2023-12-15 20:17:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:26,655 INFO L225 Difference]: With dead ends: 344 [2023-12-15 20:17:26,655 INFO L226 Difference]: Without dead ends: 206 [2023-12-15 20:17:26,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:17:26,656 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 117 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:26,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:17:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-15 20:17:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2023-12-15 20:17:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 132 states have internal predecessors, (187), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 20:17:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 287 transitions. [2023-12-15 20:17:26,687 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 287 transitions. Word has length 155 [2023-12-15 20:17:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:26,687 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 287 transitions. [2023-12-15 20:17:26,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2023-12-15 20:17:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 287 transitions. [2023-12-15 20:17:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:17:26,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:26,690 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:26,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:17:26,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:17:26,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:26,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash -270103958, now seen corresponding path program 1 times [2023-12-15 20:17:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:26,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766940834] [2023-12-15 20:17:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766940834] [2023-12-15 20:17:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766940834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:17:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742566054] [2023-12-15 20:17:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:27,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:17:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:17:27,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:17:27,166 INFO L87 Difference]: Start difference. First operand 187 states and 287 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:27,235 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2023-12-15 20:17:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:17:27,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2023-12-15 20:17:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:27,237 INFO L225 Difference]: With dead ends: 309 [2023-12-15 20:17:27,237 INFO L226 Difference]: Without dead ends: 170 [2023-12-15 20:17:27,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:17:27,239 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 87 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:27,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 254 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:17:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-15 20:17:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2023-12-15 20:17:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 20:17:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2023-12-15 20:17:27,255 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 219 transitions. Word has length 155 [2023-12-15 20:17:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:27,256 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 219 transitions. [2023-12-15 20:17:27,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2023-12-15 20:17:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-15 20:17:27,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:27,257 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:17:27,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:27,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2031852195, now seen corresponding path program 1 times [2023-12-15 20:17:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726042901] [2023-12-15 20:17:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-15 20:17:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726042901] [2023-12-15 20:17:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726042901] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:17:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709749118] [2023-12-15 20:17:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:27,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:17:27,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:17:27,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:17:27,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:17:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:27,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-15 20:17:27,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:17:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 699 proven. 69 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2023-12-15 20:17:28,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:17:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-15 20:17:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709749118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:17:28,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:17:28,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2023-12-15 20:17:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380005237] [2023-12-15 20:17:28,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:17:28,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 20:17:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:28,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 20:17:28,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-15 20:17:28,328 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67) [2023-12-15 20:17:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:29,356 INFO L93 Difference]: Finished difference Result 368 states and 511 transitions. [2023-12-15 20:17:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-15 20:17:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67) Word has length 156 [2023-12-15 20:17:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:29,360 INFO L225 Difference]: With dead ends: 368 [2023-12-15 20:17:29,360 INFO L226 Difference]: Without dead ends: 270 [2023-12-15 20:17:29,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=452, Invalid=1188, Unknown=0, NotChecked=0, Total=1640 [2023-12-15 20:17:29,362 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 397 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:29,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 372 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 20:17:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-15 20:17:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 250. [2023-12-15 20:17:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 160 states have (on average 1.24375) internal successors, (199), 160 states have internal predecessors, (199), 72 states have call successors, (72), 17 states have call predecessors, (72), 17 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-15 20:17:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2023-12-15 20:17:29,408 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 156 [2023-12-15 20:17:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:29,408 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2023-12-15 20:17:29,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67) [2023-12-15 20:17:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2023-12-15 20:17:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-15 20:17:29,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:29,410 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:29,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 20:17:29,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-15 20:17:29,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:29,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash 327317688, now seen corresponding path program 1 times [2023-12-15 20:17:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732574535] [2023-12-15 20:17:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732574535] [2023-12-15 20:17:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732574535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:31,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:31,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:17:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648494369] [2023-12-15 20:17:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:31,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:17:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:17:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:17:31,262 INFO L87 Difference]: Start difference. First operand 250 states and 343 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-15 20:17:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:33,119 INFO L93 Difference]: Finished difference Result 734 states and 999 transitions. [2023-12-15 20:17:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:17:33,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2023-12-15 20:17:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:33,125 INFO L225 Difference]: With dead ends: 734 [2023-12-15 20:17:33,125 INFO L226 Difference]: Without dead ends: 548 [2023-12-15 20:17:33,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-15 20:17:33,127 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 364 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:33,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 368 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 20:17:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-12-15 20:17:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 354. [2023-12-15 20:17:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 233 states have (on average 1.2446351931330473) internal successors, (290), 235 states have internal predecessors, (290), 92 states have call successors, (92), 28 states have call predecessors, (92), 28 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-15 20:17:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 474 transitions. [2023-12-15 20:17:33,212 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 474 transitions. Word has length 158 [2023-12-15 20:17:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:33,213 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 474 transitions. [2023-12-15 20:17:33,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-15 20:17:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 474 transitions. [2023-12-15 20:17:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-15 20:17:33,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:33,214 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:33,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:17:33,215 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:33,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1007376058, now seen corresponding path program 1 times [2023-12-15 20:17:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137083556] [2023-12-15 20:17:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-15 20:17:33,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:33,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137083556] [2023-12-15 20:17:33,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137083556] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:17:33,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034998994] [2023-12-15 20:17:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:33,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:17:33,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:17:33,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:17:33,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 20:17:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:33,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-15 20:17:33,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:17:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 578 proven. 72 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-12-15 20:17:34,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:17:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-15 20:17:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034998994] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:17:34,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:17:34,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 5] total 12 [2023-12-15 20:17:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761416147] [2023-12-15 20:17:34,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:17:34,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 20:17:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 20:17:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:17:34,248 INFO L87 Difference]: Start difference. First operand 354 states and 474 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2023-12-15 20:17:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:34,539 INFO L93 Difference]: Finished difference Result 576 states and 765 transitions. [2023-12-15 20:17:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:17:34,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) Word has length 158 [2023-12-15 20:17:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:34,541 INFO L225 Difference]: With dead ends: 576 [2023-12-15 20:17:34,541 INFO L226 Difference]: Without dead ends: 290 [2023-12-15 20:17:34,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2023-12-15 20:17:34,544 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 66 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:34,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 319 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:17:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-15 20:17:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2023-12-15 20:17:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 181 states have (on average 1.2044198895027625) internal successors, (218), 181 states have internal predecessors, (218), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-15 20:17:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 362 transitions. [2023-12-15 20:17:34,604 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 362 transitions. Word has length 158 [2023-12-15 20:17:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:34,604 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 362 transitions. [2023-12-15 20:17:34,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2023-12-15 20:17:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 362 transitions. [2023-12-15 20:17:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-15 20:17:34,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:34,606 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:34,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 20:17:34,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:17:34,813 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:34,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -259488326, now seen corresponding path program 1 times [2023-12-15 20:17:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874108121] [2023-12-15 20:17:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 20:17:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874108121] [2023-12-15 20:17:35,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874108121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:17:35,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:17:35,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:17:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282878629] [2023-12-15 20:17:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:17:35,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:17:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:17:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:17:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:17:35,258 INFO L87 Difference]: Start difference. First operand 278 states and 362 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:17:35,688 INFO L93 Difference]: Finished difference Result 616 states and 818 transitions. [2023-12-15 20:17:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:17:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-15 20:17:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:17:35,692 INFO L225 Difference]: With dead ends: 616 [2023-12-15 20:17:35,692 INFO L226 Difference]: Without dead ends: 410 [2023-12-15 20:17:35,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:17:35,693 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:17:35,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 318 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:17:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-12-15 20:17:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 286. [2023-12-15 20:17:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 189 states have (on average 1.216931216931217) internal successors, (230), 189 states have internal predecessors, (230), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-15 20:17:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 374 transitions. [2023-12-15 20:17:35,774 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 374 transitions. Word has length 158 [2023-12-15 20:17:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:17:35,774 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 374 transitions. [2023-12-15 20:17:35,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-15 20:17:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 374 transitions. [2023-12-15 20:17:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-15 20:17:35,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:17:35,776 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:17:35,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:17:35,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:17:35,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:17:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash 420570044, now seen corresponding path program 1 times [2023-12-15 20:17:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:17:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179637789] [2023-12-15 20:17:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:17:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:17:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:17:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:17:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:17:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:17:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:17:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:17:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:17:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:17:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:17:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:17:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:17:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:17:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:17:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:17:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:17:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:17:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:17:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:17:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:17:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:17:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:17:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:17:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 20:17:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-12-15 20:17:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:17:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179637789] [2023-12-15 20:17:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179637789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:17:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991056397] [2023-12-15 20:17:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:17:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:17:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:17:48,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:17:48,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 20:17:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:17:48,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-15 20:17:48,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:17:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 482 proven. 294 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-12-15 20:17:50,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:18:12,706 WARN L854 $PredicateComparison]: unable to prove that (or (= 0 c_~var_1_7~0) (let ((.cse3 (mod c_~var_1_8~0 4294967296)) (.cse11 (mod (+ c_~var_1_8~0 c_~var_1_7~0) 4294967296))) (let ((.cse5 (* .cse11 (- 4294967295))) (.cse7 (* .cse11 4294967295)) (.cse6 (* .cse3 4294967295)) (.cse2 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_y_10 Int) (v_y_11 Int) (v_z_11 Int)) (let ((.cse1 (+ (* v_y_10 4294967296) (* 18446744069414584320 v_y_11))) (.cse0 (* v_z_11 4294967295)) (.cse4 (* v_y_11 4294967296))) (or (< (+ .cse0 126) .cse1) (< (+ .cse2 v_z_11) 4294967297) (< (+ v_z_11 4294967295) (+ .cse3 .cse4)) (< .cse1 .cse0) (< 3221225473 v_z_11) (< .cse4 v_z_11)))) (<= (+ 18446744069414584320 (* (div (+ .cse5 .cse6 (- 18446744069414584194)) 4294967296) 4294967296) .cse7) .cse6) (forall ((v_y_20 Int) (v_z_20 Int) (v_y_10 Int)) (let ((.cse10 (* v_z_20 4294967295)) (.cse9 (+ (* v_y_10 4294967296) (* 18446744069414584320 v_y_20))) (.cse8 (* v_y_20 4294967296))) (or (< (+ .cse3 .cse8) (+ v_z_20 4294967296)) (< .cse9 .cse10) (< (+ .cse10 126) .cse9) (< (+ v_z_20 4294967295) .cse8) (< (+ .cse2 v_z_20) 4294967297) (< 3221225473 v_z_20)))) (or (< (+ (* 4294967296 (div (+ 126 .cse5 .cse6) 4294967296)) .cse7) (+ .cse6 1)) (< .cse11 .cse3)) (forall ((v_y_13 Int) (v_y_19 Int) (v_z_19 Int) (v_y_10 Int)) (let ((.cse12 (* v_y_19 4294967296))) (let ((.cse13 (* v_y_13 4294967296)) (.cse17 (+ v_z_19 .cse12)) (.cse16 (+ (* 18446744069414584320 v_y_13) (* v_y_10 4294967296))) (.cse14 (* 18446744069414584320 v_y_19)) (.cse15 (* v_z_19 4294967295))) (or (< (+ v_z_19 4294967295 .cse12) .cse13) (< 3221225473 v_z_19) (< (+ .cse2 v_z_19) 4294967297) (< (+ .cse14 126 .cse15) .cse16) (< .cse17 0) (< .cse13 .cse17) (< 3221225473 .cse17) (< .cse16 (+ .cse14 .cse15)))))))))) is different from false [2023-12-15 20:18:12,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991056397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:18:12,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:18:12,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 42 [2023-12-15 20:18:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634800463] [2023-12-15 20:18:12,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 20:18:12,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-15 20:18:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:18:12,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-15 20:18:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2162, Unknown=2, NotChecked=98, Total=2652 [2023-12-15 20:18:12,715 INFO L87 Difference]: Start difference. First operand 286 states and 374 transitions. Second operand has 42 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 37 states have internal predecessors, (100), 15 states have call successors, (48), 8 states have call predecessors, (48), 10 states have return successors, (48), 11 states have call predecessors, (48), 15 states have call successors, (48) Received shutdown request... [2023-12-15 20:18:19,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 20:18:19,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 20:18:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-15 20:18:20,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=1705, Invalid=6307, Unknown=2, NotChecked=176, Total=8190 [2023-12-15 20:18:20,031 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 699 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:18:20,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 360 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-15 20:18:20,032 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:18:20,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 20:18:20,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:18:20,234 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (286states) and FLOYD_HOARE automaton (currently 41 states, 42 states before enhancement),while ReachableStatesComputation was computing reachable states (143 states constructed, input type IntersectNwa). [2023-12-15 20:18:20,237 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:18:20,238 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:18:20,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:18:20 BoogieIcfgContainer [2023-12-15 20:18:20,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:18:20,240 INFO L158 Benchmark]: Toolchain (without parser) took 58854.91ms. Allocated memory was 252.7MB in the beginning and 566.2MB in the end (delta: 313.5MB). Free memory was 204.1MB in the beginning and 443.3MB in the end (delta: -239.2MB). Peak memory consumption was 74.7MB. Max. memory is 8.0GB. [2023-12-15 20:18:20,240 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 195.0MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:18:20,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.28ms. Allocated memory is still 252.7MB. Free memory was 203.8MB in the beginning and 189.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 20:18:20,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.49ms. Allocated memory is still 252.7MB. Free memory was 189.1MB in the beginning and 186.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:18:20,241 INFO L158 Benchmark]: Boogie Preprocessor took 72.16ms. Allocated memory is still 252.7MB. Free memory was 186.3MB in the beginning and 183.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:18:20,241 INFO L158 Benchmark]: RCFGBuilder took 610.08ms. Allocated memory is still 252.7MB. Free memory was 183.1MB in the beginning and 219.3MB in the end (delta: -36.2MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2023-12-15 20:18:20,242 INFO L158 Benchmark]: TraceAbstraction took 57771.36ms. Allocated memory was 252.7MB in the beginning and 566.2MB in the end (delta: 313.5MB). Free memory was 218.8MB in the beginning and 443.3MB in the end (delta: -224.5MB). Peak memory consumption was 89.0MB. Max. memory is 8.0GB. [2023-12-15 20:18:20,243 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 195.0MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.28ms. Allocated memory is still 252.7MB. Free memory was 203.8MB in the beginning and 189.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.49ms. Allocated memory is still 252.7MB. Free memory was 189.1MB in the beginning and 186.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.16ms. Allocated memory is still 252.7MB. Free memory was 186.3MB in the beginning and 183.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 610.08ms. Allocated memory is still 252.7MB. Free memory was 183.1MB in the beginning and 219.3MB in the end (delta: -36.2MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. * TraceAbstraction took 57771.36ms. Allocated memory was 252.7MB in the beginning and 566.2MB in the end (delta: 313.5MB). Free memory was 218.8MB in the beginning and 443.3MB in the end (delta: -224.5MB). Peak memory consumption was 89.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (286states) and FLOYD_HOARE automaton (currently 41 states, 42 states before enhancement),while ReachableStatesComputation was computing reachable states (143 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.7s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2173 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2155 mSDsluCounter, 3359 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2251 mSDsCounter, 672 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2663 IncrementalHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 672 mSolverCounterUnsat, 1108 mSDtfsCounter, 2663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1937 GetRequests, 1748 SyntacticMatches, 3 SemanticMatches, 186 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2284 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=8, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 461 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 42.7s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2791 ConstructedInterpolants, 0 QuantifiedInterpolants, 14950 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1553 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 18930/19872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown