/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:23:07,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:23:07,605 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-21 11:23:07,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:23:07,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:23:07,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:23:07,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:23:07,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:23:07,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:23:07,638 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:23:07,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:23:07,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:23:07,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:23:07,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:23:07,640 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:23:07,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:23:07,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:23:07,641 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:23:07,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:23:07,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:23:07,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:23:07,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:23:07,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:23:07,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:23:07,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:23:07,643 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:23:07,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:23:07,643 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:23:07,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:23:07,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:23:07,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:23:07,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:23:07,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:23:07,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:23:07,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:23:07,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:23:07,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:23:07,646 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 -> false [2023-12-21 11:23:07,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:23:07,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:23:07,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:23:07,834 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:23:07,835 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:23:07,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2023-12-21 11:23:08,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:23:09,195 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:23:09,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2023-12-21 11:23:09,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d95f590/2814f7df4d0f45e2a426683b49453781/FLAG12feaa5d6 [2023-12-21 11:23:09,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d95f590/2814f7df4d0f45e2a426683b49453781 [2023-12-21 11:23:09,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:23:09,224 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:23:09,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:23:09,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:23:09,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:23:09,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6535c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09, skipping insertion in model container [2023-12-21 11:23:09,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,268 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:23:09,447 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2023-12-21 11:23:09,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:23:09,465 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:23:09,524 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2023-12-21 11:23:09,525 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:23:09,536 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:23:09,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09 WrapperNode [2023-12-21 11:23:09,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:23:09,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:23:09,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:23:09,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:23:09,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,583 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 497 [2023-12-21 11:23:09,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:23:09,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:23:09,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:23:09,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:23:09,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,615 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-21 11:23:09,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:23:09,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:23:09,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:23:09,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:23:09,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (1/1) ... [2023-12-21 11:23:09,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:23:09,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:23:09,675 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-21 11:23:09,698 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-21 11:23:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-12-21 11:23:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-12-21 11:23:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:23:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-12-21 11:23:09,714 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-12-21 11:23:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-12-21 11:23:09,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-12-21 11:23:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-12-21 11:23:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-12-21 11:23:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 11:23:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 11:23:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:23:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-12-21 11:23:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-12-21 11:23:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:23:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:23:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-12-21 11:23:09,717 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-12-21 11:23:09,833 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:23:09,834 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:23:10,310 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:23:10,356 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:23:10,357 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 11:23:10,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:23:10 BoogieIcfgContainer [2023-12-21 11:23:10,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:23:10,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:23:10,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:23:10,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:23:10,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:23:09" (1/3) ... [2023-12-21 11:23:10,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a97ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:23:10, skipping insertion in model container [2023-12-21 11:23:10,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:23:09" (2/3) ... [2023-12-21 11:23:10,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a97ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:23:10, skipping insertion in model container [2023-12-21 11:23:10,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:23:10" (3/3) ... [2023-12-21 11:23:10,366 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2023-12-21 11:23:10,379 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:23:10,379 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:23:10,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:23:10,435 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;@211eb756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:23:10,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:23:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-21 11:23:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 11:23:10,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:10,447 INFO L195 NwaCegarLoop]: trace histogram [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-21 11:23:10,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:10,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 975176766, now seen corresponding path program 1 times [2023-12-21 11:23:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:10,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950386510] [2023-12-21 11:23:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:23:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:23:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950386510] [2023-12-21 11:23:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950386510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:10,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:23:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332496837] [2023-12-21 11:23:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:10,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 11:23:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 11:23:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 11:23:10,757 INFO L87 Difference]: Start difference. First operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:23:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:10,821 INFO L93 Difference]: Finished difference Result 323 states and 540 transitions. [2023-12-21 11:23:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 11:23:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-21 11:23:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:10,833 INFO L225 Difference]: With dead ends: 323 [2023-12-21 11:23:10,833 INFO L226 Difference]: Without dead ends: 168 [2023-12-21 11:23:10,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-21 11:23:10,841 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:10,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-21 11:23:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-12-21 11:23:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.573643410852713) internal successors, (203), 130 states have internal predecessors, (203), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-21 11:23:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 265 transitions. [2023-12-21 11:23:10,890 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 265 transitions. Word has length 23 [2023-12-21 11:23:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:10,890 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 265 transitions. [2023-12-21 11:23:10,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:23:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 265 transitions. [2023-12-21 11:23:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 11:23:10,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:10,892 INFO L195 NwaCegarLoop]: trace histogram [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-21 11:23:10,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:23:10,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:10,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:10,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1018967940, now seen corresponding path program 1 times [2023-12-21 11:23:10,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:10,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802048050] [2023-12-21 11:23:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:10,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:23:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:23:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802048050] [2023-12-21 11:23:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802048050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:11,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:23:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224317394] [2023-12-21 11:23:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:23:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:23:11,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:23:11,047 INFO L87 Difference]: Start difference. First operand 168 states and 265 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:23:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:11,138 INFO L93 Difference]: Finished difference Result 323 states and 505 transitions. [2023-12-21 11:23:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:23:11,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-21 11:23:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:11,141 INFO L225 Difference]: With dead ends: 323 [2023-12-21 11:23:11,141 INFO L226 Difference]: Without dead ends: 168 [2023-12-21 11:23:11,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:23:11,143 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 131 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:11,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1108 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-21 11:23:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-12-21 11:23:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-21 11:23:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2023-12-21 11:23:11,161 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 23 [2023-12-21 11:23:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:11,161 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2023-12-21 11:23:11,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:23:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2023-12-21 11:23:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 11:23:11,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:11,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:11,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:23:11,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:11,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash 26280683, now seen corresponding path program 1 times [2023-12-21 11:23:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851402763] [2023-12-21 11:23:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:23:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851402763] [2023-12-21 11:23:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851402763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365123608] [2023-12-21 11:23:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:11,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:11,290 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:23:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:11,339 INFO L93 Difference]: Finished difference Result 324 states and 497 transitions. [2023-12-21 11:23:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:11,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2023-12-21 11:23:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:11,340 INFO L225 Difference]: With dead ends: 324 [2023-12-21 11:23:11,340 INFO L226 Difference]: Without dead ends: 172 [2023-12-21 11:23:11,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-21 11:23:11,344 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 5 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 716 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.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:11,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 716 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-21 11:23:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-12-21 11:23:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.4696969696969697) internal successors, (194), 133 states have internal predecessors, (194), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-21 11:23:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2023-12-21 11:23:11,368 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 34 [2023-12-21 11:23:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:11,369 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2023-12-21 11:23:11,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:23:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2023-12-21 11:23:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-21 11:23:11,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:11,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:11,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:23:11,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:11,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1285077620, now seen corresponding path program 1 times [2023-12-21 11:23:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:11,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295037538] [2023-12-21 11:23:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:23:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295037538] [2023-12-21 11:23:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295037538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:11,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:11,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:23:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317017633] [2023-12-21 11:23:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:11,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:23:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:23:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:23:11,468 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:11,559 INFO L93 Difference]: Finished difference Result 473 states and 714 transitions. [2023-12-21 11:23:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:23:11,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2023-12-21 11:23:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:11,562 INFO L225 Difference]: With dead ends: 473 [2023-12-21 11:23:11,562 INFO L226 Difference]: Without dead ends: 317 [2023-12-21 11:23:11,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:23:11,563 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:11,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 495 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-21 11:23:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2023-12-21 11:23:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 239 states have internal predecessors, (352), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-21 11:23:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2023-12-21 11:23:11,579 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 48 [2023-12-21 11:23:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:11,579 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2023-12-21 11:23:11,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2023-12-21 11:23:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-21 11:23:11,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:11,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:23:11,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:11,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash -271052700, now seen corresponding path program 1 times [2023-12-21 11:23:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:11,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90970018] [2023-12-21 11:23:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:23:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:11,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90970018] [2023-12-21 11:23:11,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90970018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:11,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:23:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829003068] [2023-12-21 11:23:11,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:11,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:23:11,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:11,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:23:11,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:23:11,627 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:11,672 INFO L93 Difference]: Finished difference Result 886 states and 1342 transitions. [2023-12-21 11:23:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:23:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2023-12-21 11:23:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:11,677 INFO L225 Difference]: With dead ends: 886 [2023-12-21 11:23:11,677 INFO L226 Difference]: Without dead ends: 588 [2023-12-21 11:23:11,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:23:11,678 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 210 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:11,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2023-12-21 11:23:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 582. [2023-12-21 11:23:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 437 states have internal predecessors, (647), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-21 11:23:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 881 transitions. [2023-12-21 11:23:11,722 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 881 transitions. Word has length 49 [2023-12-21 11:23:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:11,724 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 881 transitions. [2023-12-21 11:23:11,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 881 transitions. [2023-12-21 11:23:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-21 11:23:11,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:11,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:11,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:23:11,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:11,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1550916378, now seen corresponding path program 1 times [2023-12-21 11:23:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72428741] [2023-12-21 11:23:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:23:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72428741] [2023-12-21 11:23:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72428741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:23:11,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157049351] [2023-12-21 11:23:11,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:11,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:23:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:23:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:23:11,836 INFO L87 Difference]: Start difference. First operand 582 states and 881 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:11,960 INFO L93 Difference]: Finished difference Result 1237 states and 1874 transitions. [2023-12-21 11:23:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:23:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2023-12-21 11:23:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:11,965 INFO L225 Difference]: With dead ends: 1237 [2023-12-21 11:23:11,965 INFO L226 Difference]: Without dead ends: 671 [2023-12-21 11:23:11,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:23:11,967 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 351 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:11,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 643 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-12-21 11:23:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2023-12-21 11:23:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 501 states have (on average 1.4810379241516967) internal successors, (742), 504 states have internal predecessors, (742), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 990 transitions. [2023-12-21 11:23:12,003 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 990 transitions. Word has length 49 [2023-12-21 11:23:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:12,003 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 990 transitions. [2023-12-21 11:23:12,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 990 transitions. [2023-12-21 11:23:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 11:23:12,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:12,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:12,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 11:23:12,006 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:12,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1743107091, now seen corresponding path program 1 times [2023-12-21 11:23:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:12,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24493625] [2023-12-21 11:23:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:23:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24493625] [2023-12-21 11:23:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24493625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:12,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:12,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:23:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771610582] [2023-12-21 11:23:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:12,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:23:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:23:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:23:12,119 INFO L87 Difference]: Start difference. First operand 663 states and 990 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:12,258 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2023-12-21 11:23:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:23:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2023-12-21 11:23:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:12,262 INFO L225 Difference]: With dead ends: 1241 [2023-12-21 11:23:12,262 INFO L226 Difference]: Without dead ends: 675 [2023-12-21 11:23:12,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:23:12,266 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 348 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:12,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-12-21 11:23:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2023-12-21 11:23:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 512 states have internal predecessors, (750), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 998 transitions. [2023-12-21 11:23:12,304 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 998 transitions. Word has length 50 [2023-12-21 11:23:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:12,306 INFO L495 AbstractCegarLoop]: Abstraction has 671 states and 998 transitions. [2023-12-21 11:23:12,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 998 transitions. [2023-12-21 11:23:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 11:23:12,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:12,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:12,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:23:12,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:12,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1020972895, now seen corresponding path program 1 times [2023-12-21 11:23:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181663355] [2023-12-21 11:23:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 11:23:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:12,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181663355] [2023-12-21 11:23:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181663355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:12,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:12,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111486905] [2023-12-21 11:23:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:12,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:12,458 INFO L87 Difference]: Start difference. First operand 671 states and 998 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:12,583 INFO L93 Difference]: Finished difference Result 1241 states and 1866 transitions. [2023-12-21 11:23:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2023-12-21 11:23:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:12,587 INFO L225 Difference]: With dead ends: 1241 [2023-12-21 11:23:12,587 INFO L226 Difference]: Without dead ends: 675 [2023-12-21 11:23:12,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-21 11:23:12,590 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 61 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:12,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 638 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-12-21 11:23:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2023-12-21 11:23:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4656188605108056) internal successors, (746), 512 states have internal predecessors, (746), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 994 transitions. [2023-12-21 11:23:12,627 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 994 transitions. Word has length 52 [2023-12-21 11:23:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:12,628 INFO L495 AbstractCegarLoop]: Abstraction has 671 states and 994 transitions. [2023-12-21 11:23:12,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:23:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 994 transitions. [2023-12-21 11:23:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 11:23:12,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:12,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:12,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:23:12,629 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:12,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 70077876, now seen corresponding path program 1 times [2023-12-21 11:23:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607357678] [2023-12-21 11:23:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:12,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607357678] [2023-12-21 11:23:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607357678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:12,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528287007] [2023-12-21 11:23:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:12,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:12,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:12,743 INFO L87 Difference]: Start difference. First operand 671 states and 994 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 11:23:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:12,799 INFO L93 Difference]: Finished difference Result 1257 states and 1886 transitions. [2023-12-21 11:23:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2023-12-21 11:23:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:12,802 INFO L225 Difference]: With dead ends: 1257 [2023-12-21 11:23:12,803 INFO L226 Difference]: Without dead ends: 691 [2023-12-21 11:23:12,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-21 11:23:12,805 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 6 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:12,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 728 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2023-12-21 11:23:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2023-12-21 11:23:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 525 states have (on average 1.4514285714285715) internal successors, (762), 528 states have internal predecessors, (762), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1010 transitions. [2023-12-21 11:23:12,849 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1010 transitions. Word has length 53 [2023-12-21 11:23:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:12,849 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 1010 transitions. [2023-12-21 11:23:12,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 11:23:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1010 transitions. [2023-12-21 11:23:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 11:23:12,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:12,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:12,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:23:12,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:12,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2022849498, now seen corresponding path program 1 times [2023-12-21 11:23:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108944398] [2023-12-21 11:23:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108944398] [2023-12-21 11:23:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108944398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:12,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780876016] [2023-12-21 11:23:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:12,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:12,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:12,939 INFO L87 Difference]: Start difference. First operand 691 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:23:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:13,004 INFO L93 Difference]: Finished difference Result 1297 states and 1930 transitions. [2023-12-21 11:23:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:13,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2023-12-21 11:23:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:13,007 INFO L225 Difference]: With dead ends: 1297 [2023-12-21 11:23:13,007 INFO L226 Difference]: Without dead ends: 711 [2023-12-21 11:23:13,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-21 11:23:13,009 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 6 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:13,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-12-21 11:23:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2023-12-21 11:23:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 541 states have (on average 1.4380776340110906) internal successors, (778), 544 states have internal predecessors, (778), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1026 transitions. [2023-12-21 11:23:13,044 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1026 transitions. Word has length 61 [2023-12-21 11:23:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:13,045 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1026 transitions. [2023-12-21 11:23:13,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:23:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1026 transitions. [2023-12-21 11:23:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-21 11:23:13,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:13,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:13,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:23:13,046 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:13,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1319245148, now seen corresponding path program 1 times [2023-12-21 11:23:13,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:13,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690141396] [2023-12-21 11:23:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690141396] [2023-12-21 11:23:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690141396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:13,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:13,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249793310] [2023-12-21 11:23:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:13,130 INFO L87 Difference]: Start difference. First operand 711 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:23:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:13,189 INFO L93 Difference]: Finished difference Result 1333 states and 1946 transitions. [2023-12-21 11:23:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2023-12-21 11:23:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:13,192 INFO L225 Difference]: With dead ends: 1333 [2023-12-21 11:23:13,192 INFO L226 Difference]: Without dead ends: 727 [2023-12-21 11:23:13,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-21 11:23:13,194 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:13,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 723 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-12-21 11:23:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2023-12-21 11:23:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 553 states have (on average 1.4285714285714286) internal successors, (790), 556 states have internal predecessors, (790), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1038 transitions. [2023-12-21 11:23:13,253 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1038 transitions. Word has length 69 [2023-12-21 11:23:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:13,253 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 1038 transitions. [2023-12-21 11:23:13,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:23:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1038 transitions. [2023-12-21 11:23:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-21 11:23:13,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:13,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:23:13,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:13,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1077214155, now seen corresponding path program 1 times [2023-12-21 11:23:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:13,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650488818] [2023-12-21 11:23:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:23:13,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:13,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650488818] [2023-12-21 11:23:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650488818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:13,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:13,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687689264] [2023-12-21 11:23:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:13,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:13,352 INFO L87 Difference]: Start difference. First operand 727 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:23:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:13,416 INFO L93 Difference]: Finished difference Result 1369 states and 1986 transitions. [2023-12-21 11:23:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:13,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2023-12-21 11:23:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:13,419 INFO L225 Difference]: With dead ends: 1369 [2023-12-21 11:23:13,419 INFO L226 Difference]: Without dead ends: 747 [2023-12-21 11:23:13,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-21 11:23:13,421 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 6 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:13,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2023-12-21 11:23:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2023-12-21 11:23:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 569 states have (on average 1.4165202108963093) internal successors, (806), 572 states have internal predecessors, (806), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1054 transitions. [2023-12-21 11:23:13,453 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1054 transitions. Word has length 69 [2023-12-21 11:23:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:13,454 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 1054 transitions. [2023-12-21 11:23:13,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:23:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1054 transitions. [2023-12-21 11:23:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 11:23:13,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:13,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:13,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:23:13,455 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:13,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash 371503403, now seen corresponding path program 1 times [2023-12-21 11:23:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:13,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20807443] [2023-12-21 11:23:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:23:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20807443] [2023-12-21 11:23:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20807443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531841605] [2023-12-21 11:23:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:13,569 INFO L87 Difference]: Start difference. First operand 747 states and 1054 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 11:23:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:13,626 INFO L93 Difference]: Finished difference Result 1413 states and 2014 transitions. [2023-12-21 11:23:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2023-12-21 11:23:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:13,629 INFO L225 Difference]: With dead ends: 1413 [2023-12-21 11:23:13,629 INFO L226 Difference]: Without dead ends: 771 [2023-12-21 11:23:13,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-21 11:23:13,631 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 7 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:13,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 725 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-12-21 11:23:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2023-12-21 11:23:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 589 states have (on average 1.4023769100169778) internal successors, (826), 592 states have internal predecessors, (826), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-21 11:23:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1074 transitions. [2023-12-21 11:23:13,695 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1074 transitions. Word has length 77 [2023-12-21 11:23:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:13,695 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1074 transitions. [2023-12-21 11:23:13,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 11:23:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1074 transitions. [2023-12-21 11:23:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-21 11:23:13,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:13,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:13,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 11:23:13,697 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:13,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1261624674, now seen corresponding path program 1 times [2023-12-21 11:23:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612952962] [2023-12-21 11:23:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:13,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:23:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 11:23:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612952962] [2023-12-21 11:23:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612952962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:23:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856381038] [2023-12-21 11:23:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:13,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:23:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:23:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:23:13,857 INFO L87 Difference]: Start difference. First operand 771 states and 1074 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:23:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:14,093 INFO L93 Difference]: Finished difference Result 2143 states and 3005 transitions. [2023-12-21 11:23:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:23:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2023-12-21 11:23:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:14,099 INFO L225 Difference]: With dead ends: 2143 [2023-12-21 11:23:14,099 INFO L226 Difference]: Without dead ends: 1477 [2023-12-21 11:23:14,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:23:14,101 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 259 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:14,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1368 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2023-12-21 11:23:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1047. [2023-12-21 11:23:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 792 states have (on average 1.3888888888888888) internal successors, (1100), 797 states have internal predecessors, (1100), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2023-12-21 11:23:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1444 transitions. [2023-12-21 11:23:14,175 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1444 transitions. Word has length 80 [2023-12-21 11:23:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:14,175 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1444 transitions. [2023-12-21 11:23:14,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:23:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1444 transitions. [2023-12-21 11:23:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 11:23:14,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:14,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 11:23:14,176 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:14,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash 203336820, now seen corresponding path program 1 times [2023-12-21 11:23:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:14,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915979159] [2023-12-21 11:23:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 11:23:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 11:23:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915979159] [2023-12-21 11:23:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915979159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982836274] [2023-12-21 11:23:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:14,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:14,290 INFO L87 Difference]: Start difference. First operand 1047 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-21 11:23:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:14,366 INFO L93 Difference]: Finished difference Result 1953 states and 2714 transitions. [2023-12-21 11:23:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:23:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2023-12-21 11:23:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:14,370 INFO L225 Difference]: With dead ends: 1953 [2023-12-21 11:23:14,370 INFO L226 Difference]: Without dead ends: 1071 [2023-12-21 11:23:14,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 11:23:14,372 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:14,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 723 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:23:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-21 11:23:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-21 11:23:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 810 states have (on average 1.3802469135802469) internal successors, (1118), 815 states have internal predecessors, (1118), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2023-12-21 11:23:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1462 transitions. [2023-12-21 11:23:14,452 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1462 transitions. Word has length 84 [2023-12-21 11:23:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:14,452 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1462 transitions. [2023-12-21 11:23:14,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-21 11:23:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1462 transitions. [2023-12-21 11:23:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-21 11:23:14,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:14,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:14,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 11:23:14,453 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:14,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1117244196, now seen corresponding path program 1 times [2023-12-21 11:23:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947357110] [2023-12-21 11:23:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:23:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 11:23:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947357110] [2023-12-21 11:23:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947357110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:23:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484102276] [2023-12-21 11:23:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:23:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:23:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:23:14,611 INFO L87 Difference]: Start difference. First operand 1071 states and 1462 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:23:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:14,792 INFO L93 Difference]: Finished difference Result 1485 states and 2136 transitions. [2023-12-21 11:23:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:23:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2023-12-21 11:23:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:14,798 INFO L225 Difference]: With dead ends: 1485 [2023-12-21 11:23:14,798 INFO L226 Difference]: Without dead ends: 1483 [2023-12-21 11:23:14,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:23:14,799 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 311 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:14,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 2430 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2023-12-21 11:23:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1079. [2023-12-21 11:23:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 814 states have (on average 1.3783783783783783) internal successors, (1122), 821 states have internal predecessors, (1122), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2023-12-21 11:23:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1470 transitions. [2023-12-21 11:23:14,868 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1470 transitions. Word has length 83 [2023-12-21 11:23:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:14,868 INFO L495 AbstractCegarLoop]: Abstraction has 1079 states and 1470 transitions. [2023-12-21 11:23:14,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:23:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1470 transitions. [2023-12-21 11:23:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-21 11:23:14,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:14,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:14,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 11:23:14,869 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:14,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1786856787, now seen corresponding path program 1 times [2023-12-21 11:23:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685144439] [2023-12-21 11:23:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:23:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 11:23:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:14,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685144439] [2023-12-21 11:23:14,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685144439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:14,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:23:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632419074] [2023-12-21 11:23:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:14,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:23:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:23:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:23:14,964 INFO L87 Difference]: Start difference. First operand 1079 states and 1470 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:23:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:15,150 INFO L93 Difference]: Finished difference Result 1949 states and 2665 transitions. [2023-12-21 11:23:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:23:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2023-12-21 11:23:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:15,155 INFO L225 Difference]: With dead ends: 1949 [2023-12-21 11:23:15,155 INFO L226 Difference]: Without dead ends: 1117 [2023-12-21 11:23:15,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:23:15,158 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 247 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:15,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1425 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2023-12-21 11:23:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1071. [2023-12-21 11:23:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 817 states have (on average 1.3733170134638923) internal successors, (1122), 829 states have internal predecessors, (1122), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2023-12-21 11:23:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1446 transitions. [2023-12-21 11:23:15,223 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1446 transitions. Word has length 86 [2023-12-21 11:23:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:15,223 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1446 transitions. [2023-12-21 11:23:15,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:23:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1446 transitions. [2023-12-21 11:23:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-21 11:23:15,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:15,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:15,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 11:23:15,224 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:15,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 116448996, now seen corresponding path program 1 times [2023-12-21 11:23:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:15,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560659451] [2023-12-21 11:23:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:23:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 11:23:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 11:23:15,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:15,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560659451] [2023-12-21 11:23:15,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560659451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:15,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:15,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:23:15,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644420246] [2023-12-21 11:23:15,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:15,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:23:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:23:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:23:15,374 INFO L87 Difference]: Start difference. First operand 1071 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 11:23:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:15,540 INFO L93 Difference]: Finished difference Result 2013 states and 2751 transitions. [2023-12-21 11:23:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:23:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2023-12-21 11:23:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:15,544 INFO L225 Difference]: With dead ends: 2013 [2023-12-21 11:23:15,544 INFO L226 Difference]: Without dead ends: 1169 [2023-12-21 11:23:15,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:23:15,546 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 197 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:15,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1588 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-21 11:23:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 964. [2023-12-21 11:23:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 747 states have internal predecessors, (1015), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2023-12-21 11:23:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1305 transitions. [2023-12-21 11:23:15,603 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1305 transitions. Word has length 88 [2023-12-21 11:23:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:15,603 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1305 transitions. [2023-12-21 11:23:15,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 11:23:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1305 transitions. [2023-12-21 11:23:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-21 11:23:15,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:15,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:15,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 11:23:15,604 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:15,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash -741171965, now seen corresponding path program 1 times [2023-12-21 11:23:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:15,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462913381] [2023-12-21 11:23:15,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:15,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:23:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 11:23:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 11:23:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-21 11:23:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:23:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 11:23:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:23:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 11:23:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462913381] [2023-12-21 11:23:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462913381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:23:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020852558] [2023-12-21 11:23:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:15,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:23:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:23:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:23:15,797 INFO L87 Difference]: Start difference. First operand 964 states and 1305 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 11:23:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:16,190 INFO L93 Difference]: Finished difference Result 2071 states and 2845 transitions. [2023-12-21 11:23:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:23:16,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2023-12-21 11:23:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:16,195 INFO L225 Difference]: With dead ends: 2071 [2023-12-21 11:23:16,195 INFO L226 Difference]: Without dead ends: 1253 [2023-12-21 11:23:16,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:23:16,197 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 742 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:16,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1412 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:23:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2023-12-21 11:23:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 980. [2023-12-21 11:23:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 745 states have (on average 1.353020134228188) internal successors, (1008), 756 states have internal predecessors, (1008), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2023-12-21 11:23:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1304 transitions. [2023-12-21 11:23:16,261 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1304 transitions. Word has length 89 [2023-12-21 11:23:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:16,261 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1304 transitions. [2023-12-21 11:23:16,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 11:23:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1304 transitions. [2023-12-21 11:23:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-21 11:23:16,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:16,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:16,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 11:23:16,262 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:16,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1250316306, now seen corresponding path program 1 times [2023-12-21 11:23:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541968639] [2023-12-21 11:23:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 11:23:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 11:23:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:23:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 11:23:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:23:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:23:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 11:23:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 11:23:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541968639] [2023-12-21 11:23:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541968639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:16,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:16,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:23:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390032364] [2023-12-21 11:23:16,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:23:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:16,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:23:16,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:23:16,325 INFO L87 Difference]: Start difference. First operand 980 states and 1304 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:23:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:16,554 INFO L93 Difference]: Finished difference Result 2597 states and 3474 transitions. [2023-12-21 11:23:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:23:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-12-21 11:23:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:16,561 INFO L225 Difference]: With dead ends: 2597 [2023-12-21 11:23:16,561 INFO L226 Difference]: Without dead ends: 1814 [2023-12-21 11:23:16,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 11:23:16,563 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 198 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:16,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:23:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2023-12-21 11:23:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1707. [2023-12-21 11:23:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1282 states have (on average 1.3424336973478939) internal successors, (1721), 1301 states have internal predecessors, (1721), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2023-12-21 11:23:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2265 transitions. [2023-12-21 11:23:16,702 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2265 transitions. Word has length 90 [2023-12-21 11:23:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:16,702 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2265 transitions. [2023-12-21 11:23:16,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:23:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2265 transitions. [2023-12-21 11:23:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-21 11:23:16,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:16,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:16,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 11:23:16,704 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:16,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:16,704 INFO L85 PathProgramCache]: Analyzing trace with hash -386379641, now seen corresponding path program 1 times [2023-12-21 11:23:16,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:16,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181996816] [2023-12-21 11:23:16,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:23:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 11:23:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 11:23:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:23:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 11:23:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:23:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:23:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 11:23:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:23:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 11:23:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:23:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181996816] [2023-12-21 11:23:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181996816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:23:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:23:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:23:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492063638] [2023-12-21 11:23:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:23:16,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:23:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:23:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:23:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:23:16,878 INFO L87 Difference]: Start difference. First operand 1707 states and 2265 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:23:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:23:17,428 INFO L93 Difference]: Finished difference Result 3573 states and 4801 transitions. [2023-12-21 11:23:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:23:17,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2023-12-21 11:23:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:23:17,436 INFO L225 Difference]: With dead ends: 3573 [2023-12-21 11:23:17,436 INFO L226 Difference]: Without dead ends: 2139 [2023-12-21 11:23:17,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:23:17,438 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 574 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:23:17,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1590 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:23:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-21 11:23:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1734. [2023-12-21 11:23:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1296 states have (on average 1.3356481481481481) internal successors, (1731), 1316 states have internal predecessors, (1731), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2023-12-21 11:23:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2291 transitions. [2023-12-21 11:23:17,567 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2291 transitions. Word has length 92 [2023-12-21 11:23:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:23:17,567 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 2291 transitions. [2023-12-21 11:23:17,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:23:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2291 transitions. [2023-12-21 11:23:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-21 11:23:17,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:23:17,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:23:17,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 11:23:17,569 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:23:17,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:23:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash 890629356, now seen corresponding path program 1 times [2023-12-21 11:23:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:23:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826238868] [2023-12-21 11:23:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:23:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:23:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:23:17,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 11:23:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:23:17,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 11:23:17,668 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 11:23:17,669 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:23:17,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 11:23:17,673 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:23:17,676 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:23:17,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:23:17 BoogieIcfgContainer [2023-12-21 11:23:17,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:23:17,762 INFO L158 Benchmark]: Toolchain (without parser) took 8538.48ms. Allocated memory was 271.6MB in the beginning and 628.1MB in the end (delta: 356.5MB). Free memory was 233.5MB in the beginning and 373.7MB in the end (delta: -140.2MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. [2023-12-21 11:23:17,762 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:23:17,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.97ms. Allocated memory is still 271.6MB. Free memory was 233.0MB in the beginning and 214.6MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 11:23:17,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.20ms. Allocated memory is still 271.6MB. Free memory was 214.6MB in the beginning and 211.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 11:23:17,763 INFO L158 Benchmark]: Boogie Preprocessor took 51.32ms. Allocated memory is still 271.6MB. Free memory was 211.5MB in the beginning and 206.8MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 11:23:17,763 INFO L158 Benchmark]: RCFGBuilder took 721.82ms. Allocated memory is still 271.6MB. Free memory was 206.8MB in the beginning and 166.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-21 11:23:17,763 INFO L158 Benchmark]: TraceAbstraction took 7402.05ms. Allocated memory was 271.6MB in the beginning and 628.1MB in the end (delta: 356.5MB). Free memory was 166.4MB in the beginning and 373.7MB in the end (delta: -207.3MB). Peak memory consumption was 150.3MB. Max. memory is 8.0GB. [2023-12-21 11:23:17,764 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.11ms. Allocated memory is still 161.5MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.97ms. Allocated memory is still 271.6MB. Free memory was 233.0MB in the beginning and 214.6MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.20ms. Allocated memory is still 271.6MB. Free memory was 214.6MB in the beginning and 211.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.32ms. Allocated memory is still 271.6MB. Free memory was 211.5MB in the beginning and 206.8MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 721.82ms. Allocated memory is still 271.6MB. Free memory was 206.8MB in the beginning and 166.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7402.05ms. Allocated memory was 271.6MB in the beginning and 628.1MB in the end (delta: 356.5MB). Free memory was 166.4MB in the beginning and 373.7MB in the end (delta: -207.3MB). Peak memory consumption was 150.3MB. 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 - CounterExampleResult [Line: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 170 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3964 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3878 mSDsluCounter, 20256 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14548 mSDsCounter, 443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1768 IncrementalHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 443 mSolverCounterUnsat, 5708 mSDtfsCounter, 1768 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1734occurred in iteration=21, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 1895 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1443 NumberOfCodeBlocks, 1443 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 2915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 147/147 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 proved your program to be incorrect! [2023-12-21 11:23:17,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...