./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.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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.1.ufo.UNBOUNDED.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 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:18:24,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:18:24,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:18:24,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:18:24,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:18:24,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:18:24,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:18:24,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:18:24,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:18:24,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:18:24,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:18:24,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:18:24,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:18:24,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:18:24,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:18:24,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:18:24,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:18:25,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:18:25,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:18:25,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:18:25,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:18:25,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:18:25,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:18:25,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:18:25,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:18:25,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:18:25,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:18:25,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:18:25,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:18:25,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:18:25,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:18:25,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:18:25,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:25,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:18:25,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:18:25,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:18:25,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:18:25,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:18:25,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:18:25,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:18:25,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:18:25,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:18:25,009 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 -> 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 [2024-10-24 01:18:25,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:18:25,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:18:25,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:18:25,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:18:25,395 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:18:25,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:18:26,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:18:27,101 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:18:27,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:18:27,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9722672/ce0c0d5d0a6642f2a87bf92c37ae9343/FLAG45c580744 [2024-10-24 01:18:27,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9722672/ce0c0d5d0a6642f2a87bf92c37ae9343 [2024-10-24 01:18:27,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:18:27,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:18:27,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:27,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:18:27,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:18:27,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ddaa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27, skipping insertion in model container [2024-10-24 01:18:27,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:18:27,525 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.1.ufo.UNBOUNDED.pals.c[14682,14695] [2024-10-24 01:18:27,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:27,547 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:18:27,601 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.1.ufo.UNBOUNDED.pals.c[14682,14695] [2024-10-24 01:18:27,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:27,632 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:18:27,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27 WrapperNode [2024-10-24 01:18:27,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:27,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:27,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:18:27,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:18:27,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,713 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2024-10-24 01:18:27,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:27,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:18:27,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:18:27,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:18:27,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,766 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-24 01:18:27,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:18:27,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:18:27,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:18:27,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:18:27,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (1/1) ... [2024-10-24 01:18:27,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:27,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:18:27,854 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-24 01:18:27,861 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-24 01:18:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-24 01:18:27,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-24 01:18:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:18:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-24 01:18:27,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-24 01:18:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 01:18:27,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 01:18:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-24 01:18:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-24 01:18:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 01:18:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 01:18:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:18:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-24 01:18:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-24 01:18:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:18:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:18:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-24 01:18:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-24 01:18:28,047 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:18:28,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:18:28,688 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-24 01:18:28,689 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:18:28,739 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:18:28,739 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:18:28,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:28 BoogieIcfgContainer [2024-10-24 01:18:28,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:18:28,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:18:28,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:18:28,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:18:28,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:18:27" (1/3) ... [2024-10-24 01:18:28,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a830a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:28, skipping insertion in model container [2024-10-24 01:18:28,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:27" (2/3) ... [2024-10-24 01:18:28,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a830a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:28, skipping insertion in model container [2024-10-24 01:18:28,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:28" (3/3) ... [2024-10-24 01:18:28,749 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:18:28,766 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:18:28,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:18:28,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:18:28,857 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;@44339c78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:18:28,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:18:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:28,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:28,873 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-24 01:18:28,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:28,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 975176766, now seen corresponding path program 1 times [2024-10-24 01:18:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722862679] [2024-10-24 01:18:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,213 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-24 01:18:29,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:29,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722862679] [2024-10-24 01:18:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722862679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:29,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:29,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:18:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467970249] [2024-10-24 01:18:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:29,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:18:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:18:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:29,248 INFO L87 Difference]: Start difference. First operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:29,315 INFO L93 Difference]: Finished difference Result 323 states and 540 transitions. [2024-10-24 01:18:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:18:29,318 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-24 01:18:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:29,326 INFO L225 Difference]: With dead ends: 323 [2024-10-24 01:18:29,326 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 01:18:29,331 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-24 01:18:29,334 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:29,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 01:18:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-24 01:18:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.573643410852713) internal successors, (203), 130 states have internal predecessors, (203), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 265 transitions. [2024-10-24 01:18:29,387 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 265 transitions. Word has length 23 [2024-10-24 01:18:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:29,387 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 265 transitions. [2024-10-24 01:18:29,387 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-24 01:18:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 265 transitions. [2024-10-24 01:18:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:29,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:29,389 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-24 01:18:29,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:18:29,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:29,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1018967940, now seen corresponding path program 1 times [2024-10-24 01:18:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719353065] [2024-10-24 01:18:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,746 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-24 01:18:29,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719353065] [2024-10-24 01:18:29,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719353065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:29,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:29,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:18:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325502440] [2024-10-24 01:18:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:29,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:18:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:29,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:18:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:29,755 INFO L87 Difference]: Start difference. First operand 168 states and 265 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:29,906 INFO L93 Difference]: Finished difference Result 323 states and 505 transitions. [2024-10-24 01:18:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:18:29,908 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-24 01:18:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:29,910 INFO L225 Difference]: With dead ends: 323 [2024-10-24 01:18:29,910 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 01:18:29,913 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-24 01:18:29,914 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:29,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1260 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 01:18:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-24 01:18:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2024-10-24 01:18:29,931 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 23 [2024-10-24 01:18:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:29,931 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2024-10-24 01:18:29,932 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-24 01:18:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2024-10-24 01:18:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:18:29,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:29,933 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-24 01:18:29,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:18:29,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 26280683, now seen corresponding path program 1 times [2024-10-24 01:18:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372803567] [2024-10-24 01:18:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,177 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-24 01:18:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372803567] [2024-10-24 01:18:30,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372803567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251710921] [2024-10-24 01:18:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:30,180 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:30,275 INFO L93 Difference]: Finished difference Result 324 states and 497 transitions. [2024-10-24 01:18:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:30,275 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-24 01:18:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:30,277 INFO L225 Difference]: With dead ends: 324 [2024-10-24 01:18:30,277 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 01:18:30,280 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-24 01:18:30,281 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:30,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 716 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 01:18:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-24 01:18:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.4696969696969697) internal successors, (194), 133 states have internal predecessors, (194), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2024-10-24 01:18:30,300 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 34 [2024-10-24 01:18:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:30,300 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2024-10-24 01:18:30,301 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-24 01:18:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2024-10-24 01:18:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:18:30,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:30,302 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-24 01:18:30,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:18:30,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1285077620, now seen corresponding path program 1 times [2024-10-24 01:18:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706191228] [2024-10-24 01:18:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:18:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,416 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-24 01:18:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706191228] [2024-10-24 01:18:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706191228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:30,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847613268] [2024-10-24 01:18:30,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:30,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:30,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:30,420 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:30,523 INFO L93 Difference]: Finished difference Result 473 states and 714 transitions. [2024-10-24 01:18:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:30,525 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-24 01:18:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:30,530 INFO L225 Difference]: With dead ends: 473 [2024-10-24 01:18:30,532 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 01:18:30,538 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-24 01:18:30,540 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:30,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 495 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 01:18:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2024-10-24 01:18:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 239 states have internal predecessors, (352), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 01:18:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2024-10-24 01:18:30,588 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 48 [2024-10-24 01:18:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:30,589 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2024-10-24 01:18:30,590 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-24 01:18:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2024-10-24 01:18:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:30,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:30,591 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-24 01:18:30,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:18:30,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash -271052700, now seen corresponding path program 1 times [2024-10-24 01:18:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220814629] [2024-10-24 01:18:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,688 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-24 01:18:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220814629] [2024-10-24 01:18:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220814629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546000429] [2024-10-24 01:18:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:30,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:30,690 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:30,765 INFO L93 Difference]: Finished difference Result 886 states and 1342 transitions. [2024-10-24 01:18:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:30,768 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-24 01:18:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:30,776 INFO L225 Difference]: With dead ends: 886 [2024-10-24 01:18:30,777 INFO L226 Difference]: Without dead ends: 588 [2024-10-24 01:18:30,778 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-24 01:18:30,780 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 210 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:30,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-24 01:18:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 582. [2024-10-24 01:18:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 437 states have internal predecessors, (647), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 881 transitions. [2024-10-24 01:18:30,836 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 881 transitions. Word has length 49 [2024-10-24 01:18:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 881 transitions. [2024-10-24 01:18:30,839 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-24 01:18:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 881 transitions. [2024-10-24 01:18:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:30,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:30,841 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-24 01:18:30,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:18:30,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:30,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1550916378, now seen corresponding path program 1 times [2024-10-24 01:18:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213990901] [2024-10-24 01:18:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,992 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-24 01:18:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213990901] [2024-10-24 01:18:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213990901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346899943] [2024-10-24 01:18:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:30,995 INFO L87 Difference]: Start difference. First operand 582 states and 881 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:31,204 INFO L93 Difference]: Finished difference Result 1237 states and 1874 transitions. [2024-10-24 01:18:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:31,205 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-24 01:18:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:31,211 INFO L225 Difference]: With dead ends: 1237 [2024-10-24 01:18:31,211 INFO L226 Difference]: Without dead ends: 671 [2024-10-24 01:18:31,214 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-24 01:18:31,217 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:31,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-24 01:18:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2024-10-24 01:18:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 501 states have (on average 1.4810379241516967) internal successors, (742), 504 states have internal predecessors, (742), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 990 transitions. [2024-10-24 01:18:31,276 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 990 transitions. Word has length 49 [2024-10-24 01:18:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:31,278 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 990 transitions. [2024-10-24 01:18:31,278 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-24 01:18:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 990 transitions. [2024-10-24 01:18:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:18:31,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:31,280 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-24 01:18:31,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:18:31,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1743107091, now seen corresponding path program 1 times [2024-10-24 01:18:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063262865] [2024-10-24 01:18:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 01:18:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,405 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-24 01:18:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063262865] [2024-10-24 01:18:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063262865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:31,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724973764] [2024-10-24 01:18:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:31,409 INFO L87 Difference]: Start difference. First operand 663 states and 990 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:31,602 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2024-10-24 01:18:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:31,603 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-24 01:18:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:31,610 INFO L225 Difference]: With dead ends: 1241 [2024-10-24 01:18:31,611 INFO L226 Difference]: Without dead ends: 675 [2024-10-24 01:18:31,613 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-24 01:18:31,614 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:31,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-24 01:18:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2024-10-24 01:18:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 512 states have internal predecessors, (750), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 998 transitions. [2024-10-24 01:18:31,667 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 998 transitions. Word has length 50 [2024-10-24 01:18:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:31,668 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 998 transitions. [2024-10-24 01:18:31,668 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-24 01:18:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 998 transitions. [2024-10-24 01:18:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:18:31,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:31,670 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] [2024-10-24 01:18:31,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:18:31,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:31,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1020972895, now seen corresponding path program 1 times [2024-10-24 01:18:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290663098] [2024-10-24 01:18:31,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 01:18:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,857 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-24 01:18:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290663098] [2024-10-24 01:18:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290663098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:31,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:31,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834222853] [2024-10-24 01:18:31,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:31,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:31,862 INFO L87 Difference]: Start difference. First operand 671 states and 998 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:32,020 INFO L93 Difference]: Finished difference Result 1237 states and 1862 transitions. [2024-10-24 01:18:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:32,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-24 01:18:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:32,029 INFO L225 Difference]: With dead ends: 1237 [2024-10-24 01:18:32,029 INFO L226 Difference]: Without dead ends: 671 [2024-10-24 01:18:32,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:32,032 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:32,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 640 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-24 01:18:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-10-24 01:18:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4656188605108056) internal successors, (746), 512 states have internal predecessors, (746), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 994 transitions. [2024-10-24 01:18:32,077 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 994 transitions. Word has length 52 [2024-10-24 01:18:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:32,078 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 994 transitions. [2024-10-24 01:18:32,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 994 transitions. [2024-10-24 01:18:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:18:32,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:32,080 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] [2024-10-24 01:18:32,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:18:32,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:32,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash 70077876, now seen corresponding path program 1 times [2024-10-24 01:18:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856824758] [2024-10-24 01:18:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,271 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-24 01:18:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856824758] [2024-10-24 01:18:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856824758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:32,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:32,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:32,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214442486] [2024-10-24 01:18:32,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:32,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:32,277 INFO L87 Difference]: Start difference. First operand 671 states and 994 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:32,357 INFO L93 Difference]: Finished difference Result 1257 states and 1886 transitions. [2024-10-24 01:18:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:32,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-24 01:18:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:32,362 INFO L225 Difference]: With dead ends: 1257 [2024-10-24 01:18:32,363 INFO L226 Difference]: Without dead ends: 691 [2024-10-24 01:18:32,365 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-24 01:18:32,365 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:32,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 728 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-24 01:18:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-10-24 01:18:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 525 states have (on average 1.4514285714285715) internal successors, (762), 528 states have internal predecessors, (762), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1010 transitions. [2024-10-24 01:18:32,410 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1010 transitions. Word has length 53 [2024-10-24 01:18:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:32,411 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1010 transitions. [2024-10-24 01:18:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1010 transitions. [2024-10-24 01:18:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 01:18:32,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:32,412 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] [2024-10-24 01:18:32,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:18:32,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:32,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2022849498, now seen corresponding path program 1 times [2024-10-24 01:18:32,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:32,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716640175] [2024-10-24 01:18:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:32,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,572 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-24 01:18:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716640175] [2024-10-24 01:18:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716640175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:32,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623395787] [2024-10-24 01:18:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:32,575 INFO L87 Difference]: Start difference. First operand 691 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:32,680 INFO L93 Difference]: Finished difference Result 1297 states and 1930 transitions. [2024-10-24 01:18:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:32,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-24 01:18:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:32,686 INFO L225 Difference]: With dead ends: 1297 [2024-10-24 01:18:32,686 INFO L226 Difference]: Without dead ends: 711 [2024-10-24 01:18:32,689 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-24 01:18:32,690 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:32,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-24 01:18:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-10-24 01:18:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 541 states have (on average 1.4380776340110906) internal successors, (778), 544 states have internal predecessors, (778), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1026 transitions. [2024-10-24 01:18:32,747 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1026 transitions. Word has length 61 [2024-10-24 01:18:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:32,747 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1026 transitions. [2024-10-24 01:18:32,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1026 transitions. [2024-10-24 01:18:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:32,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:32,749 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, 1, 1] [2024-10-24 01:18:32,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:18:32,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1319245148, now seen corresponding path program 1 times [2024-10-24 01:18:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376361417] [2024-10-24 01:18:32,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,890 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-24 01:18:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:32,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376361417] [2024-10-24 01:18:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376361417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:32,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:32,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714532148] [2024-10-24 01:18:32,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:32,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:32,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:32,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:32,892 INFO L87 Difference]: Start difference. First operand 711 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:32,982 INFO L93 Difference]: Finished difference Result 1333 states and 1946 transitions. [2024-10-24 01:18:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:32,989 INFO L225 Difference]: With dead ends: 1333 [2024-10-24 01:18:32,989 INFO L226 Difference]: Without dead ends: 727 [2024-10-24 01:18:32,991 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-24 01:18:32,991 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 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-24 01:18:32,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-24 01:18:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-10-24 01:18:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 553 states have (on average 1.4285714285714286) internal successors, (790), 556 states have internal predecessors, (790), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1038 transitions. [2024-10-24 01:18:33,036 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1038 transitions. Word has length 69 [2024-10-24 01:18:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:33,036 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1038 transitions. [2024-10-24 01:18:33,036 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, (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-24 01:18:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1038 transitions. [2024-10-24 01:18:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:33,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:33,038 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, 1, 1] [2024-10-24 01:18:33,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:18:33,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1077214155, now seen corresponding path program 1 times [2024-10-24 01:18:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:33,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130753123] [2024-10-24 01:18:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,211 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-24 01:18:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:33,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130753123] [2024-10-24 01:18:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130753123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166881778] [2024-10-24 01:18:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:33,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:33,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:33,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:33,213 INFO L87 Difference]: Start difference. First operand 727 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:33,301 INFO L93 Difference]: Finished difference Result 1369 states and 1986 transitions. [2024-10-24 01:18:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:33,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:33,306 INFO L225 Difference]: With dead ends: 1369 [2024-10-24 01:18:33,307 INFO L226 Difference]: Without dead ends: 747 [2024-10-24 01:18:33,309 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-24 01:18:33,309 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:33,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-24 01:18:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-10-24 01:18:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 569 states have (on average 1.4165202108963093) internal successors, (806), 572 states have internal predecessors, (806), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1054 transitions. [2024-10-24 01:18:33,357 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1054 transitions. Word has length 69 [2024-10-24 01:18:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1054 transitions. [2024-10-24 01:18:33,358 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, (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-24 01:18:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1054 transitions. [2024-10-24 01:18:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:18:33,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:33,360 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, 1, 1] [2024-10-24 01:18:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:18:33,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 371503403, now seen corresponding path program 1 times [2024-10-24 01:18:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471168366] [2024-10-24 01:18:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,580 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-24 01:18:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:33,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471168366] [2024-10-24 01:18:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471168366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:33,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959888565] [2024-10-24 01:18:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:33,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:33,583 INFO L87 Difference]: Start difference. First operand 747 states and 1054 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:33,673 INFO L93 Difference]: Finished difference Result 1413 states and 2014 transitions. [2024-10-24 01:18:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-24 01:18:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:33,678 INFO L225 Difference]: With dead ends: 1413 [2024-10-24 01:18:33,679 INFO L226 Difference]: Without dead ends: 771 [2024-10-24 01:18:33,681 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-24 01:18:33,681 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 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-24 01:18:33,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-24 01:18:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2024-10-24 01:18:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 589 states have (on average 1.4023769100169778) internal successors, (826), 592 states have internal predecessors, (826), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1074 transitions. [2024-10-24 01:18:33,732 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1074 transitions. Word has length 77 [2024-10-24 01:18:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1074 transitions. [2024-10-24 01:18:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1074 transitions. [2024-10-24 01:18:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:18:33,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:33,735 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, 1, 1] [2024-10-24 01:18:33,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:18:33,735 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:33,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1261624674, now seen corresponding path program 1 times [2024-10-24 01:18:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995136206] [2024-10-24 01:18:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,263 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-24 01:18:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995136206] [2024-10-24 01:18:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995136206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:34,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:34,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863585594] [2024-10-24 01:18:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:34,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:34,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:34,266 INFO L87 Difference]: Start difference. First operand 771 states and 1074 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:34,589 INFO L93 Difference]: Finished difference Result 1995 states and 2765 transitions. [2024-10-24 01:18:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:34,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-24 01:18:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:34,598 INFO L225 Difference]: With dead ends: 1995 [2024-10-24 01:18:34,598 INFO L226 Difference]: Without dead ends: 1329 [2024-10-24 01:18:34,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-24 01:18:34,601 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 193 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:34,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1404 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:18:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2024-10-24 01:18:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1047. [2024-10-24 01:18:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 792 states have (on average 1.3888888888888888) internal successors, (1100), 797 states have internal predecessors, (1100), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-24 01:18:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1444 transitions. [2024-10-24 01:18:34,676 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1444 transitions. Word has length 80 [2024-10-24 01:18:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:34,677 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1444 transitions. [2024-10-24 01:18:34,677 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, (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-24 01:18:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1444 transitions. [2024-10-24 01:18:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:18:34,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:34,679 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] [2024-10-24 01:18:34,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:18:34,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash 203336820, now seen corresponding path program 1 times [2024-10-24 01:18:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:34,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943309723] [2024-10-24 01:18:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,836 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-24 01:18:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943309723] [2024-10-24 01:18:34,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943309723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:34,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:34,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059715669] [2024-10-24 01:18:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:34,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:34,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:34,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:34,839 INFO L87 Difference]: Start difference. First operand 1047 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:34,975 INFO L93 Difference]: Finished difference Result 1953 states and 2714 transitions. [2024-10-24 01:18:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:34,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 01:18:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:34,982 INFO L225 Difference]: With dead ends: 1953 [2024-10-24 01:18:34,982 INFO L226 Difference]: Without dead ends: 1071 [2024-10-24 01:18:34,986 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-24 01:18:34,987 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 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-24 01:18:34,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-24 01:18:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-24 01:18:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 810 states have (on average 1.3802469135802469) internal successors, (1118), 815 states have internal predecessors, (1118), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-24 01:18:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1462 transitions. [2024-10-24 01:18:35,059 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1462 transitions. Word has length 84 [2024-10-24 01:18:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1462 transitions. [2024-10-24 01:18:35,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1462 transitions. [2024-10-24 01:18:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:18:35,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:35,060 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, 1, 1] [2024-10-24 01:18:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:18:35,061 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1117244196, now seen corresponding path program 1 times [2024-10-24 01:18:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897458166] [2024-10-24 01:18:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,330 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-24 01:18:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897458166] [2024-10-24 01:18:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897458166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510480808] [2024-10-24 01:18:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:35,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:35,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:35,332 INFO L87 Difference]: Start difference. First operand 1071 states and 1462 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:35,574 INFO L93 Difference]: Finished difference Result 1485 states and 2136 transitions. [2024-10-24 01:18:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:35,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2024-10-24 01:18:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:35,584 INFO L225 Difference]: With dead ends: 1485 [2024-10-24 01:18:35,584 INFO L226 Difference]: Without dead ends: 1483 [2024-10-24 01:18:35,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:35,585 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 259 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:35,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2482 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-10-24 01:18:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1079. [2024-10-24 01:18:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 814 states have (on average 1.3783783783783783) internal successors, (1122), 821 states have internal predecessors, (1122), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 01:18:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1470 transitions. [2024-10-24 01:18:35,677 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1470 transitions. Word has length 83 [2024-10-24 01:18:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:35,678 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1470 transitions. [2024-10-24 01:18:35,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1470 transitions. [2024-10-24 01:18:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:18:35,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:35,679 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, 1, 1] [2024-10-24 01:18:35,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:18:35,680 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:35,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1786856787, now seen corresponding path program 1 times [2024-10-24 01:18:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505949456] [2024-10-24 01:18:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,850 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-24 01:18:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505949456] [2024-10-24 01:18:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505949456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281219160] [2024-10-24 01:18:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:35,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:35,854 INFO L87 Difference]: Start difference. First operand 1079 states and 1470 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:36,076 INFO L93 Difference]: Finished difference Result 1945 states and 2661 transitions. [2024-10-24 01:18:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:36,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-24 01:18:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:36,083 INFO L225 Difference]: With dead ends: 1945 [2024-10-24 01:18:36,083 INFO L226 Difference]: Without dead ends: 1113 [2024-10-24 01:18:36,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 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-24 01:18:36,086 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1421 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-24 01:18:36,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1421 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-24 01:18:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1071. [2024-10-24 01:18:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 817 states have (on average 1.3733170134638923) internal successors, (1122), 829 states have internal predecessors, (1122), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-24 01:18:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1446 transitions. [2024-10-24 01:18:36,163 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1446 transitions. Word has length 86 [2024-10-24 01:18:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:36,163 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1446 transitions. [2024-10-24 01:18:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1446 transitions. [2024-10-24 01:18:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:18:36,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:36,167 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, 1, 1] [2024-10-24 01:18:36,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:18:36,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 116448996, now seen corresponding path program 1 times [2024-10-24 01:18:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558096625] [2024-10-24 01:18:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,642 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-24 01:18:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558096625] [2024-10-24 01:18:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558096625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:36,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871946495] [2024-10-24 01:18:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:36,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:36,644 INFO L87 Difference]: Start difference. First operand 1071 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:36,877 INFO L93 Difference]: Finished difference Result 1911 states and 2591 transitions. [2024-10-24 01:18:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-24 01:18:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:36,900 INFO L225 Difference]: With dead ends: 1911 [2024-10-24 01:18:36,900 INFO L226 Difference]: Without dead ends: 1067 [2024-10-24 01:18:36,903 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-24 01:18:36,904 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 145 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1513 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-24 01:18:36,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1513 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-10-24 01:18:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 964. [2024-10-24 01:18:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 747 states have internal predecessors, (1015), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-24 01:18:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1305 transitions. [2024-10-24 01:18:36,996 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1305 transitions. Word has length 88 [2024-10-24 01:18:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:36,997 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1305 transitions. [2024-10-24 01:18:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1305 transitions. [2024-10-24 01:18:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 01:18:36,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:36,999 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-24 01:18:36,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:18:36,999 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash -741171965, now seen corresponding path program 1 times [2024-10-24 01:18:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760357383] [2024-10-24 01:18:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 01:18:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:37,540 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-24 01:18:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760357383] [2024-10-24 01:18:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760357383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941172888] [2024-10-24 01:18:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:37,543 INFO L87 Difference]: Start difference. First operand 964 states and 1305 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:38,062 INFO L93 Difference]: Finished difference Result 1859 states and 2511 transitions. [2024-10-24 01:18:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:38,062 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), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-10-24 01:18:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:38,068 INFO L225 Difference]: With dead ends: 1859 [2024-10-24 01:18:38,068 INFO L226 Difference]: Without dead ends: 1051 [2024-10-24 01:18:38,070 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-24 01:18:38,071 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 659 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:38,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1351 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:18:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-24 01:18:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1002. [2024-10-24 01:18:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 760 states have (on average 1.3539473684210526) internal successors, (1029), 771 states have internal predecessors, (1029), 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-24 01:18:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1337 transitions. [2024-10-24 01:18:38,156 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1337 transitions. Word has length 89 [2024-10-24 01:18:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:38,156 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1337 transitions. [2024-10-24 01:18:38,157 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), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1337 transitions. [2024-10-24 01:18:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 01:18:38,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:38,158 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] [2024-10-24 01:18:38,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:18:38,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:38,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1765724356, now seen corresponding path program 1 times [2024-10-24 01:18:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917323918] [2024-10-24 01:18:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:18:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:18:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:18:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:18:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:18:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 01:18:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 01:18:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:38,651 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-24 01:18:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:38,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917323918] [2024-10-24 01:18:38,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917323918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:38,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365840787] [2024-10-24 01:18:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:38,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:38,653 INFO L87 Difference]: Start difference. First operand 1002 states and 1337 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 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-24 01:18:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:39,168 INFO L93 Difference]: Finished difference Result 1942 states and 2575 transitions. [2024-10-24 01:18:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 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 91 [2024-10-24 01:18:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:39,174 INFO L225 Difference]: With dead ends: 1942 [2024-10-24 01:18:39,175 INFO L226 Difference]: Without dead ends: 1109 [2024-10-24 01:18:39,177 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-24 01:18:39,177 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 520 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1339 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-24 01:18:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1339 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:18:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-10-24 01:18:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1024. [2024-10-24 01:18:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 774 states have (on average 1.3372093023255813) internal successors, (1035), 786 states have internal predecessors, (1035), 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-24 01:18:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1349 transitions. [2024-10-24 01:18:39,269 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1349 transitions. Word has length 91 [2024-10-24 01:18:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:39,270 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1349 transitions. [2024-10-24 01:18:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 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-24 01:18:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1349 transitions. [2024-10-24 01:18:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 01:18:39,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:39,271 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-24 01:18:39,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:18:39,272 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:39,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1782988361, now seen corresponding path program 1 times [2024-10-24 01:18:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059681538] [2024-10-24 01:18:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:18:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:18:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:18:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:18:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:18:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:18:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:18:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:39,367 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-24 01:18:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059681538] [2024-10-24 01:18:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059681538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120196832] [2024-10-24 01:18:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:39,369 INFO L87 Difference]: Start difference. First operand 1024 states and 1349 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-24 01:18:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:39,673 INFO L93 Difference]: Finished difference Result 2682 states and 3557 transitions. [2024-10-24 01:18:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:39,673 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-24 01:18:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:39,684 INFO L225 Difference]: With dead ends: 2682 [2024-10-24 01:18:39,684 INFO L226 Difference]: Without dead ends: 1905 [2024-10-24 01:18:39,687 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-24 01:18:39,688 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 195 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:39,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-10-24 01:18:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1734. [2024-10-24 01:18:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1296 states have (on average 1.3356481481481481) internal successors, (1731), 1316 states have internal predecessors, (1731), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-24 01:18:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2291 transitions. [2024-10-24 01:18:39,857 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2291 transitions. Word has length 92 [2024-10-24 01:18:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:39,857 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2291 transitions. [2024-10-24 01:18:39,857 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-24 01:18:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2291 transitions. [2024-10-24 01:18:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:39,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:39,859 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-24 01:18:39,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:18:39,859 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash 890629356, now seen corresponding path program 1 times [2024-10-24 01:18:39,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118622528] [2024-10-24 01:18:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:18:39,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 01:18:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:18:40,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 01:18:40,064 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 01:18:40,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 01:18:40,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:18:40,070 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] [2024-10-24 01:18:40,186 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 01:18:40,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:18:40 BoogieIcfgContainer [2024-10-24 01:18:40,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 01:18:40,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 01:18:40,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 01:18:40,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 01:18:40,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:28" (3/4) ... [2024-10-24 01:18:40,190 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 01:18:40,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 01:18:40,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 01:18:40,306 INFO L158 Benchmark]: Toolchain (without parser) took 13162.05ms. Allocated memory was 172.0MB in the beginning and 471.9MB in the end (delta: 299.9MB). Free memory was 137.2MB in the beginning and 389.1MB in the end (delta: -251.9MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,306 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:18:40,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.00ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 117.0MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.77ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 113.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,307 INFO L158 Benchmark]: Boogie Preprocessor took 85.01ms. Allocated memory is still 172.0MB. Free memory was 113.5MB in the beginning and 108.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,307 INFO L158 Benchmark]: RCFGBuilder took 939.30ms. Allocated memory is still 172.0MB. Free memory was 108.7MB in the beginning and 94.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,307 INFO L158 Benchmark]: TraceAbstraction took 11446.27ms. Allocated memory was 172.0MB in the beginning and 471.9MB in the end (delta: 299.9MB). Free memory was 94.7MB in the beginning and 409.0MB in the end (delta: -314.3MB). Peak memory consumption was 226.2MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,308 INFO L158 Benchmark]: Witness Printer took 115.96ms. Allocated memory is still 471.9MB. Free memory was 409.0MB in the beginning and 389.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 01:18:40,309 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.18ms. Allocated memory is still 109.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.00ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 117.0MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.77ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 113.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.01ms. Allocated memory is still 172.0MB. Free memory was 113.5MB in the beginning and 108.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 939.30ms. Allocated memory is still 172.0MB. Free memory was 108.7MB in the beginning and 94.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11446.27ms. Allocated memory was 172.0MB in the beginning and 471.9MB in the end (delta: 299.9MB). Free memory was 94.7MB in the beginning and 409.0MB in the end (delta: -314.3MB). Peak memory consumption was 226.2MB. Max. memory is 16.1GB. * Witness Printer took 115.96ms. Allocated memory is still 471.9MB. Free memory was 409.0MB in the beginning and 389.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, 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=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, 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=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=-2, 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=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, 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=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, 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=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, 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=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 170 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3458 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3412 mSDsluCounter, 20112 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14530 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1621 IncrementalHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 5582 mSDtfsCounter, 1621 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1734occurred in iteration=21, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1157 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1444 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1329 ConstructedInterpolants, 0 QuantifiedInterpolants, 3061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 147/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 01:18:40,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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