./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:58:09,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:58:09,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:58:09,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:58:09,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:58:09,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:58:09,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:58:09,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:58:09,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:58:09,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:58:09,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:58:09,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:58:09,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:58:09,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:58:09,766 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:58:09,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:58:09,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:58:09,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:58:09,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:58:09,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:58:09,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:58:09,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:58:09,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:58:09,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:58:09,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:58:09,770 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:58:09,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:58:09,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:58:09,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:58:09,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:58:09,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:58:09,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:58:09,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:58:09,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:58:09,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:58:09,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:58:09,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:58:09,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:58:09,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:58:09,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:58:09,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:58:09,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:58:09,775 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2024-10-12 19:58:10,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:58:10,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:58:10,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:58:10,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:58:10,064 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:58:10,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2024-10-12 19:58:11,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:58:11,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:58:11,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2024-10-12 19:58:11,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa175a3c/4ab4a3c9a471487ea397b77e79aa5376/FLAG4cbf5e829 [2024-10-12 19:58:12,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa175a3c/4ab4a3c9a471487ea397b77e79aa5376 [2024-10-12 19:58:12,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:58:12,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:58:12,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:58:12,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:58:12,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:58:12,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39132567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12, skipping insertion in model container [2024-10-12 19:58:12,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:58:12,399 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2024-10-12 19:58:12,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:58:12,417 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:58:12,496 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2024-10-12 19:58:12,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:58:12,519 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:58:12,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12 WrapperNode [2024-10-12 19:58:12,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:58:12,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:58:12,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:58:12,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:58:12,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,609 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 505 [2024-10-12 19:58:12,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:58:12,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:58:12,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:58:12,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:58:12,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,666 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]. [2024-10-12 19:58:12,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:58:12,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:58:12,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:58:12,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:58:12,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (1/1) ... [2024-10-12 19:58:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:58:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:12,763 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) [2024-10-12 19:58:12,770 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 [2024-10-12 19:58:12,812 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-12 19:58:12,812 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-12 19:58:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:58:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-12 19:58:12,814 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-12 19:58:12,814 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-12 19:58:12,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-12 19:58:12,815 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-12 19:58:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-12 19:58:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 19:58:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 19:58:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:58:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-12 19:58:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-12 19:58:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:58:12,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:58:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-12 19:58:12,818 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-12 19:58:12,948 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:58:12,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:58:13,637 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-12 19:58:13,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:58:13,708 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:58:13,708 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:58:13,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:13 BoogieIcfgContainer [2024-10-12 19:58:13,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:58:13,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:58:13,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:58:13,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:58:13,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:58:12" (1/3) ... [2024-10-12 19:58:13,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12fd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:58:13, skipping insertion in model container [2024-10-12 19:58:13,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:12" (2/3) ... [2024-10-12 19:58:13,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12fd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:58:13, skipping insertion in model container [2024-10-12 19:58:13,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:13" (3/3) ... [2024-10-12 19:58:13,720 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2024-10-12 19:58:13,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:58:13,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:58:13,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:58:13,809 INFO L333 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, 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;@10b9283b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:58:13,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:58:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 130 states have internal predecessors, (205), 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) [2024-10-12 19:58:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:58:13,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:13,823 INFO L215 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] [2024-10-12 19:58:13,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:13,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1825629780, now seen corresponding path program 1 times [2024-10-12 19:58:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:13,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893398177] [2024-10-12 19:58:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:58:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893398177] [2024-10-12 19:58:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893398177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:58:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14616197] [2024-10-12 19:58:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:14,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:58:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:58:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:58:14,144 INFO L87 Difference]: Start difference. First operand has 169 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 130 states have internal predecessors, (205), 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) [2024-10-12 19:58:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:14,214 INFO L93 Difference]: Finished difference Result 323 states and 535 transitions. [2024-10-12 19:58:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:58:14,217 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 [2024-10-12 19:58:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:14,224 INFO L225 Difference]: With dead ends: 323 [2024-10-12 19:58:14,225 INFO L226 Difference]: Without dead ends: 167 [2024-10-12 19:58:14,231 INFO L431 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 [2024-10-12 19:58:14,236 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:14,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-12 19:58:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-12 19:58:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.5625) internal successors, (200), 128 states have internal predecessors, (200), 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) [2024-10-12 19:58:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 262 transitions. [2024-10-12 19:58:14,300 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 262 transitions. Word has length 23 [2024-10-12 19:58:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:14,301 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 262 transitions. [2024-10-12 19:58:14,301 INFO L472 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) [2024-10-12 19:58:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 262 transitions. [2024-10-12 19:58:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:58:14,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:14,303 INFO L215 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] [2024-10-12 19:58:14,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:58:14,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -168514926, now seen corresponding path program 1 times [2024-10-12 19:58:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362087839] [2024-10-12 19:58:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:58:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362087839] [2024-10-12 19:58:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362087839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:14,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:58:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012935215] [2024-10-12 19:58:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:58:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:58:14,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:14,623 INFO L87 Difference]: Start difference. First operand 167 states and 262 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) [2024-10-12 19:58:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:14,778 INFO L93 Difference]: Finished difference Result 426 states and 676 transitions. [2024-10-12 19:58:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:58:14,779 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 [2024-10-12 19:58:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:14,785 INFO L225 Difference]: With dead ends: 426 [2024-10-12 19:58:14,785 INFO L226 Difference]: Without dead ends: 272 [2024-10-12 19:58:14,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:14,790 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 124 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:14,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1239 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-12 19:58:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 167. [2024-10-12 19:58:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.46875) internal successors, (188), 128 states have internal predecessors, (188), 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) [2024-10-12 19:58:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2024-10-12 19:58:14,827 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 23 [2024-10-12 19:58:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2024-10-12 19:58:14,828 INFO L472 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) [2024-10-12 19:58:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2024-10-12 19:58:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:58:14,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:14,830 INFO L215 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] [2024-10-12 19:58:14,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:58:14,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:14,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1006236297, now seen corresponding path program 1 times [2024-10-12 19:58:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551249875] [2024-10-12 19:58:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551249875] [2024-10-12 19:58:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551249875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053031453] [2024-10-12 19:58:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:15,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:15,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:15,180 INFO L87 Difference]: Start difference. First operand 167 states and 250 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) [2024-10-12 19:58:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:15,271 INFO L93 Difference]: Finished difference Result 322 states and 491 transitions. [2024-10-12 19:58:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:15,272 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 [2024-10-12 19:58:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:15,274 INFO L225 Difference]: With dead ends: 322 [2024-10-12 19:58:15,274 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 19:58:15,274 INFO L431 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 [2024-10-12 19:58:15,277 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 3 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:15,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 707 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 19:58:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-12 19:58:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 131 states have internal predecessors, (191), 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) [2024-10-12 19:58:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2024-10-12 19:58:15,294 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 34 [2024-10-12 19:58:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:15,295 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2024-10-12 19:58:15,295 INFO L472 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) [2024-10-12 19:58:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2024-10-12 19:58:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 19:58:15,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:15,297 INFO L215 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] [2024-10-12 19:58:15,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:58:15,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:15,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 960217751, now seen corresponding path program 1 times [2024-10-12 19:58:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:15,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346117446] [2024-10-12 19:58:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:58:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346117446] [2024-10-12 19:58:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346117446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:15,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512058740] [2024-10-12 19:58:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:15,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:15,434 INFO L87 Difference]: Start difference. First operand 171 states and 253 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) [2024-10-12 19:58:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:15,480 INFO L93 Difference]: Finished difference Result 470 states and 705 transitions. [2024-10-12 19:58:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:15,481 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 [2024-10-12 19:58:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:15,484 INFO L225 Difference]: With dead ends: 470 [2024-10-12 19:58:15,484 INFO L226 Difference]: Without dead ends: 315 [2024-10-12 19:58:15,485 INFO L431 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 [2024-10-12 19:58:15,486 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 206 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 489 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 [2024-10-12 19:58:15,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-12 19:58:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2024-10-12 19:58:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 234 states have (on average 1.4743589743589745) internal successors, (345), 235 states have internal predecessors, (345), 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) [2024-10-12 19:58:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 465 transitions. [2024-10-12 19:58:15,510 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 465 transitions. Word has length 48 [2024-10-12 19:58:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:15,512 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 465 transitions. [2024-10-12 19:58:15,512 INFO L472 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) [2024-10-12 19:58:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 465 transitions. [2024-10-12 19:58:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:58:15,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:15,516 INFO L215 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] [2024-10-12 19:58:15,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:58:15,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:15,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1818036195, now seen corresponding path program 1 times [2024-10-12 19:58:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780302130] [2024-10-12 19:58:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:58:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:15,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:15,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780302130] [2024-10-12 19:58:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780302130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861003565] [2024-10-12 19:58:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:15,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:15,621 INFO L87 Difference]: Start difference. First operand 311 states and 465 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) [2024-10-12 19:58:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:15,696 INFO L93 Difference]: Finished difference Result 877 states and 1321 transitions. [2024-10-12 19:58:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:15,697 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 [2024-10-12 19:58:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:15,727 INFO L225 Difference]: With dead ends: 877 [2024-10-12 19:58:15,728 INFO L226 Difference]: Without dead ends: 582 [2024-10-12 19:58:15,729 INFO L431 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 [2024-10-12 19:58:15,730 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 207 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 509 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 [2024-10-12 19:58:15,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 509 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-12 19:58:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 576. [2024-10-12 19:58:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 427 states have (on average 1.4824355971896956) internal successors, (633), 430 states have internal predecessors, (633), 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) [2024-10-12 19:58:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 867 transitions. [2024-10-12 19:58:15,788 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 867 transitions. Word has length 49 [2024-10-12 19:58:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 867 transitions. [2024-10-12 19:58:15,791 INFO L472 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) [2024-10-12 19:58:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 867 transitions. [2024-10-12 19:58:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:58:15,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:15,792 INFO L215 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] [2024-10-12 19:58:15,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:58:15,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:15,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 538172517, now seen corresponding path program 1 times [2024-10-12 19:58:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:15,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150230467] [2024-10-12 19:58:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:58:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150230467] [2024-10-12 19:58:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150230467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:15,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774057319] [2024-10-12 19:58:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:15,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:15,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:15,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:15,948 INFO L87 Difference]: Start difference. First operand 576 states and 867 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) [2024-10-12 19:58:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:16,120 INFO L93 Difference]: Finished difference Result 1221 states and 1838 transitions. [2024-10-12 19:58:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:16,121 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 [2024-10-12 19:58:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:16,127 INFO L225 Difference]: With dead ends: 1221 [2024-10-12 19:58:16,128 INFO L226 Difference]: Without dead ends: 661 [2024-10-12 19:58:16,130 INFO L431 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 [2024-10-12 19:58:16,131 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 335 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:16,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 644 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-12 19:58:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2024-10-12 19:58:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 495 states have (on average 1.4707070707070706) internal successors, (728), 498 states have internal predecessors, (728), 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) [2024-10-12 19:58:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 976 transitions. [2024-10-12 19:58:16,183 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 976 transitions. Word has length 49 [2024-10-12 19:58:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:16,183 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 976 transitions. [2024-10-12 19:58:16,183 INFO L472 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) [2024-10-12 19:58:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 976 transitions. [2024-10-12 19:58:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:58:16,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:16,185 INFO L215 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] [2024-10-12 19:58:16,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:58:16,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:16,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1226003250, now seen corresponding path program 1 times [2024-10-12 19:58:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744039856] [2024-10-12 19:58:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:58:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744039856] [2024-10-12 19:58:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744039856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112167306] [2024-10-12 19:58:16,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:16,341 INFO L87 Difference]: Start difference. First operand 657 states and 976 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) [2024-10-12 19:58:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:16,522 INFO L93 Difference]: Finished difference Result 1221 states and 1830 transitions. [2024-10-12 19:58:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:16,523 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 [2024-10-12 19:58:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:16,529 INFO L225 Difference]: With dead ends: 1221 [2024-10-12 19:58:16,530 INFO L226 Difference]: Without dead ends: 661 [2024-10-12 19:58:16,531 INFO L431 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 [2024-10-12 19:58:16,532 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 332 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:16,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 647 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-12 19:58:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2024-10-12 19:58:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 495 states have (on average 1.4626262626262627) internal successors, (724), 498 states have internal predecessors, (724), 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) [2024-10-12 19:58:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 972 transitions. [2024-10-12 19:58:16,583 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 972 transitions. Word has length 50 [2024-10-12 19:58:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:16,584 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 972 transitions. [2024-10-12 19:58:16,585 INFO L472 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) [2024-10-12 19:58:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 972 transitions. [2024-10-12 19:58:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 19:58:16,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:16,586 INFO L215 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] [2024-10-12 19:58:16,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:58:16,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:16,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:16,588 INFO L85 PathProgramCache]: Analyzing trace with hash -157915880, now seen corresponding path program 1 times [2024-10-12 19:58:16,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:16,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114628586] [2024-10-12 19:58:16,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:16,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114628586] [2024-10-12 19:58:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114628586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:16,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165026580] [2024-10-12 19:58:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:16,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:16,803 INFO L87 Difference]: Start difference. First operand 657 states and 972 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2024-10-12 19:58:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:16,908 INFO L93 Difference]: Finished difference Result 1237 states and 1850 transitions. [2024-10-12 19:58:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 51 [2024-10-12 19:58:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:16,915 INFO L225 Difference]: With dead ends: 1237 [2024-10-12 19:58:16,915 INFO L226 Difference]: Without dead ends: 677 [2024-10-12 19:58:16,917 INFO L431 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 [2024-10-12 19:58:16,918 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 719 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 [2024-10-12 19:58:16,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 719 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-12 19:58:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2024-10-12 19:58:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 511 states have (on average 1.4481409001956946) internal successors, (740), 514 states have internal predecessors, (740), 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) [2024-10-12 19:58:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 988 transitions. [2024-10-12 19:58:16,977 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 988 transitions. Word has length 51 [2024-10-12 19:58:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:16,977 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 988 transitions. [2024-10-12 19:58:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2024-10-12 19:58:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 988 transitions. [2024-10-12 19:58:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:58:16,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:16,980 INFO L215 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] [2024-10-12 19:58:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:58:16,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -957591869, now seen corresponding path program 1 times [2024-10-12 19:58:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801487400] [2024-10-12 19:58:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801487400] [2024-10-12 19:58:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801487400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979660788] [2024-10-12 19:58:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:17,194 INFO L87 Difference]: Start difference. First operand 677 states and 988 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-10-12 19:58:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:17,295 INFO L93 Difference]: Finished difference Result 1277 states and 1894 transitions. [2024-10-12 19:58:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 59 [2024-10-12 19:58:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,301 INFO L225 Difference]: With dead ends: 1277 [2024-10-12 19:58:17,302 INFO L226 Difference]: Without dead ends: 697 [2024-10-12 19:58:17,304 INFO L431 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 [2024-10-12 19:58:17,304 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 705 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 [2024-10-12 19:58:17,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 705 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-12 19:58:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-10-12 19:58:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 527 states have (on average 1.4345351043643264) internal successors, (756), 530 states have internal predecessors, (756), 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) [2024-10-12 19:58:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1004 transitions. [2024-10-12 19:58:17,351 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1004 transitions. Word has length 59 [2024-10-12 19:58:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:17,352 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1004 transitions. [2024-10-12 19:58:17,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-10-12 19:58:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1004 transitions. [2024-10-12 19:58:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:58:17,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:17,353 INFO L215 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] [2024-10-12 19:58:17,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:58:17,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1844870161, now seen corresponding path program 1 times [2024-10-12 19:58:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203446997] [2024-10-12 19:58:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:17,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:17,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203446997] [2024-10-12 19:58:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203446997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039765432] [2024-10-12 19:58:17,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:17,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:17,547 INFO L87 Difference]: Start difference. First operand 697 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-12 19:58:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:17,655 INFO L93 Difference]: Finished difference Result 1317 states and 1926 transitions. [2024-10-12 19:58:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2024-10-12 19:58:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,660 INFO L225 Difference]: With dead ends: 1317 [2024-10-12 19:58:17,660 INFO L226 Difference]: Without dead ends: 717 [2024-10-12 19:58:17,662 INFO L431 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 [2024-10-12 19:58:17,663 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 705 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:17,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 705 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-12 19:58:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-12 19:58:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 543 states have (on average 1.4217311233885819) internal successors, (772), 546 states have internal predecessors, (772), 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) [2024-10-12 19:58:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1020 transitions. [2024-10-12 19:58:17,715 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1020 transitions. Word has length 67 [2024-10-12 19:58:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1020 transitions. [2024-10-12 19:58:17,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-12 19:58:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1020 transitions. [2024-10-12 19:58:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:58:17,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:17,719 INFO L215 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] [2024-10-12 19:58:17,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:58:17,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:17,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash 53637832, now seen corresponding path program 1 times [2024-10-12 19:58:17,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:17,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349520449] [2024-10-12 19:58:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:17,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:17,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349520449] [2024-10-12 19:58:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349520449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:17,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:17,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845933337] [2024-10-12 19:58:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:17,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:17,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:17,883 INFO L87 Difference]: Start difference. First operand 717 states and 1020 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-12 19:58:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:17,978 INFO L93 Difference]: Finished difference Result 1353 states and 1942 transitions. [2024-10-12 19:58:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2024-10-12 19:58:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,985 INFO L225 Difference]: With dead ends: 1353 [2024-10-12 19:58:17,986 INFO L226 Difference]: Without dead ends: 733 [2024-10-12 19:58:17,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:17,989 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 715 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 [2024-10-12 19:58:17,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 715 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-12 19:58:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2024-10-12 19:58:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 555 states have (on average 1.4126126126126126) internal successors, (784), 558 states have internal predecessors, (784), 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) [2024-10-12 19:58:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1032 transitions. [2024-10-12 19:58:18,060 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1032 transitions. Word has length 67 [2024-10-12 19:58:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:18,061 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1032 transitions. [2024-10-12 19:58:18,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-12 19:58:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1032 transitions. [2024-10-12 19:58:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:58:18,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:18,063 INFO L215 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] [2024-10-12 19:58:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:58:18,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:18,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash -343959825, now seen corresponding path program 1 times [2024-10-12 19:58:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692450499] [2024-10-12 19:58:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:18,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692450499] [2024-10-12 19:58:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692450499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:18,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:18,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657440279] [2024-10-12 19:58:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:18,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:18,303 INFO L87 Difference]: Start difference. First operand 733 states and 1032 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, (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) [2024-10-12 19:58:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:18,395 INFO L93 Difference]: Finished difference Result 1393 states and 1978 transitions. [2024-10-12 19:58:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:18,396 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, (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 75 [2024-10-12 19:58:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:18,401 INFO L225 Difference]: With dead ends: 1393 [2024-10-12 19:58:18,401 INFO L226 Difference]: Without dead ends: 757 [2024-10-12 19:58:18,403 INFO L431 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 [2024-10-12 19:58:18,404 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 5 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 717 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 [2024-10-12 19:58:18,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 717 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-12 19:58:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2024-10-12 19:58:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 575 states have (on average 1.3982608695652174) internal successors, (804), 578 states have internal predecessors, (804), 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) [2024-10-12 19:58:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1052 transitions. [2024-10-12 19:58:18,453 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1052 transitions. Word has length 75 [2024-10-12 19:58:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:18,453 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1052 transitions. [2024-10-12 19:58:18,454 INFO L472 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, (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) [2024-10-12 19:58:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1052 transitions. [2024-10-12 19:58:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 19:58:18,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:18,458 INFO L215 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] [2024-10-12 19:58:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:58:18,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:18,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -946423420, now seen corresponding path program 1 times [2024-10-12 19:58:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478926224] [2024-10-12 19:58:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:58:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478926224] [2024-10-12 19:58:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478926224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:19,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511005611] [2024-10-12 19:58:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:19,007 INFO L87 Difference]: Start difference. First operand 757 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-12 19:58:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:19,371 INFO L93 Difference]: Finished difference Result 1977 states and 2731 transitions. [2024-10-12 19:58:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 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 78 [2024-10-12 19:58:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:19,380 INFO L225 Difference]: With dead ends: 1977 [2024-10-12 19:58:19,380 INFO L226 Difference]: Without dead ends: 1317 [2024-10-12 19:58:19,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:58:19,384 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 205 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:19,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1361 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-10-12 19:58:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1033. [2024-10-12 19:58:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 778 states have (on average 1.3856041131105399) internal successors, (1078), 783 states have internal predecessors, (1078), 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) [2024-10-12 19:58:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1422 transitions. [2024-10-12 19:58:19,465 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1422 transitions. Word has length 78 [2024-10-12 19:58:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:19,466 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1422 transitions. [2024-10-12 19:58:19,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-12 19:58:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1422 transitions. [2024-10-12 19:58:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:58:19,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:19,468 INFO L215 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] [2024-10-12 19:58:19,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:58:19,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:19,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash -767138360, now seen corresponding path program 1 times [2024-10-12 19:58:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:19,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046643258] [2024-10-12 19:58:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:58:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046643258] [2024-10-12 19:58:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046643258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:58:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555775357] [2024-10-12 19:58:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:58:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:58:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:19,733 INFO L87 Difference]: Start difference. First operand 1033 states and 1422 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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) [2024-10-12 19:58:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:19,943 INFO L93 Difference]: Finished difference Result 1441 states and 2082 transitions. [2024-10-12 19:58:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:19,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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 81 [2024-10-12 19:58:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:19,951 INFO L225 Difference]: With dead ends: 1441 [2024-10-12 19:58:19,952 INFO L226 Difference]: Without dead ends: 1439 [2024-10-12 19:58:19,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:58:19,953 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 127 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:19,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 2742 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-12 19:58:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1041. [2024-10-12 19:58:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 782 states have (on average 1.3836317135549872) internal successors, (1082), 789 states have internal predecessors, (1082), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-12 19:58:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2024-10-12 19:58:20,031 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1430 transitions. Word has length 81 [2024-10-12 19:58:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:20,032 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2024-10-12 19:58:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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) [2024-10-12 19:58:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1430 transitions. [2024-10-12 19:58:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:58:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:20,033 INFO L215 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] [2024-10-12 19:58:20,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:58:20,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -56029754, now seen corresponding path program 1 times [2024-10-12 19:58:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357547845] [2024-10-12 19:58:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:58:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:20,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357547845] [2024-10-12 19:58:20,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357547845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:20,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105122415] [2024-10-12 19:58:20,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:20,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:20,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:20,177 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-10-12 19:58:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:20,274 INFO L93 Difference]: Finished difference Result 1949 states and 2694 transitions. [2024-10-12 19:58:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 82 [2024-10-12 19:58:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:20,281 INFO L225 Difference]: With dead ends: 1949 [2024-10-12 19:58:20,281 INFO L226 Difference]: Without dead ends: 1065 [2024-10-12 19:58:20,283 INFO L431 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 [2024-10-12 19:58:20,284 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 715 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 [2024-10-12 19:58:20,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 715 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-10-12 19:58:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2024-10-12 19:58:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 800 states have (on average 1.375) internal successors, (1100), 807 states have internal predecessors, (1100), 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) [2024-10-12 19:58:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1448 transitions. [2024-10-12 19:58:20,380 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1448 transitions. Word has length 82 [2024-10-12 19:58:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:20,381 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1448 transitions. [2024-10-12 19:58:20,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-10-12 19:58:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1448 transitions. [2024-10-12 19:58:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:58:20,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:20,382 INFO L215 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] [2024-10-12 19:58:20,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:58:20,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:20,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1106345292, now seen corresponding path program 1 times [2024-10-12 19:58:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832725842] [2024-10-12 19:58:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:20,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:58:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832725842] [2024-10-12 19:58:20,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832725842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:20,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:20,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:20,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664457632] [2024-10-12 19:58:20,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:20,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:20,543 INFO L87 Difference]: Start difference. First operand 1065 states and 1448 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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) [2024-10-12 19:58:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:20,759 INFO L93 Difference]: Finished difference Result 1919 states and 2611 transitions. [2024-10-12 19:58:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:20,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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 84 [2024-10-12 19:58:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:20,767 INFO L225 Difference]: With dead ends: 1919 [2024-10-12 19:58:20,767 INFO L226 Difference]: Without dead ends: 1093 [2024-10-12 19:58:20,769 INFO L431 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 [2024-10-12 19:58:20,770 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 239 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:20,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1403 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-10-12 19:58:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1059. [2024-10-12 19:58:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 805 states have (on average 1.368944099378882) internal successors, (1102), 817 states have internal predecessors, (1102), 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) [2024-10-12 19:58:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1426 transitions. [2024-10-12 19:58:20,843 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1426 transitions. Word has length 84 [2024-10-12 19:58:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:20,843 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1426 transitions. [2024-10-12 19:58:20,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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) [2024-10-12 19:58:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1426 transitions. [2024-10-12 19:58:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:58:20,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:20,845 INFO L215 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] [2024-10-12 19:58:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:58:20,846 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 263672170, now seen corresponding path program 1 times [2024-10-12 19:58:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177108992] [2024-10-12 19:58:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:58:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:58:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177108992] [2024-10-12 19:58:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177108992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773533015] [2024-10-12 19:58:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:21,366 INFO L87 Difference]: Start difference. First operand 1059 states and 1426 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, (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) [2024-10-12 19:58:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:21,636 INFO L93 Difference]: Finished difference Result 1895 states and 2559 transitions. [2024-10-12 19:58:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:21,636 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, (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 86 [2024-10-12 19:58:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:21,643 INFO L225 Difference]: With dead ends: 1895 [2024-10-12 19:58:21,643 INFO L226 Difference]: Without dead ends: 1055 [2024-10-12 19:58:21,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:58:21,647 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 146 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:21,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1495 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-10-12 19:58:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 951. [2024-10-12 19:58:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 724 states have (on average 1.37292817679558) internal successors, (994), 734 states have internal predecessors, (994), 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) [2024-10-12 19:58:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1284 transitions. [2024-10-12 19:58:21,733 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1284 transitions. Word has length 86 [2024-10-12 19:58:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:21,734 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1284 transitions. [2024-10-12 19:58:21,734 INFO L472 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, (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) [2024-10-12 19:58:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1284 transitions. [2024-10-12 19:58:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:58:21,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:21,736 INFO L215 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] [2024-10-12 19:58:21,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:58:21,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 966578310, now seen corresponding path program 1 times [2024-10-12 19:58:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510999684] [2024-10-12 19:58:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:58:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:58:22,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:22,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510999684] [2024-10-12 19:58:22,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510999684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:22,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:22,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:58:22,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067930940] [2024-10-12 19:58:22,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:22,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:58:22,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:22,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:58:22,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:22,272 INFO L87 Difference]: Start difference. First operand 951 states and 1284 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 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) [2024-10-12 19:58:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:22,806 INFO L93 Difference]: Finished difference Result 1842 states and 2478 transitions. [2024-10-12 19:58:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:22,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 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 87 [2024-10-12 19:58:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:22,815 INFO L225 Difference]: With dead ends: 1842 [2024-10-12 19:58:22,816 INFO L226 Difference]: Without dead ends: 1039 [2024-10-12 19:58:22,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:58:22,818 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 418 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:22,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1544 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-12 19:58:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 989. [2024-10-12 19:58:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 747 states have (on average 1.3493975903614457) internal successors, (1008), 758 states have internal predecessors, (1008), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2024-10-12 19:58:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1316 transitions. [2024-10-12 19:58:22,903 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1316 transitions. Word has length 87 [2024-10-12 19:58:22,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:22,904 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1316 transitions. [2024-10-12 19:58:22,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 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) [2024-10-12 19:58:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1316 transitions. [2024-10-12 19:58:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:58:22,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:22,905 INFO L215 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] [2024-10-12 19:58:22,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:58:22,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:22,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash -884367233, now seen corresponding path program 1 times [2024-10-12 19:58:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:22,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301606949] [2024-10-12 19:58:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:58:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:58:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:58:23,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:23,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301606949] [2024-10-12 19:58:23,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301606949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:23,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:23,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:58:23,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103364125] [2024-10-12 19:58:23,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:23,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:58:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:23,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:58:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:23,417 INFO L87 Difference]: Start difference. First operand 989 states and 1316 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) [2024-10-12 19:58:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:23,958 INFO L93 Difference]: Finished difference Result 1927 states and 2544 transitions. [2024-10-12 19:58:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:23,959 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 [2024-10-12 19:58:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:23,966 INFO L225 Difference]: With dead ends: 1927 [2024-10-12 19:58:23,967 INFO L226 Difference]: Without dead ends: 1099 [2024-10-12 19:58:23,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:58:23,970 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 514 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:23,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1325 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-10-12 19:58:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1011. [2024-10-12 19:58:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 761 states have (on average 1.3324572930354797) internal successors, (1014), 773 states have internal predecessors, (1014), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-12 19:58:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1328 transitions. [2024-10-12 19:58:24,067 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1328 transitions. Word has length 89 [2024-10-12 19:58:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:24,067 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1328 transitions. [2024-10-12 19:58:24,067 INFO L472 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) [2024-10-12 19:58:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1328 transitions. [2024-10-12 19:58:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 19:58:24,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,069 INFO L215 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] [2024-10-12 19:58:24,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:58:24,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2062173028, now seen corresponding path program 1 times [2024-10-12 19:58:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356516255] [2024-10-12 19:58:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:24,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356516255] [2024-10-12 19:58:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356516255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743279645] [2024-10-12 19:58:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:24,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:24,176 INFO L87 Difference]: Start difference. First operand 1011 states and 1328 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) [2024-10-12 19:58:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:24,419 INFO L93 Difference]: Finished difference Result 2659 states and 3514 transitions. [2024-10-12 19:58:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:24,419 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 [2024-10-12 19:58:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:24,429 INFO L225 Difference]: With dead ends: 2659 [2024-10-12 19:58:24,429 INFO L226 Difference]: Without dead ends: 1887 [2024-10-12 19:58:24,432 INFO L431 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 [2024-10-12 19:58:24,432 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 194 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1079 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 [2024-10-12 19:58:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1079 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-10-12 19:58:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1716. [2024-10-12 19:58:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1278 states have (on average 1.3309859154929577) internal successors, (1701), 1298 states have internal predecessors, (1701), 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) [2024-10-12 19:58:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2261 transitions. [2024-10-12 19:58:24,599 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2261 transitions. Word has length 90 [2024-10-12 19:58:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:24,600 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2261 transitions. [2024-10-12 19:58:24,600 INFO L472 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) [2024-10-12 19:58:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2261 transitions. [2024-10-12 19:58:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:58:24,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,602 INFO L215 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] [2024-10-12 19:58:24,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:58:24,603 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1157902383, now seen corresponding path program 1 times [2024-10-12 19:58:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559399550] [2024-10-12 19:58:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:24,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:24,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559399550] [2024-10-12 19:58:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559399550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:24,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:24,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:24,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983346565] [2024-10-12 19:58:24,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:24,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:24,723 INFO L87 Difference]: Start difference. First operand 1716 states and 2261 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-12 19:58:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:25,176 INFO L93 Difference]: Finished difference Result 4378 states and 5797 transitions. [2024-10-12 19:58:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2024-10-12 19:58:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:25,191 INFO L225 Difference]: With dead ends: 4378 [2024-10-12 19:58:25,192 INFO L226 Difference]: Without dead ends: 2968 [2024-10-12 19:58:25,197 INFO L431 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 [2024-10-12 19:58:25,197 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 201 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:25,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1115 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2024-10-12 19:58:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2717. [2024-10-12 19:58:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2004 states have (on average 1.318363273453094) internal successors, (2642), 2035 states have internal predecessors, (2642), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-12 19:58:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3562 transitions. [2024-10-12 19:58:25,449 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3562 transitions. Word has length 92 [2024-10-12 19:58:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:25,450 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 3562 transitions. [2024-10-12 19:58:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-12 19:58:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3562 transitions. [2024-10-12 19:58:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:58:25,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:25,459 INFO L215 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] [2024-10-12 19:58:25,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:58:25,459 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1853622775, now seen corresponding path program 1 times [2024-10-12 19:58:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438734007] [2024-10-12 19:58:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:58:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438734007] [2024-10-12 19:58:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438734007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:25,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:25,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561701680] [2024-10-12 19:58:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:25,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:25,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:25,597 INFO L87 Difference]: Start difference. First operand 2717 states and 3562 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-12 19:58:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,006 INFO L93 Difference]: Finished difference Result 6377 states and 8393 transitions. [2024-10-12 19:58:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2024-10-12 19:58:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,027 INFO L225 Difference]: With dead ends: 6377 [2024-10-12 19:58:26,028 INFO L226 Difference]: Without dead ends: 4078 [2024-10-12 19:58:26,033 INFO L431 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 [2024-10-12 19:58:26,034 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 195 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1131 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2024-10-12 19:58:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3905. [2024-10-12 19:58:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 2868 states have (on average 1.3138075313807531) internal successors, (3768), 2912 states have internal predecessors, (3768), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-12 19:58:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 5112 transitions. [2024-10-12 19:58:26,383 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 5112 transitions. Word has length 92 [2024-10-12 19:58:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:26,383 INFO L471 AbstractCegarLoop]: Abstraction has 3905 states and 5112 transitions. [2024-10-12 19:58:26,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-12 19:58:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 5112 transitions. [2024-10-12 19:58:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 19:58:26,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:26,386 INFO L215 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] [2024-10-12 19:58:26,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:58:26,386 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 117513798, now seen corresponding path program 1 times [2024-10-12 19:58:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274337172] [2024-10-12 19:58:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:58:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:58:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:58:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:26,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274337172] [2024-10-12 19:58:26,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274337172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:26,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208194736] [2024-10-12 19:58:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:26,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:26,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:26,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:26,451 INFO L87 Difference]: Start difference. First operand 3905 states and 5112 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 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) [2024-10-12 19:58:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,794 INFO L93 Difference]: Finished difference Result 7523 states and 9889 transitions. [2024-10-12 19:58:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 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 93 [2024-10-12 19:58:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,819 INFO L225 Difference]: With dead ends: 7523 [2024-10-12 19:58:26,823 INFO L226 Difference]: Without dead ends: 3938 [2024-10-12 19:58:26,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:26,834 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 462 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-10-12 19:58:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3911. [2024-10-12 19:58:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 2874 states have (on average 1.313152400835073) internal successors, (3774), 2918 states have internal predecessors, (3774), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-12 19:58:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 5118 transitions. [2024-10-12 19:58:27,281 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 5118 transitions. Word has length 93 [2024-10-12 19:58:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:27,282 INFO L471 AbstractCegarLoop]: Abstraction has 3911 states and 5118 transitions. [2024-10-12 19:58:27,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 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) [2024-10-12 19:58:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 5118 transitions. [2024-10-12 19:58:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:58:27,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:27,286 INFO L215 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] [2024-10-12 19:58:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 19:58:27,287 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:27,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash 923535218, now seen corresponding path program 1 times [2024-10-12 19:58:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356643455] [2024-10-12 19:58:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:27,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:58:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356643455] [2024-10-12 19:58:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356643455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902303003] [2024-10-12 19:58:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:27,476 INFO L87 Difference]: Start difference. First operand 3911 states and 5118 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 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) [2024-10-12 19:58:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:27,857 INFO L93 Difference]: Finished difference Result 7489 states and 9817 transitions. [2024-10-12 19:58:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:27,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 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 94 [2024-10-12 19:58:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:27,891 INFO L225 Difference]: With dead ends: 7489 [2024-10-12 19:58:27,891 INFO L226 Difference]: Without dead ends: 3640 [2024-10-12 19:58:27,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:27,904 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 74 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:27,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 698 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2024-10-12 19:58:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3577. [2024-10-12 19:58:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 2623 states have (on average 1.321768966831872) internal successors, (3467), 2657 states have internal predecessors, (3467), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-12 19:58:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4707 transitions. [2024-10-12 19:58:28,259 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4707 transitions. Word has length 94 [2024-10-12 19:58:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:28,260 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 4707 transitions. [2024-10-12 19:58:28,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 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) [2024-10-12 19:58:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4707 transitions. [2024-10-12 19:58:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:58:28,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:28,261 INFO L215 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, 1] [2024-10-12 19:58:28,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 19:58:28,262 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1269679630, now seen corresponding path program 1 times [2024-10-12 19:58:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68069969] [2024-10-12 19:58:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:58:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:58:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:58:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68069969] [2024-10-12 19:58:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68069969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:28,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029364886] [2024-10-12 19:58:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:28,331 INFO L87 Difference]: Start difference. First operand 3577 states and 4707 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 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) [2024-10-12 19:58:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:28,627 INFO L93 Difference]: Finished difference Result 7042 states and 9302 transitions. [2024-10-12 19:58:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 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 95 [2024-10-12 19:58:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:28,649 INFO L225 Difference]: With dead ends: 7042 [2024-10-12 19:58:28,649 INFO L226 Difference]: Without dead ends: 3628 [2024-10-12 19:58:28,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:28,660 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 6 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:28,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2024-10-12 19:58:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3587. [2024-10-12 19:58:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2633 states have (on average 1.3205469046714775) internal successors, (3477), 2667 states have internal predecessors, (3477), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-12 19:58:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4717 transitions. [2024-10-12 19:58:28,966 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4717 transitions. Word has length 95 [2024-10-12 19:58:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:28,967 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 4717 transitions. [2024-10-12 19:58:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 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) [2024-10-12 19:58:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4717 transitions. [2024-10-12 19:58:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:58:28,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:28,969 INFO L215 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, 1] [2024-10-12 19:58:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 19:58:28,969 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1910272599, now seen corresponding path program 1 times [2024-10-12 19:58:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:28,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440799379] [2024-10-12 19:58:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:58:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:58:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:58:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:29,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:29,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440799379] [2024-10-12 19:58:29,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440799379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:29,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291981556] [2024-10-12 19:58:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:29,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:29,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:29,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:29,099 INFO L87 Difference]: Start difference. First operand 3587 states and 4717 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 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) [2024-10-12 19:58:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:29,358 INFO L93 Difference]: Finished difference Result 6992 states and 9212 transitions. [2024-10-12 19:58:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 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 95 [2024-10-12 19:58:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:29,376 INFO L225 Difference]: With dead ends: 6992 [2024-10-12 19:58:29,376 INFO L226 Difference]: Without dead ends: 3510 [2024-10-12 19:58:29,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:29,387 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 56 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:29,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 703 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2024-10-12 19:58:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 2699. [2024-10-12 19:58:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1979 states have (on average 1.3127842344618494) internal successors, (2598), 1998 states have internal predecessors, (2598), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-12 19:58:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3536 transitions. [2024-10-12 19:58:29,678 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3536 transitions. Word has length 95 [2024-10-12 19:58:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 3536 transitions. [2024-10-12 19:58:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 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) [2024-10-12 19:58:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3536 transitions. [2024-10-12 19:58:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-12 19:58:29,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:29,683 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:58:29,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 19:58:29,684 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1619272197, now seen corresponding path program 1 times [2024-10-12 19:58:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695118875] [2024-10-12 19:58:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:29,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:58:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:58:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:58:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:58:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:58:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:58:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:58:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695118875] [2024-10-12 19:58:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695118875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938957449] [2024-10-12 19:58:30,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:30,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:30,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:30,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:30,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:58:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 19:58:30,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:30,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938957449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:30,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-12 19:58:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068455388] [2024-10-12 19:58:30,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 19:58:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 19:58:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:58:30,918 INFO L87 Difference]: Start difference. First operand 2699 states and 3536 transitions. Second operand has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 20 states have internal predecessors, (218), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:58:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:35,532 INFO L93 Difference]: Finished difference Result 11267 states and 14692 transitions. [2024-10-12 19:58:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-12 19:58:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 20 states have internal predecessors, (218), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 139 [2024-10-12 19:58:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:35,570 INFO L225 Difference]: With dead ends: 11267 [2024-10-12 19:58:35,570 INFO L226 Difference]: Without dead ends: 8771 [2024-10-12 19:58:35,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-12 19:58:35,581 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 4930 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 1939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4930 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:35,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4930 Valid, 3471 Invalid, 3477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:58:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8771 states. [2024-10-12 19:58:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8771 to 7295. [2024-10-12 19:58:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7295 states, 5338 states have (on average 1.301611090295991) internal successors, (6948), 5390 states have internal predecessors, (6948), 1259 states have call successors, (1259), 697 states have call predecessors, (1259), 697 states have return successors, (1259), 1207 states have call predecessors, (1259), 1259 states have call successors, (1259) [2024-10-12 19:58:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 9466 transitions. [2024-10-12 19:58:36,315 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 9466 transitions. Word has length 139 [2024-10-12 19:58:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:36,316 INFO L471 AbstractCegarLoop]: Abstraction has 7295 states and 9466 transitions. [2024-10-12 19:58:36,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 20 states have internal predecessors, (218), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:58:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 9466 transitions. [2024-10-12 19:58:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 19:58:36,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:36,328 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:58:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:58:36,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-12 19:58:36,529 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -912342447, now seen corresponding path program 1 times [2024-10-12 19:58:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124391498] [2024-10-12 19:58:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:58:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:58:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:58:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:58:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 19:58:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 19:58:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 19:58:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:36,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124391498] [2024-10-12 19:58:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124391498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84873215] [2024-10-12 19:58:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:36,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:36,736 INFO L87 Difference]: Start difference. First operand 7295 states and 9466 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:58:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:38,188 INFO L93 Difference]: Finished difference Result 21189 states and 27598 transitions. [2024-10-12 19:58:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:38,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 142 [2024-10-12 19:58:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:38,260 INFO L225 Difference]: With dead ends: 21189 [2024-10-12 19:58:38,261 INFO L226 Difference]: Without dead ends: 14358 [2024-10-12 19:58:38,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:58:38,284 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 216 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:38,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2043 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14358 states. [2024-10-12 19:58:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14358 to 12126. [2024-10-12 19:58:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12126 states, 8805 states have (on average 1.3018739352640545) internal successors, (11463), 8895 states have internal predecessors, (11463), 2161 states have call successors, (2161), 1159 states have call predecessors, (2161), 1159 states have return successors, (2161), 2071 states have call predecessors, (2161), 2161 states have call successors, (2161) [2024-10-12 19:58:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12126 states to 12126 states and 15785 transitions. [2024-10-12 19:58:39,650 INFO L78 Accepts]: Start accepts. Automaton has 12126 states and 15785 transitions. Word has length 142 [2024-10-12 19:58:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:39,651 INFO L471 AbstractCegarLoop]: Abstraction has 12126 states and 15785 transitions. [2024-10-12 19:58:39,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:58:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 12126 states and 15785 transitions. [2024-10-12 19:58:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 19:58:39,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:39,682 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:58:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 19:58:39,682 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:39,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -576582895, now seen corresponding path program 1 times [2024-10-12 19:58:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868831033] [2024-10-12 19:58:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:58:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:58:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:58:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:58:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:58:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:58:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 19:58:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 19:58:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868831033] [2024-10-12 19:58:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868831033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755781451] [2024-10-12 19:58:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:40,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:40,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:40,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:58:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 19:58:40,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:40,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 19:58:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755781451] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:41,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:58:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-12 19:58:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767457349] [2024-10-12 19:58:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:41,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:58:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:58:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-10-12 19:58:41,249 INFO L87 Difference]: Start difference. First operand 12126 states and 15785 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:58:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:42,522 INFO L93 Difference]: Finished difference Result 23854 states and 31074 transitions. [2024-10-12 19:58:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:58:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 142 [2024-10-12 19:58:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:42,584 INFO L225 Difference]: With dead ends: 23854 [2024-10-12 19:58:42,585 INFO L226 Difference]: Without dead ends: 12192 [2024-10-12 19:58:42,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:58:42,618 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 482 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:42,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1406 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12192 states. [2024-10-12 19:58:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12192 to 8240. [2024-10-12 19:58:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 6013 states have (on average 1.3056710460668552) internal successors, (7851), 6068 states have internal predecessors, (7851), 1444 states have call successors, (1444), 782 states have call predecessors, (1444), 782 states have return successors, (1444), 1389 states have call predecessors, (1444), 1444 states have call successors, (1444) [2024-10-12 19:58:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 10739 transitions. [2024-10-12 19:58:43,602 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 10739 transitions. Word has length 142 [2024-10-12 19:58:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 8240 states and 10739 transitions. [2024-10-12 19:58:43,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:58:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 10739 transitions. [2024-10-12 19:58:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 19:58:43,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:43,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:58:43,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:58:43,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-12 19:58:43,823 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:43,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1201162170, now seen corresponding path program 1 times [2024-10-12 19:58:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:43,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384654380] [2024-10-12 19:58:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:58:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:58:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:58:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:58:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:58:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:58:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 19:58:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 19:58:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384654380] [2024-10-12 19:58:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384654380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437660265] [2024-10-12 19:58:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:44,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:44,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:44,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:44,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:58:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:44,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 19:58:44,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:45,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437660265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:45,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2024-10-12 19:58:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193950875] [2024-10-12 19:58:45,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:45,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-12 19:58:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 19:58:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-12 19:58:45,391 INFO L87 Difference]: Start difference. First operand 8240 states and 10739 transitions. Second operand has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 20 states have internal predecessors, (236), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-12 19:58:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:48,921 INFO L93 Difference]: Finished difference Result 22119 states and 28777 transitions. [2024-10-12 19:58:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-12 19:58:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 20 states have internal predecessors, (236), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) Word has length 143 [2024-10-12 19:58:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:48,992 INFO L225 Difference]: With dead ends: 22119 [2024-10-12 19:58:48,993 INFO L226 Difference]: Without dead ends: 14041 [2024-10-12 19:58:49,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2024-10-12 19:58:49,016 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1252 mSDsluCounter, 5650 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 6176 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:49,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 6176 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:58:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14041 states. [2024-10-12 19:58:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14041 to 7583. [2024-10-12 19:58:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 5546 states have (on average 1.2958889289578075) internal successors, (7187), 5598 states have internal predecessors, (7187), 1319 states have call successors, (1319), 717 states have call predecessors, (1319), 717 states have return successors, (1319), 1267 states have call predecessors, (1319), 1319 states have call successors, (1319) [2024-10-12 19:58:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 9825 transitions. [2024-10-12 19:58:50,388 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 9825 transitions. Word has length 143 [2024-10-12 19:58:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 7583 states and 9825 transitions. [2024-10-12 19:58:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 20 states have internal predecessors, (236), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-12 19:58:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 9825 transitions. [2024-10-12 19:58:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 19:58:50,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:50,402 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:58:50,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:58:50,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:50,603 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:50,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1799095590, now seen corresponding path program 1 times [2024-10-12 19:58:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:50,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243223605] [2024-10-12 19:58:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:58:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:58:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:58:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:58:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 19:58:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 19:58:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 19:58:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:58:51,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243223605] [2024-10-12 19:58:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243223605] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44185697] [2024-10-12 19:58:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:51,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:51,471 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:51,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:58:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-12 19:58:51,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:52,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:58:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44185697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:52,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:52,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2024-10-12 19:58:52,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762246399] [2024-10-12 19:58:52,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:52,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 19:58:52,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 19:58:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2024-10-12 19:58:52,875 INFO L87 Difference]: Start difference. First operand 7583 states and 9825 transitions. Second operand has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 27 states have internal predecessors, (224), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:58:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:57,115 INFO L93 Difference]: Finished difference Result 17557 states and 22769 transitions. [2024-10-12 19:58:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-12 19:58:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 27 states have internal predecessors, (224), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 152 [2024-10-12 19:58:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:57,160 INFO L225 Difference]: With dead ends: 17557 [2024-10-12 19:58:57,160 INFO L226 Difference]: Without dead ends: 10273 [2024-10-12 19:58:57,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=4463, Unknown=0, NotChecked=0, Total=5256 [2024-10-12 19:58:57,181 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 1433 mSDsluCounter, 3544 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 4033 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:57,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 4033 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:58:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10273 states. [2024-10-12 19:58:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10273 to 9868. [2024-10-12 19:58:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9868 states, 7219 states have (on average 1.2940850533314863) internal successors, (9342), 7288 states have internal predecessors, (9342), 1702 states have call successors, (1702), 946 states have call predecessors, (1702), 946 states have return successors, (1702), 1633 states have call predecessors, (1702), 1702 states have call successors, (1702) [2024-10-12 19:58:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9868 states to 9868 states and 12746 transitions. [2024-10-12 19:58:58,391 INFO L78 Accepts]: Start accepts. Automaton has 9868 states and 12746 transitions. Word has length 152 [2024-10-12 19:58:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 9868 states and 12746 transitions. [2024-10-12 19:58:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 27 states have internal predecessors, (224), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:58:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 9868 states and 12746 transitions. [2024-10-12 19:58:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 19:58:58,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:58,403 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:58:58,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 19:58:58,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:58,604 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:58,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:58,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1892160728, now seen corresponding path program 1 times [2024-10-12 19:58:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:58,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178126351] [2024-10-12 19:58:58,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:58:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:58:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:58:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:58:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 19:58:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:58:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 19:58:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:58:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178126351] [2024-10-12 19:58:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178126351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780189758] [2024-10-12 19:58:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:59,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:59,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:59,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:59,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:58:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-12 19:58:59,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:59:00,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:59:00,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780189758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:00,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:00,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2024-10-12 19:59:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145559698] [2024-10-12 19:59:00,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:00,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 19:59:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:00,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 19:59:00,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-10-12 19:59:00,919 INFO L87 Difference]: Start difference. First operand 9868 states and 12746 transitions. Second operand has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 27 states have internal predecessors, (227), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:59:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:04,992 INFO L93 Difference]: Finished difference Result 19685 states and 25523 transitions. [2024-10-12 19:59:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-12 19:59:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 27 states have internal predecessors, (227), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 153 [2024-10-12 19:59:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:05,047 INFO L225 Difference]: With dead ends: 19685 [2024-10-12 19:59:05,047 INFO L226 Difference]: Without dead ends: 10263 [2024-10-12 19:59:05,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=484, Invalid=3056, Unknown=0, NotChecked=0, Total=3540 [2024-10-12 19:59:05,066 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 1273 mSDsluCounter, 5131 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 5592 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:05,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 5592 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:59:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2024-10-12 19:59:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 10008. [2024-10-12 19:59:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 7347 states have (on average 1.294678099904723) internal successors, (9512), 7416 states have internal predecessors, (9512), 1708 states have call successors, (1708), 952 states have call predecessors, (1708), 952 states have return successors, (1708), 1639 states have call predecessors, (1708), 1708 states have call successors, (1708) [2024-10-12 19:59:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 12928 transitions. [2024-10-12 19:59:06,455 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 12928 transitions. Word has length 153 [2024-10-12 19:59:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 10008 states and 12928 transitions. [2024-10-12 19:59:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 27 states have internal predecessors, (227), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:59:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 12928 transitions. [2024-10-12 19:59:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 19:59:06,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:06,467 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 19:59:06,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:59:06,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:06,668 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1077055979, now seen corresponding path program 1 times [2024-10-12 19:59:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554101383] [2024-10-12 19:59:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:59:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:59:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:59:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:59:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:59:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:59:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:59:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:59:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:59:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:59:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:59:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 19:59:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:59:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 19:59:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 19:59:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 19:59:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:06,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554101383] [2024-10-12 19:59:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554101383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:59:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869017169] [2024-10-12 19:59:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:06,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:06,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:59:06,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:59:06,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 19:59:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:07,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 19:59:07,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-12 19:59:07,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 19:59:07,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869017169] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:07,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:07,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-12 19:59:07,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251082022] [2024-10-12 19:59:07,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:59:07,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:59:07,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:59:07,260 INFO L87 Difference]: Start difference. First operand 10008 states and 12928 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-12 19:59:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:08,565 INFO L93 Difference]: Finished difference Result 19987 states and 25801 transitions. [2024-10-12 19:59:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:59:08,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 154 [2024-10-12 19:59:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:08,618 INFO L225 Difference]: With dead ends: 19987 [2024-10-12 19:59:08,618 INFO L226 Difference]: Without dead ends: 10200 [2024-10-12 19:59:08,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:59:08,642 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 75 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:08,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1401 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10200 states. [2024-10-12 19:59:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10200 to 10008. [2024-10-12 19:59:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 7347 states have (on average 1.2939975500204164) internal successors, (9507), 7416 states have internal predecessors, (9507), 1708 states have call successors, (1708), 952 states have call predecessors, (1708), 952 states have return successors, (1708), 1639 states have call predecessors, (1708), 1708 states have call successors, (1708) [2024-10-12 19:59:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 12923 transitions. [2024-10-12 19:59:10,073 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 12923 transitions. Word has length 154 [2024-10-12 19:59:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:10,074 INFO L471 AbstractCegarLoop]: Abstraction has 10008 states and 12923 transitions. [2024-10-12 19:59:10,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-12 19:59:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 12923 transitions. [2024-10-12 19:59:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 19:59:10,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:10,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-10-12 19:59:10,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 19:59:10,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:10,282 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:10,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash 948328635, now seen corresponding path program 1 times [2024-10-12 19:59:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922354768] [2024-10-12 19:59:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:59:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:59:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:59:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:59:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:59:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:59:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:59:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:59:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:59:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:59:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:59:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 19:59:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:59:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 19:59:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 19:59:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-12 19:59:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 19:59:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922354768] [2024-10-12 19:59:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922354768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:59:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020590039] [2024-10-12 19:59:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:10,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:59:10,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:59:10,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 19:59:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:11,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 19:59:11,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:59:11,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 19:59:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020590039] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:11,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:11,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2024-10-12 19:59:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777277992] [2024-10-12 19:59:11,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 19:59:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 19:59:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:59:11,547 INFO L87 Difference]: Start difference. First operand 10008 states and 12923 transitions. Second operand has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 18 states have internal predecessors, (165), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-12 19:59:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:14,993 INFO L93 Difference]: Finished difference Result 27001 states and 35827 transitions. [2024-10-12 19:59:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-12 19:59:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 18 states have internal predecessors, (165), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) Word has length 162 [2024-10-12 19:59:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:15,064 INFO L225 Difference]: With dead ends: 27001 [2024-10-12 19:59:15,065 INFO L226 Difference]: Without dead ends: 17015 [2024-10-12 19:59:15,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=410, Invalid=2560, Unknown=0, NotChecked=0, Total=2970 [2024-10-12 19:59:15,087 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1006 mSDsluCounter, 4378 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 4796 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:15,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 4796 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:59:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17015 states. [2024-10-12 19:59:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17015 to 11614. [2024-10-12 19:59:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11614 states, 8498 states have (on average 1.287361732172276) internal successors, (10940), 8584 states have internal predecessors, (10940), 2000 states have call successors, (2000), 1115 states have call predecessors, (2000), 1115 states have return successors, (2000), 1914 states have call predecessors, (2000), 2000 states have call successors, (2000) [2024-10-12 19:59:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11614 states to 11614 states and 14940 transitions. [2024-10-12 19:59:16,917 INFO L78 Accepts]: Start accepts. Automaton has 11614 states and 14940 transitions. Word has length 162 [2024-10-12 19:59:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:16,917 INFO L471 AbstractCegarLoop]: Abstraction has 11614 states and 14940 transitions. [2024-10-12 19:59:16,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 18 states have internal predecessors, (165), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-12 19:59:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 11614 states and 14940 transitions. [2024-10-12 19:59:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 19:59:16,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:16,924 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:16,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 19:59:17,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:17,125 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:17,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash -203491659, now seen corresponding path program 1 times [2024-10-12 19:59:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:17,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114558000] [2024-10-12 19:59:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:59:17,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:59:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:59:17,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:59:17,398 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:59:17,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:59:17,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 19:59:17,404 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:17,545 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:59:17,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:59:17 BoogieIcfgContainer [2024-10-12 19:59:17,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:59:17,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:59:17,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:59:17,548 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:59:17,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:13" (3/4) ... [2024-10-12 19:59:17,549 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:59:17,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:59:17,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:59:17,716 INFO L158 Benchmark]: Toolchain (without parser) took 65654.49ms. Allocated memory was 163.6MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 107.9MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 582.3MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,716 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:59:17,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.55ms. Allocated memory is still 163.6MB. Free memory was 107.5MB in the beginning and 87.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.96ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 83.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,717 INFO L158 Benchmark]: Boogie Preprocessor took 92.99ms. Allocated memory is still 163.6MB. Free memory was 83.1MB in the beginning and 78.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,717 INFO L158 Benchmark]: RCFGBuilder took 1003.84ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 78.5MB in the beginning and 144.5MB in the end (delta: -65.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,717 INFO L158 Benchmark]: TraceAbstraction took 63834.20ms. Allocated memory was 216.0MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 143.4MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 531.1MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,717 INFO L158 Benchmark]: Witness Printer took 167.37ms. Allocated memory is still 3.3GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-12 19:59:17,718 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.20ms. Allocated memory is still 163.6MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.55ms. Allocated memory is still 163.6MB. Free memory was 107.5MB in the beginning and 87.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.96ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 83.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.99ms. Allocated memory is still 163.6MB. Free memory was 83.1MB in the beginning and 78.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.84ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 78.5MB in the beginning and 144.5MB in the end (delta: -65.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 63834.20ms. Allocated memory was 216.0MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 143.4MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 531.1MB. Max. memory is 16.1GB. * Witness Printer took 167.37ms. Allocated memory is still 3.3GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * 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: 611]: 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 ; [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=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, 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L556] RET assume_abort_if_not(i2) 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, 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 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, 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L574] COND TRUE i2 < 10 [L576] 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 [L576] RET Console_task_each_pals_period() [L577] 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 TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=1, side1Failed_History_0=1, 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=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=1, side1Failed_History_0=1, 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 )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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=1, side1Failed_History_0=1, 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=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L400] COND FALSE !((int )side1 == 0) [L407] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L442] COND TRUE ! side2Failed [L443] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L447] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L58] COND FALSE !(!cond) 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L447] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L448] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L448] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L450] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L450] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L452] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L452] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L478] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L478] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L494] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L494] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L496] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L496] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=1, manual_selection_History_0=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L574] COND TRUE i2 < 10 [L576] 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 [L576] RET Console_task_each_pals_period() [L577] 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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 TRUE \read(side2Failed) [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=-128, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.6s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14367 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14278 mSDsluCounter, 53205 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42904 mSDsCounter, 3904 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11897 IncrementalHoareTripleChecker+Invalid, 15801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3904 mSolverCounterUnsat, 10301 mSDtfsCounter, 11897 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3154 GetRequests, 2678 SyntacticMatches, 0 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5869 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12126occurred in iteration=28, InterpolantAutomatonStates: 390, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 22989 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 4234 NumberOfCodeBlocks, 4234 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5062 ConstructedInterpolants, 0 QuantifiedInterpolants, 13798 SizeOfPredicates, 37 NumberOfNonLiveVariables, 4689 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 48 InterpolantComputations, 28 PerfectInterpolantSequences, 1806/2058 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! [2024-10-12 19:59:17,758 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE