./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.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 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:57:31,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:57:31,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:57:31,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:57:31,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:57:31,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:57:31,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:57:31,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:57:31,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:57:31,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:57:31,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:57:31,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:57:31,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:57:31,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:57:31,608 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:57:31,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:57:31,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:57:31,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:57:31,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:57:31,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:57:31,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:57:31,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:57:31,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:57:31,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:57:31,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:57:31,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:57:31,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:57:31,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:57:31,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:57:31,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:57:31,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:57:31,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:57:31,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:57:31,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:57:31,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:57:31,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:57:31,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:57:31,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:57:31,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:57:31,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:57:31,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:57:31,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:57:31,617 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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2024-11-16 09:57:31,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:57:31,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:57:31,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:57:31,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:57:31,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:57:31,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2024-11-16 09:57:33,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:57:33,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:57:33,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2024-11-16 09:57:33,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff9c43df/4bd0456f78c34be597af2e2ed4b78264/FLAG36e9057f3 [2024-11-16 09:57:33,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff9c43df/4bd0456f78c34be597af2e2ed4b78264 [2024-11-16 09:57:33,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:57:33,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:57:33,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:57:33,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:57:33,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:57:33,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:57:33" (1/1) ... [2024-11-16 09:57:33,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c22c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:33, skipping insertion in model container [2024-11-16 09:57:33,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:57:33" (1/1) ... [2024-11-16 09:57:33,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:57:33,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2024-11-16 09:57:34,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2024-11-16 09:57:34,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:57:34,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:57:34,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2024-11-16 09:57:34,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2024-11-16 09:57:34,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:57:34,273 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:57:34,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34 WrapperNode [2024-11-16 09:57:34,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:57:34,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:57:34,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:57:34,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:57:34,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,366 INFO L138 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 444 [2024-11-16 09:57:34,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:57:34,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:57:34,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:57:34,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:57:34,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,420 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-11-16 09:57:34,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:57:34,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:57:34,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:57:34,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:57:34,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (1/1) ... [2024-11-16 09:57:34,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:57:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:34,500 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-11-16 09:57:34,505 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-11-16 09:57:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:57:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-16 09:57:34,544 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-16 09:57:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-16 09:57:34,545 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-16 09:57:34,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-16 09:57:34,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-16 09:57:34,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-16 09:57:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-16 09:57:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-16 09:57:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-16 09:57:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-16 09:57:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-16 09:57:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-16 09:57:34,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-16 09:57:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-16 09:57:34,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-16 09:57:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-16 09:57:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-16 09:57:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-16 09:57:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-16 09:57:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-16 09:57:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-16 09:57:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:57:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-16 09:57:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-16 09:57:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-16 09:57:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-16 09:57:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:57:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:57:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-16 09:57:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-16 09:57:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-16 09:57:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-16 09:57:34,639 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:57:34,643 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:57:35,032 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2024-11-16 09:57:35,033 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-16 09:57:35,033 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2024-11-16 09:57:35,103 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-16 09:57:35,103 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:57:35,127 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:57:35,127 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:57:35,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:35 BoogieIcfgContainer [2024-11-16 09:57:35,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:57:35,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:57:35,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:57:35,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:57:35,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:57:33" (1/3) ... [2024-11-16 09:57:35,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cfc517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:57:35, skipping insertion in model container [2024-11-16 09:57:35,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:34" (2/3) ... [2024-11-16 09:57:35,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cfc517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:57:35, skipping insertion in model container [2024-11-16 09:57:35,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:35" (3/3) ... [2024-11-16 09:57:35,134 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2024-11-16 09:57:35,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:57:35,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:57:35,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:57:35,203 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;@56e0c73e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:57:35,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:57:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 267 states, 216 states have (on average 1.4583333333333333) internal successors, (315), 224 states have internal predecessors, (315), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 09:57:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:35,246 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, 1, 1, 1, 1, 1, 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-11-16 09:57:35,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1336971334, now seen corresponding path program 1 times [2024-11-16 09:57:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:35,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440037327] [2024-11-16 09:57:35,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:35,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:35,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:35,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:35,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:35,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440037327] [2024-11-16 09:57:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440037327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 09:57:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140797388] [2024-11-16 09:57:35,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:35,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 09:57:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 09:57:35,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:57:35,677 INFO L87 Difference]: Start difference. First operand has 267 states, 216 states have (on average 1.4583333333333333) internal successors, (315), 224 states have internal predecessors, (315), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:36,431 INFO L93 Difference]: Finished difference Result 663 states and 963 transitions. [2024-11-16 09:57:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:57:36,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-16 09:57:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:36,447 INFO L225 Difference]: With dead ends: 663 [2024-11-16 09:57:36,447 INFO L226 Difference]: Without dead ends: 400 [2024-11-16 09:57:36,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:57:36,452 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 615 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:36,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 883 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 09:57:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-16 09:57:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 356. [2024-11-16 09:57:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.3986254295532645) internal successors, (407), 297 states have internal predecessors, (407), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-16 09:57:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2024-11-16 09:57:36,560 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 63 [2024-11-16 09:57:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:36,560 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2024-11-16 09:57:36,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2024-11-16 09:57:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:36,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:36,564 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, 1, 1, 1, 1, 1, 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-11-16 09:57:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:57:36,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:36,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash 489320956, now seen corresponding path program 1 times [2024-11-16 09:57:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328295232] [2024-11-16 09:57:36,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:36,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:36,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:36,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328295232] [2024-11-16 09:57:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328295232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:57:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263141842] [2024-11-16 09:57:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:36,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:57:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:57:36,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:57:36,701 INFO L87 Difference]: Start difference. First operand 356 states and 492 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:37,694 INFO L93 Difference]: Finished difference Result 748 states and 1041 transitions. [2024-11-16 09:57:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:57:37,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-16 09:57:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:37,698 INFO L225 Difference]: With dead ends: 748 [2024-11-16 09:57:37,698 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 09:57:37,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:57:37,700 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 590 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:37,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1290 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 09:57:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 09:57:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 459. [2024-11-16 09:57:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 377 states have (on average 1.3925729442970822) internal successors, (525), 384 states have internal predecessors, (525), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-16 09:57:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 632 transitions. [2024-11-16 09:57:37,738 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 632 transitions. Word has length 63 [2024-11-16 09:57:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 632 transitions. [2024-11-16 09:57:37,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 632 transitions. [2024-11-16 09:57:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:37,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:37,741 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, 1, 1, 1, 1, 1, 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-11-16 09:57:37,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:57:37,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 248780827, now seen corresponding path program 1 times [2024-11-16 09:57:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:37,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993865882] [2024-11-16 09:57:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993865882] [2024-11-16 09:57:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993865882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:37,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:57:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706508237] [2024-11-16 09:57:37,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:57:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:57:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:57:37,883 INFO L87 Difference]: Start difference. First operand 459 states and 632 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:38,670 INFO L93 Difference]: Finished difference Result 1138 states and 1577 transitions. [2024-11-16 09:57:38,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 09:57:38,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-16 09:57:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:38,675 INFO L225 Difference]: With dead ends: 1138 [2024-11-16 09:57:38,675 INFO L226 Difference]: Without dead ends: 813 [2024-11-16 09:57:38,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:38,677 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 645 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:38,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1278 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 09:57:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-16 09:57:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 660. [2024-11-16 09:57:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 546 states have (on average 1.3882783882783882) internal successors, (758), 555 states have internal predecessors, (758), 71 states have call successors, (71), 39 states have call predecessors, (71), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2024-11-16 09:57:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 909 transitions. [2024-11-16 09:57:38,725 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 909 transitions. Word has length 63 [2024-11-16 09:57:38,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:38,725 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 909 transitions. [2024-11-16 09:57:38,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 909 transitions. [2024-11-16 09:57:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:38,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:38,727 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, 1, 1, 1, 1, 1, 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-11-16 09:57:38,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:57:38,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 241021468, now seen corresponding path program 1 times [2024-11-16 09:57:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441987675] [2024-11-16 09:57:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441987675] [2024-11-16 09:57:38,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441987675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:38,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:57:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042651676] [2024-11-16 09:57:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:38,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:57:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:38,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:57:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:57:38,837 INFO L87 Difference]: Start difference. First operand 660 states and 909 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:39,491 INFO L93 Difference]: Finished difference Result 1764 states and 2442 transitions. [2024-11-16 09:57:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 09:57:39,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-16 09:57:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:39,499 INFO L225 Difference]: With dead ends: 1764 [2024-11-16 09:57:39,499 INFO L226 Difference]: Without dead ends: 1238 [2024-11-16 09:57:39,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:39,503 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 632 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:39,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 966 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:57:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-11-16 09:57:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 995. [2024-11-16 09:57:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 823 states have (on average 1.3730255164034022) internal successors, (1130), 836 states have internal predecessors, (1130), 103 states have call successors, (103), 61 states have call predecessors, (103), 67 states have return successors, (134), 106 states have call predecessors, (134), 99 states have call successors, (134) [2024-11-16 09:57:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1367 transitions. [2024-11-16 09:57:39,563 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1367 transitions. Word has length 63 [2024-11-16 09:57:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:39,564 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1367 transitions. [2024-11-16 09:57:39,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1367 transitions. [2024-11-16 09:57:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:39,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:39,567 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, 1, 1, 1, 1, 1, 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-11-16 09:57:39,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:57:39,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:39,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1210602491, now seen corresponding path program 1 times [2024-11-16 09:57:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286267210] [2024-11-16 09:57:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:39,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286267210] [2024-11-16 09:57:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286267210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:39,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 09:57:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736806276] [2024-11-16 09:57:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:39,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 09:57:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 09:57:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:57:39,625 INFO L87 Difference]: Start difference. First operand 995 states and 1367 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:40,494 INFO L93 Difference]: Finished difference Result 2516 states and 3470 transitions. [2024-11-16 09:57:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:57:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-16 09:57:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:40,504 INFO L225 Difference]: With dead ends: 2516 [2024-11-16 09:57:40,504 INFO L226 Difference]: Without dead ends: 1656 [2024-11-16 09:57:40,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 09:57:40,509 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 714 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:40,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 938 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:57:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-16 09:57:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1451. [2024-11-16 09:57:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1196 states have (on average 1.3469899665551839) internal successors, (1611), 1218 states have internal predecessors, (1611), 152 states have call successors, (152), 91 states have call predecessors, (152), 101 states have return successors, (193), 150 states have call predecessors, (193), 148 states have call successors, (193) [2024-11-16 09:57:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1956 transitions. [2024-11-16 09:57:40,579 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1956 transitions. Word has length 63 [2024-11-16 09:57:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:40,579 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 1956 transitions. [2024-11-16 09:57:40,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:57:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1956 transitions. [2024-11-16 09:57:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 09:57:40,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:40,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:57:40,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:40,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195703, now seen corresponding path program 1 times [2024-11-16 09:57:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233959359] [2024-11-16 09:57:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233959359] [2024-11-16 09:57:40,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233959359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:40,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:40,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308988346] [2024-11-16 09:57:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:40,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:40,726 INFO L87 Difference]: Start difference. First operand 1451 states and 1956 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:41,652 INFO L93 Difference]: Finished difference Result 1732 states and 2352 transitions. [2024-11-16 09:57:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:57:41,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2024-11-16 09:57:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:41,660 INFO L225 Difference]: With dead ends: 1732 [2024-11-16 09:57:41,660 INFO L226 Difference]: Without dead ends: 1615 [2024-11-16 09:57:41,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:41,662 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 495 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:41,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1082 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:57:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-16 09:57:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1575. [2024-11-16 09:57:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1298 states have (on average 1.3482280431432974) internal successors, (1750), 1322 states have internal predecessors, (1750), 165 states have call successors, (165), 98 states have call predecessors, (165), 110 states have return successors, (211), 164 states have call predecessors, (211), 161 states have call successors, (211) [2024-11-16 09:57:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2126 transitions. [2024-11-16 09:57:41,756 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2126 transitions. Word has length 69 [2024-11-16 09:57:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:41,757 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2126 transitions. [2024-11-16 09:57:41,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2126 transitions. [2024-11-16 09:57:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 09:57:41,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:41,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:41,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:57:41,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash -593756631, now seen corresponding path program 1 times [2024-11-16 09:57:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637997312] [2024-11-16 09:57:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637997312] [2024-11-16 09:57:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637997312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886694735] [2024-11-16 09:57:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:41,859 INFO L87 Difference]: Start difference. First operand 1575 states and 2126 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:42,740 INFO L93 Difference]: Finished difference Result 2010 states and 2730 transitions. [2024-11-16 09:57:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:57:42,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2024-11-16 09:57:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:42,747 INFO L225 Difference]: With dead ends: 2010 [2024-11-16 09:57:42,747 INFO L226 Difference]: Without dead ends: 1776 [2024-11-16 09:57:42,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:57:42,748 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 640 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:42,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1565 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:57:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-16 09:57:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1699. [2024-11-16 09:57:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1400 states have (on average 1.3485714285714285) internal successors, (1888), 1426 states have internal predecessors, (1888), 178 states have call successors, (178), 105 states have call predecessors, (178), 119 states have return successors, (232), 178 states have call predecessors, (232), 174 states have call successors, (232) [2024-11-16 09:57:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2298 transitions. [2024-11-16 09:57:42,849 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2298 transitions. Word has length 69 [2024-11-16 09:57:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:42,850 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2298 transitions. [2024-11-16 09:57:42,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2298 transitions. [2024-11-16 09:57:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 09:57:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:42,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:42,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:57:42,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 99636074, now seen corresponding path program 1 times [2024-11-16 09:57:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:42,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430115244] [2024-11-16 09:57:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:42,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430115244] [2024-11-16 09:57:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430115244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:57:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059690282] [2024-11-16 09:57:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:42,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:57:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:57:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:57:42,962 INFO L87 Difference]: Start difference. First operand 1699 states and 2298 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-16 09:57:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:44,373 INFO L93 Difference]: Finished difference Result 3414 states and 4665 transitions. [2024-11-16 09:57:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 09:57:44,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 69 [2024-11-16 09:57:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:44,383 INFO L225 Difference]: With dead ends: 3414 [2024-11-16 09:57:44,383 INFO L226 Difference]: Without dead ends: 3044 [2024-11-16 09:57:44,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 09:57:44,386 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 2381 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:44,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 1686 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:57:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2024-11-16 09:57:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2871. [2024-11-16 09:57:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2367 states have (on average 1.3312209547950993) internal successors, (3151), 2408 states have internal predecessors, (3151), 288 states have call successors, (288), 188 states have call predecessors, (288), 214 states have return successors, (365), 284 states have call predecessors, (365), 284 states have call successors, (365) [2024-11-16 09:57:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3804 transitions. [2024-11-16 09:57:44,566 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3804 transitions. Word has length 69 [2024-11-16 09:57:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:44,566 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3804 transitions. [2024-11-16 09:57:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-16 09:57:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3804 transitions. [2024-11-16 09:57:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 09:57:44,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:44,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:44,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:57:44,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 362994199, now seen corresponding path program 1 times [2024-11-16 09:57:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831167569] [2024-11-16 09:57:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 09:57:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 09:57:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831167569] [2024-11-16 09:57:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831167569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336416661] [2024-11-16 09:57:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:44,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:44,681 INFO L87 Difference]: Start difference. First operand 2871 states and 3804 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:45,307 INFO L93 Difference]: Finished difference Result 4539 states and 6015 transitions. [2024-11-16 09:57:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:57:45,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-16 09:57:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:45,316 INFO L225 Difference]: With dead ends: 4539 [2024-11-16 09:57:45,316 INFO L226 Difference]: Without dead ends: 3003 [2024-11-16 09:57:45,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 09:57:45,319 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 340 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:45,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1348 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 09:57:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2024-11-16 09:57:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2911. [2024-11-16 09:57:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2399 states have (on average 1.3243017924135057) internal successors, (3177), 2440 states have internal predecessors, (3177), 288 states have call successors, (288), 188 states have call predecessors, (288), 222 states have return successors, (373), 292 states have call predecessors, (373), 284 states have call successors, (373) [2024-11-16 09:57:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3838 transitions. [2024-11-16 09:57:45,485 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3838 transitions. Word has length 70 [2024-11-16 09:57:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:45,485 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 3838 transitions. [2024-11-16 09:57:45,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3838 transitions. [2024-11-16 09:57:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 09:57:45,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:45,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:45,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:57:45,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:45,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash 487067446, now seen corresponding path program 1 times [2024-11-16 09:57:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785248464] [2024-11-16 09:57:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 09:57:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 09:57:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:45,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785248464] [2024-11-16 09:57:45,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785248464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:45,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:57:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669988901] [2024-11-16 09:57:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:57:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:57:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:57:45,575 INFO L87 Difference]: Start difference. First operand 2911 states and 3838 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 09:57:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:47,115 INFO L93 Difference]: Finished difference Result 6895 states and 9124 transitions. [2024-11-16 09:57:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 09:57:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2024-11-16 09:57:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:47,126 INFO L225 Difference]: With dead ends: 6895 [2024-11-16 09:57:47,126 INFO L226 Difference]: Without dead ends: 3282 [2024-11-16 09:57:47,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 09:57:47,131 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 2538 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:47,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 1730 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 09:57:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2024-11-16 09:57:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3097. [2024-11-16 09:57:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2513 states have (on average 1.30441703143653) internal successors, (3278), 2556 states have internal predecessors, (3278), 328 states have call successors, (328), 216 states have call predecessors, (328), 254 states have return successors, (419), 334 states have call predecessors, (419), 324 states have call successors, (419) [2024-11-16 09:57:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4025 transitions. [2024-11-16 09:57:47,329 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4025 transitions. Word has length 70 [2024-11-16 09:57:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:47,329 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4025 transitions. [2024-11-16 09:57:47,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 09:57:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4025 transitions. [2024-11-16 09:57:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 09:57:47,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:47,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:47,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:57:47,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:47,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2021369997, now seen corresponding path program 1 times [2024-11-16 09:57:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441725118] [2024-11-16 09:57:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 09:57:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 09:57:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 09:57:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 09:57:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:47,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441725118] [2024-11-16 09:57:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441725118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:47,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365921906] [2024-11-16 09:57:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:47,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:47,443 INFO L87 Difference]: Start difference. First operand 3097 states and 4025 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:48,080 INFO L93 Difference]: Finished difference Result 5037 states and 6534 transitions. [2024-11-16 09:57:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 09:57:48,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2024-11-16 09:57:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:48,091 INFO L225 Difference]: With dead ends: 5037 [2024-11-16 09:57:48,091 INFO L226 Difference]: Without dead ends: 3275 [2024-11-16 09:57:48,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:48,095 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 337 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:48,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1284 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 09:57:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2024-11-16 09:57:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3157. [2024-11-16 09:57:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3157 states, 2561 states have (on average 1.296368606013276) internal successors, (3320), 2604 states have internal predecessors, (3320), 328 states have call successors, (328), 216 states have call predecessors, (328), 266 states have return successors, (431), 346 states have call predecessors, (431), 324 states have call successors, (431) [2024-11-16 09:57:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 4079 transitions. [2024-11-16 09:57:48,411 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 4079 transitions. Word has length 103 [2024-11-16 09:57:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:48,411 INFO L471 AbstractCegarLoop]: Abstraction has 3157 states and 4079 transitions. [2024-11-16 09:57:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 4079 transitions. [2024-11-16 09:57:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 09:57:48,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:48,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:48,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:57:48,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:48,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -716976268, now seen corresponding path program 1 times [2024-11-16 09:57:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:48,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709341230] [2024-11-16 09:57:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 09:57:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 09:57:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 09:57:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 09:57:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709341230] [2024-11-16 09:57:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709341230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:48,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974428067] [2024-11-16 09:57:48,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:48,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:48,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:48,551 INFO L87 Difference]: Start difference. First operand 3157 states and 4079 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:49,338 INFO L93 Difference]: Finished difference Result 4782 states and 6141 transitions. [2024-11-16 09:57:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 09:57:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 103 [2024-11-16 09:57:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:49,350 INFO L225 Difference]: With dead ends: 4782 [2024-11-16 09:57:49,350 INFO L226 Difference]: Without dead ends: 3215 [2024-11-16 09:57:49,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-16 09:57:49,353 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 777 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:49,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 993 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:57:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2024-11-16 09:57:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2919. [2024-11-16 09:57:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2376 states have (on average 1.2984006734006734) internal successors, (3085), 2414 states have internal predecessors, (3085), 300 states have call successors, (300), 197 states have call predecessors, (300), 241 states have return successors, (391), 316 states have call predecessors, (391), 296 states have call successors, (391) [2024-11-16 09:57:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3776 transitions. [2024-11-16 09:57:49,546 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3776 transitions. Word has length 103 [2024-11-16 09:57:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:49,547 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 3776 transitions. [2024-11-16 09:57:49,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3776 transitions. [2024-11-16 09:57:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 09:57:49,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:49,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:49,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:57:49,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:49,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -616064301, now seen corresponding path program 1 times [2024-11-16 09:57:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:49,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653959987] [2024-11-16 09:57:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 09:57:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 09:57:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 09:57:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 09:57:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653959987] [2024-11-16 09:57:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653959987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:57:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266985102] [2024-11-16 09:57:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:57:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:57:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:57:49,650 INFO L87 Difference]: Start difference. First operand 2919 states and 3776 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 09:57:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:50,357 INFO L93 Difference]: Finished difference Result 6298 states and 8115 transitions. [2024-11-16 09:57:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 09:57:50,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 103 [2024-11-16 09:57:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:50,375 INFO L225 Difference]: With dead ends: 6298 [2024-11-16 09:57:50,375 INFO L226 Difference]: Without dead ends: 4715 [2024-11-16 09:57:50,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-16 09:57:50,379 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 555 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:50,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 936 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 09:57:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2024-11-16 09:57:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4501. [2024-11-16 09:57:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4501 states, 3638 states have (on average 1.2715777899945024) internal successors, (4626), 3705 states have internal predecessors, (4626), 461 states have call successors, (461), 310 states have call predecessors, (461), 400 states have return successors, (674), 495 states have call predecessors, (674), 457 states have call successors, (674) [2024-11-16 09:57:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 5761 transitions. [2024-11-16 09:57:50,796 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 5761 transitions. Word has length 103 [2024-11-16 09:57:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:50,798 INFO L471 AbstractCegarLoop]: Abstraction has 4501 states and 5761 transitions. [2024-11-16 09:57:50,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 09:57:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 5761 transitions. [2024-11-16 09:57:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 09:57:50,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:50,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:50,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:57:50,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1057818796, now seen corresponding path program 1 times [2024-11-16 09:57:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045585939] [2024-11-16 09:57:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 09:57:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 09:57:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 09:57:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 09:57:50,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045585939] [2024-11-16 09:57:50,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045585939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:50,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:50,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 09:57:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731088017] [2024-11-16 09:57:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:50,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 09:57:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 09:57:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:57:50,909 INFO L87 Difference]: Start difference. First operand 4501 states and 5761 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:51,508 INFO L93 Difference]: Finished difference Result 6199 states and 7859 transitions. [2024-11-16 09:57:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:57:51,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 103 [2024-11-16 09:57:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:51,518 INFO L225 Difference]: With dead ends: 6199 [2024-11-16 09:57:51,518 INFO L226 Difference]: Without dead ends: 3034 [2024-11-16 09:57:51,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:57:51,524 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 457 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:51,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 621 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 09:57:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2024-11-16 09:57:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2919. [2024-11-16 09:57:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2376 states have (on average 1.2828282828282829) internal successors, (3048), 2414 states have internal predecessors, (3048), 300 states have call successors, (300), 197 states have call predecessors, (300), 241 states have return successors, (391), 316 states have call predecessors, (391), 296 states have call successors, (391) [2024-11-16 09:57:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3739 transitions. [2024-11-16 09:57:51,734 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3739 transitions. Word has length 103 [2024-11-16 09:57:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:51,734 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 3739 transitions. [2024-11-16 09:57:51,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3739 transitions. [2024-11-16 09:57:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 09:57:51,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:51,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:57:51,737 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:51,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2136420239, now seen corresponding path program 1 times [2024-11-16 09:57:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830176033] [2024-11-16 09:57:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 09:57:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 09:57:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 09:57:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830176033] [2024-11-16 09:57:51,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830176033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:57:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228336757] [2024-11-16 09:57:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:51,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:57:51,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:51,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:57:51,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 09:57:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:51,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:57:51,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:57:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 09:57:51,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:57:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228336757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:51,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:57:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-16 09:57:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307052255] [2024-11-16 09:57:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:51,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:57:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:57:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:51,994 INFO L87 Difference]: Start difference. First operand 2919 states and 3739 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:52,201 INFO L93 Difference]: Finished difference Result 5478 states and 7213 transitions. [2024-11-16 09:57:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:57:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 104 [2024-11-16 09:57:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:52,215 INFO L225 Difference]: With dead ends: 5478 [2024-11-16 09:57:52,215 INFO L226 Difference]: Without dead ends: 4162 [2024-11-16 09:57:52,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:52,219 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 289 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:52,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:57:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2024-11-16 09:57:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4101. [2024-11-16 09:57:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 3346 states have (on average 1.2997609085475195) internal successors, (4349), 3401 states have internal predecessors, (4349), 420 states have call successors, (420), 277 states have call predecessors, (420), 333 states have return successors, (549), 431 states have call predecessors, (549), 416 states have call successors, (549) [2024-11-16 09:57:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5318 transitions. [2024-11-16 09:57:52,475 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5318 transitions. Word has length 104 [2024-11-16 09:57:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:52,475 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 5318 transitions. [2024-11-16 09:57:52,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5318 transitions. [2024-11-16 09:57:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 09:57:52,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:52,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:52,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 09:57:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 09:57:52,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:52,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1651321188, now seen corresponding path program 1 times [2024-11-16 09:57:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365488909] [2024-11-16 09:57:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 09:57:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 09:57:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 09:57:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 09:57:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365488909] [2024-11-16 09:57:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365488909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:52,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555289831] [2024-11-16 09:57:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:52,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:52,775 INFO L87 Difference]: Start difference. First operand 4101 states and 5318 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 09:57:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:54,088 INFO L93 Difference]: Finished difference Result 6663 states and 8545 transitions. [2024-11-16 09:57:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 09:57:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 104 [2024-11-16 09:57:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:54,106 INFO L225 Difference]: With dead ends: 6663 [2024-11-16 09:57:54,106 INFO L226 Difference]: Without dead ends: 4920 [2024-11-16 09:57:54,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-11-16 09:57:54,112 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1298 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:54,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 1238 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:57:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2024-11-16 09:57:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4740. [2024-11-16 09:57:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4740 states, 3831 states have (on average 1.2813886713651788) internal successors, (4909), 3894 states have internal predecessors, (4909), 497 states have call successors, (497), 325 states have call predecessors, (497), 410 states have return successors, (680), 529 states have call predecessors, (680), 493 states have call successors, (680) [2024-11-16 09:57:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 6086 transitions. [2024-11-16 09:57:54,499 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 6086 transitions. Word has length 104 [2024-11-16 09:57:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 4740 states and 6086 transitions. [2024-11-16 09:57:54,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 09:57:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 6086 transitions. [2024-11-16 09:57:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 09:57:54,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:54,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:54,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:57:54,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -646090453, now seen corresponding path program 1 times [2024-11-16 09:57:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360924642] [2024-11-16 09:57:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 09:57:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 09:57:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 09:57:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360924642] [2024-11-16 09:57:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360924642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:57:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236355082] [2024-11-16 09:57:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:57:54,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:54,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:57:54,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 09:57:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:54,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:57:54,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:57:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 09:57:54,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:57:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236355082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:57:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 09:57:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620601101] [2024-11-16 09:57:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:57:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:57:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:54,698 INFO L87 Difference]: Start difference. First operand 4740 states and 6086 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 09:57:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:55,408 INFO L93 Difference]: Finished difference Result 9416 states and 12475 transitions. [2024-11-16 09:57:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:57:55,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2024-11-16 09:57:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:55,430 INFO L225 Difference]: With dead ends: 9416 [2024-11-16 09:57:55,430 INFO L226 Difference]: Without dead ends: 6919 [2024-11-16 09:57:55,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:55,439 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 120 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:55,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 767 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:57:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6919 states. [2024-11-16 09:57:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6919 to 6919. [2024-11-16 09:57:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6919 states, 5619 states have (on average 1.2899092365189535) internal successors, (7248), 5707 states have internal predecessors, (7248), 716 states have call successors, (716), 473 states have call predecessors, (716), 582 states have return successors, (1031), 755 states have call predecessors, (1031), 712 states have call successors, (1031) [2024-11-16 09:57:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6919 states to 6919 states and 8995 transitions. [2024-11-16 09:57:55,903 INFO L78 Accepts]: Start accepts. Automaton has 6919 states and 8995 transitions. Word has length 104 [2024-11-16 09:57:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:55,903 INFO L471 AbstractCegarLoop]: Abstraction has 6919 states and 8995 transitions. [2024-11-16 09:57:55,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 09:57:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6919 states and 8995 transitions. [2024-11-16 09:57:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 09:57:55,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:55,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:55,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 09:57:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-16 09:57:56,114 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:56,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash 610793672, now seen corresponding path program 1 times [2024-11-16 09:57:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910322196] [2024-11-16 09:57:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 09:57:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 09:57:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 09:57:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 09:57:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-16 09:57:56,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910322196] [2024-11-16 09:57:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910322196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:57:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716498135] [2024-11-16 09:57:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:56,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:57:56,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:56,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:57:56,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 09:57:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:56,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:57:56,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:57:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-16 09:57:56,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:57:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716498135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:56,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:57:56,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 09:57:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10366621] [2024-11-16 09:57:56,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:57:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:56,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:57:56,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:56,327 INFO L87 Difference]: Start difference. First operand 6919 states and 8995 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-16 09:57:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:56,724 INFO L93 Difference]: Finished difference Result 10442 states and 13850 transitions. [2024-11-16 09:57:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:57:56,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 155 [2024-11-16 09:57:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:56,743 INFO L225 Difference]: With dead ends: 10442 [2024-11-16 09:57:56,743 INFO L226 Difference]: Without dead ends: 6339 [2024-11-16 09:57:56,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:56,751 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 298 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:56,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:57:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2024-11-16 09:57:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6291. [2024-11-16 09:57:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6291 states, 5125 states have (on average 1.2558048780487805) internal successors, (6436), 5197 states have internal predecessors, (6436), 634 states have call successors, (634), 437 states have call predecessors, (634), 530 states have return successors, (853), 665 states have call predecessors, (853), 630 states have call successors, (853) [2024-11-16 09:57:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6291 states to 6291 states and 7923 transitions. [2024-11-16 09:57:57,134 INFO L78 Accepts]: Start accepts. Automaton has 6291 states and 7923 transitions. Word has length 155 [2024-11-16 09:57:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 6291 states and 7923 transitions. [2024-11-16 09:57:57,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-16 09:57:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6291 states and 7923 transitions. [2024-11-16 09:57:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 09:57:57,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:57,142 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:57,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 09:57:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-16 09:57:57,343 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:57,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -889867867, now seen corresponding path program 2 times [2024-11-16 09:57:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402927768] [2024-11-16 09:57:57,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 09:57:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 09:57:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 09:57:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 09:57:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-16 09:57:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402927768] [2024-11-16 09:57:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402927768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:57:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102006074] [2024-11-16 09:57:57,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 09:57:57,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:57:57,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:57,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:57:57,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 09:57:57,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 09:57:57,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 09:57:57,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 09:57:57,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:57:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 09:57:57,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:57:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102006074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:57:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-16 09:57:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262757959] [2024-11-16 09:57:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:57:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:57:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:57:57,549 INFO L87 Difference]: Start difference. First operand 6291 states and 7923 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-16 09:57:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:57,955 INFO L93 Difference]: Finished difference Result 10366 states and 13304 transitions. [2024-11-16 09:57:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:57:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 155 [2024-11-16 09:57:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:57,971 INFO L225 Difference]: With dead ends: 10366 [2024-11-16 09:57:57,971 INFO L226 Difference]: Without dead ends: 6321 [2024-11-16 09:57:57,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:57:57,980 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:57,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1270 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:57:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2024-11-16 09:57:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2024-11-16 09:57:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 5155 states have (on average 1.2438409311348206) internal successors, (6412), 5227 states have internal predecessors, (6412), 634 states have call successors, (634), 437 states have call predecessors, (634), 530 states have return successors, (853), 665 states have call predecessors, (853), 630 states have call successors, (853) [2024-11-16 09:57:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 7899 transitions. [2024-11-16 09:57:58,490 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 7899 transitions. Word has length 155 [2024-11-16 09:57:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:58,490 INFO L471 AbstractCegarLoop]: Abstraction has 6321 states and 7899 transitions. [2024-11-16 09:57:58,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-16 09:57:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 7899 transitions. [2024-11-16 09:57:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 09:57:58,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:58,499 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:57:58,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 09:57:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:57:58,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:58,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1105786363, now seen corresponding path program 1 times [2024-11-16 09:57:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:58,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683553342] [2024-11-16 09:57:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:57:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:57:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:57:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:57:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 09:57:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 09:57:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 09:57:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:57:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 09:57:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-16 09:57:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683553342] [2024-11-16 09:57:58,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683553342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:57:58,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899657356] [2024-11-16 09:57:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:58,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:57:58,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:58,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:57:58,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 09:57:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:58,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 09:57:58,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:57:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-16 09:57:58,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:57:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899657356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:57:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 09:57:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614807012] [2024-11-16 09:57:58,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:58,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:57:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:58,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:57:58,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:58,940 INFO L87 Difference]: Start difference. First operand 6321 states and 7899 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 09:57:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:59,660 INFO L93 Difference]: Finished difference Result 9706 states and 12195 transitions. [2024-11-16 09:57:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:57:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2024-11-16 09:57:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:59,710 INFO L225 Difference]: With dead ends: 9706 [2024-11-16 09:57:59,710 INFO L226 Difference]: Without dead ends: 6549 [2024-11-16 09:57:59,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:59,719 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 257 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:59,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 495 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:57:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2024-11-16 09:58:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 6299. [2024-11-16 09:58:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5133 states have (on average 1.2320280537697252) internal successors, (6324), 5205 states have internal predecessors, (6324), 634 states have call successors, (634), 437 states have call predecessors, (634), 530 states have return successors, (853), 665 states have call predecessors, (853), 630 states have call successors, (853) [2024-11-16 09:58:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 7811 transitions. [2024-11-16 09:58:00,335 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 7811 transitions. Word has length 155 [2024-11-16 09:58:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:00,335 INFO L471 AbstractCegarLoop]: Abstraction has 6299 states and 7811 transitions. [2024-11-16 09:58:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 09:58:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 7811 transitions. [2024-11-16 09:58:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-16 09:58:00,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:00,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:58:00,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 09:58:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:00,546 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -94508271, now seen corresponding path program 1 times [2024-11-16 09:58:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299368189] [2024-11-16 09:58:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 09:58:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 09:58:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 09:58:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 09:58:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-16 09:58:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299368189] [2024-11-16 09:58:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299368189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57984194] [2024-11-16 09:58:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:00,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:00,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:00,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:00,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 09:58:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:00,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:58:00,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 09:58:00,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:58:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57984194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:58:00,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:58:00,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 09:58:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580486434] [2024-11-16 09:58:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:00,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:58:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:58:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:58:00,732 INFO L87 Difference]: Start difference. First operand 6299 states and 7811 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 09:58:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:01,221 INFO L93 Difference]: Finished difference Result 13008 states and 16218 transitions. [2024-11-16 09:58:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:58:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 156 [2024-11-16 09:58:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:01,246 INFO L225 Difference]: With dead ends: 13008 [2024-11-16 09:58:01,247 INFO L226 Difference]: Without dead ends: 8957 [2024-11-16 09:58:01,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:58:01,257 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 131 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:01,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 747 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:58:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2024-11-16 09:58:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8952. [2024-11-16 09:58:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8952 states, 7320 states have (on average 1.2222677595628415) internal successors, (8947), 7428 states have internal predecessors, (8947), 884 states have call successors, (884), 619 states have call predecessors, (884), 746 states have return successors, (1195), 921 states have call predecessors, (1195), 880 states have call successors, (1195) [2024-11-16 09:58:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 11026 transitions. [2024-11-16 09:58:01,887 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 11026 transitions. Word has length 156 [2024-11-16 09:58:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:01,887 INFO L471 AbstractCegarLoop]: Abstraction has 8952 states and 11026 transitions. [2024-11-16 09:58:01,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 09:58:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 11026 transitions. [2024-11-16 09:58:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 09:58:01,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:01,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:01,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 09:58:02,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:02,097 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:02,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash -79479520, now seen corresponding path program 1 times [2024-11-16 09:58:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507609749] [2024-11-16 09:58:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:02,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 09:58:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 09:58:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 09:58:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 09:58:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-16 09:58:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507609749] [2024-11-16 09:58:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507609749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395839907] [2024-11-16 09:58:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:02,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:02,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:02,182 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:02,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 09:58:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:02,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 09:58:02,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 09:58:02,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:58:02,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395839907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:58:02,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:58:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 09:58:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669121917] [2024-11-16 09:58:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:02,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:58:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:58:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:58:02,315 INFO L87 Difference]: Start difference. First operand 8952 states and 11026 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 09:58:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:02,792 INFO L93 Difference]: Finished difference Result 11907 states and 14812 transitions. [2024-11-16 09:58:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:58:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 157 [2024-11-16 09:58:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:02,814 INFO L225 Difference]: With dead ends: 11907 [2024-11-16 09:58:02,814 INFO L226 Difference]: Without dead ends: 8975 [2024-11-16 09:58:02,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:58:02,822 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 94 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:02,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 739 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:58:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2024-11-16 09:58:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8944. [2024-11-16 09:58:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8944 states, 7312 states have (on average 1.213347921225383) internal successors, (8872), 7420 states have internal predecessors, (8872), 884 states have call successors, (884), 619 states have call predecessors, (884), 746 states have return successors, (1195), 921 states have call predecessors, (1195), 880 states have call successors, (1195) [2024-11-16 09:58:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 10951 transitions. [2024-11-16 09:58:03,447 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 10951 transitions. Word has length 157 [2024-11-16 09:58:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 8944 states and 10951 transitions. [2024-11-16 09:58:03,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 09:58:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 10951 transitions. [2024-11-16 09:58:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 09:58:03,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:03,456 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:03,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 09:58:03,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:03,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash 736603363, now seen corresponding path program 1 times [2024-11-16 09:58:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604741639] [2024-11-16 09:58:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 09:58:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 09:58:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 09:58:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 09:58:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 09:58:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604741639] [2024-11-16 09:58:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604741639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289588206] [2024-11-16 09:58:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:03,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:03,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:03,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:03,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 09:58:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:03,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 09:58:03,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 09:58:03,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:58:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289588206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:58:03,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:58:03,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-16 09:58:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003372741] [2024-11-16 09:58:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:03,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:58:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:58:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:58:03,886 INFO L87 Difference]: Start difference. First operand 8944 states and 10951 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 09:58:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:04,515 INFO L93 Difference]: Finished difference Result 11575 states and 14286 transitions. [2024-11-16 09:58:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:58:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 158 [2024-11-16 09:58:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:04,537 INFO L225 Difference]: With dead ends: 11575 [2024-11-16 09:58:04,537 INFO L226 Difference]: Without dead ends: 7277 [2024-11-16 09:58:04,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:58:04,548 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 359 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:04,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 515 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:58:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2024-11-16 09:58:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 7253. [2024-11-16 09:58:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7253 states, 5919 states have (on average 1.1934448386551781) internal successors, (7064), 5995 states have internal predecessors, (7064), 730 states have call successors, (730), 505 states have call predecessors, (730), 602 states have return successors, (935), 761 states have call predecessors, (935), 726 states have call successors, (935) [2024-11-16 09:58:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7253 states to 7253 states and 8729 transitions. [2024-11-16 09:58:05,166 INFO L78 Accepts]: Start accepts. Automaton has 7253 states and 8729 transitions. Word has length 158 [2024-11-16 09:58:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:05,166 INFO L471 AbstractCegarLoop]: Abstraction has 7253 states and 8729 transitions. [2024-11-16 09:58:05,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 09:58:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7253 states and 8729 transitions. [2024-11-16 09:58:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 09:58:05,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:05,173 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:05,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 09:58:05,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-16 09:58:05,374 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1167520164, now seen corresponding path program 1 times [2024-11-16 09:58:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491612259] [2024-11-16 09:58:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 09:58:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 09:58:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 09:58:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 09:58:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 09:58:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491612259] [2024-11-16 09:58:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491612259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138700246] [2024-11-16 09:58:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:05,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:05,465 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:05,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 09:58:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:05,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 09:58:05,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 09:58:05,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:58:05,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138700246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:58:05,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:58:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-16 09:58:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913588175] [2024-11-16 09:58:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:58:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:58:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:58:05,616 INFO L87 Difference]: Start difference. First operand 7253 states and 8729 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 09:58:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:06,615 INFO L93 Difference]: Finished difference Result 11100 states and 13529 transitions. [2024-11-16 09:58:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 09:58:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 158 [2024-11-16 09:58:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:06,637 INFO L225 Difference]: With dead ends: 11100 [2024-11-16 09:58:06,637 INFO L226 Difference]: Without dead ends: 6579 [2024-11-16 09:58:06,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-16 09:58:06,648 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 394 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:06,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 508 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:58:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-11-16 09:58:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 5181. [2024-11-16 09:58:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 4211 states have (on average 1.1714557112324864) internal successors, (4933), 4265 states have internal predecessors, (4933), 530 states have call successors, (530), 359 states have call predecessors, (530), 438 states have return successors, (681), 561 states have call predecessors, (681), 526 states have call successors, (681) [2024-11-16 09:58:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 6144 transitions. [2024-11-16 09:58:07,337 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 6144 transitions. Word has length 158 [2024-11-16 09:58:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 6144 transitions. [2024-11-16 09:58:07,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 09:58:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 6144 transitions. [2024-11-16 09:58:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 09:58:07,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:07,342 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:07,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-16 09:58:07,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-16 09:58:07,543 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:07,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:07,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2005167933, now seen corresponding path program 1 times [2024-11-16 09:58:07,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:07,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436140670] [2024-11-16 09:58:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 09:58:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 09:58:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 09:58:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 09:58:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 09:58:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:07,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436140670] [2024-11-16 09:58:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436140670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164199500] [2024-11-16 09:58:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:07,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:07,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:07,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 09:58:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:07,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 09:58:07,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 09:58:07,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:58:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-16 09:58:07,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164199500] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:07,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 09:58:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 9 [2024-11-16 09:58:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50942061] [2024-11-16 09:58:07,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:07,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:58:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:58:07,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:58:07,931 INFO L87 Difference]: Start difference. First operand 5181 states and 6144 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 09:58:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:08,501 INFO L93 Difference]: Finished difference Result 7103 states and 8367 transitions. [2024-11-16 09:58:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:58:08,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 158 [2024-11-16 09:58:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:08,518 INFO L225 Difference]: With dead ends: 7103 [2024-11-16 09:58:08,518 INFO L226 Difference]: Without dead ends: 5486 [2024-11-16 09:58:08,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:58:08,522 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 391 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:08,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 757 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:58:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5486 states. [2024-11-16 09:58:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5486 to 5461. [2024-11-16 09:58:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5461 states, 4439 states have (on average 1.1608470376210858) internal successors, (5153), 4495 states have internal predecessors, (5153), 560 states have call successors, (560), 379 states have call predecessors, (560), 460 states have return successors, (716), 591 states have call predecessors, (716), 556 states have call successors, (716) [2024-11-16 09:58:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 6429 transitions. [2024-11-16 09:58:08,966 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 6429 transitions. Word has length 158 [2024-11-16 09:58:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:08,967 INFO L471 AbstractCegarLoop]: Abstraction has 5461 states and 6429 transitions. [2024-11-16 09:58:08,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 09:58:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 6429 transitions. [2024-11-16 09:58:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 09:58:08,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:08,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:08,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-16 09:58:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-16 09:58:09,175 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:09,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1259213099, now seen corresponding path program 1 times [2024-11-16 09:58:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106812141] [2024-11-16 09:58:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 09:58:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 09:58:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 09:58:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 09:58:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 09:58:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106812141] [2024-11-16 09:58:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106812141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061528833] [2024-11-16 09:58:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:09,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:09,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:09,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-16 09:58:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:09,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:58:09,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-16 09:58:09,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:58:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061528833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:58:09,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:58:09,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 09:58:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786611788] [2024-11-16 09:58:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:09,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:58:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:09,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:58:09,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:58:09,394 INFO L87 Difference]: Start difference. First operand 5461 states and 6429 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 09:58:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:09,776 INFO L93 Difference]: Finished difference Result 6624 states and 7778 transitions. [2024-11-16 09:58:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:58:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 162 [2024-11-16 09:58:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:09,809 INFO L225 Difference]: With dead ends: 6624 [2024-11-16 09:58:09,810 INFO L226 Difference]: Without dead ends: 5463 [2024-11-16 09:58:09,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:58:09,814 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:09,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:58:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2024-11-16 09:58:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5463. [2024-11-16 09:58:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5463 states, 4441 states have (on average 1.1607746003152444) internal successors, (5155), 4497 states have internal predecessors, (5155), 560 states have call successors, (560), 379 states have call predecessors, (560), 460 states have return successors, (716), 591 states have call predecessors, (716), 556 states have call successors, (716) [2024-11-16 09:58:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6431 transitions. [2024-11-16 09:58:10,249 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6431 transitions. Word has length 162 [2024-11-16 09:58:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:10,250 INFO L471 AbstractCegarLoop]: Abstraction has 5463 states and 6431 transitions. [2024-11-16 09:58:10,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 09:58:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6431 transitions. [2024-11-16 09:58:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 09:58:10,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:10,253 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:10,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-16 09:58:10,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-16 09:58:10,454 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash 467011895, now seen corresponding path program 1 times [2024-11-16 09:58:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793049101] [2024-11-16 09:58:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:58:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 09:58:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 09:58:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 09:58:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 09:58:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 09:58:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 09:58:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 09:58:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:58:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 09:58:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 09:58:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:58:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793049101] [2024-11-16 09:58:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793049101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:58:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996097795] [2024-11-16 09:58:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:10,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:58:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:58:10,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:58:10,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-16 09:58:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:58:10,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 09:58:10,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:58:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 09:58:10,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:58:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996097795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:58:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:58:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-16 09:58:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212033400] [2024-11-16 09:58:10,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:58:10,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:58:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:58:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:58:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:58:10,662 INFO L87 Difference]: Start difference. First operand 5463 states and 6431 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-16 09:58:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:58:11,045 INFO L93 Difference]: Finished difference Result 7314 states and 8580 transitions. [2024-11-16 09:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:58:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 163 [2024-11-16 09:58:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:58:11,061 INFO L225 Difference]: With dead ends: 7314 [2024-11-16 09:58:11,061 INFO L226 Difference]: Without dead ends: 3096 [2024-11-16 09:58:11,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:58:11,067 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:58:11,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1238 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:58:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2024-11-16 09:58:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2024-11-16 09:58:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2484 states have (on average 1.179951690821256) internal successors, (2931), 2518 states have internal predecessors, (2931), 325 states have call successors, (325), 220 states have call predecessors, (325), 285 states have return successors, (430), 359 states have call predecessors, (430), 322 states have call successors, (430) [2024-11-16 09:58:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3686 transitions. [2024-11-16 09:58:11,327 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3686 transitions. Word has length 163 [2024-11-16 09:58:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:58:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 3686 transitions. [2024-11-16 09:58:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-16 09:58:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3686 transitions. [2024-11-16 09:58:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 09:58:11,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:58:11,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:58:11,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-16 09:58:11,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-16 09:58:11,534 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:58:11,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:58:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash -910598343, now seen corresponding path program 1 times [2024-11-16 09:58:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:58:11,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272219992] [2024-11-16 09:58:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:58:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:58:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:58:11,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 09:58:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:58:11,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 09:58:11,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 09:58:11,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 09:58:11,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 09:58:11,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 09:58:11,603 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-11-16 09:58:11,726 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 09:58:11,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:58:11 BoogieIcfgContainer [2024-11-16 09:58:11,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 09:58:11,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 09:58:11,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 09:58:11,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 09:58:11,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:35" (3/4) ... [2024-11-16 09:58:11,730 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 09:58:11,829 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 09:58:11,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 09:58:11,829 INFO L158 Benchmark]: Toolchain (without parser) took 38184.64ms. Allocated memory was 130.0MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 64.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.88ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 64.3MB in the beginning and 139.2MB in the end (delta: -74.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.11ms. Allocated memory is still 184.5MB. Free memory was 139.2MB in the beginning and 136.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: Boogie Preprocessor took 73.21ms. Allocated memory is still 184.5MB. Free memory was 136.2MB in the beginning and 133.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: IcfgBuilder took 681.12ms. Allocated memory is still 184.5MB. Free memory was 133.5MB in the beginning and 98.5MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: TraceAbstraction took 36599.59ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 97.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-16 09:58:11,830 INFO L158 Benchmark]: Witness Printer took 100.03ms. Allocated memory is still 4.4GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 09:58:11,835 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.13ms. Allocated memory is still 130.0MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.88ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 64.3MB in the beginning and 139.2MB in the end (delta: -74.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.11ms. Allocated memory is still 184.5MB. Free memory was 139.2MB in the beginning and 136.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.21ms. Allocated memory is still 184.5MB. Free memory was 136.2MB in the beginning and 133.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 681.12ms. Allocated memory is still 184.5MB. Free memory was 133.5MB in the beginning and 98.5MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 36599.59ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 97.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 100.03ms. Allocated memory is still 4.4GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=0, t1_pc=0, t1_st=0, t=0, token=0] [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1012] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L850] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L855] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L860] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L865] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1014] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1015] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L725] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L727] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L744] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L746] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1015] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1016] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L878] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L883] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L888] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L893] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1016] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1019] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L801] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L776] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L792] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=1, t=0, token=0] [L690] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=1, t=0, token=0] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L831] RET transmit1() [L801] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L776] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L792] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=0, token=0] [L634] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=0, token=0] [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L932] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L725] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L727] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L734] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L746] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, token=0] [L932] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, token=0] [L640] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, tmp_var=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=0] [L682] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=0] [L698] token += 1 [L699] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L700] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L932] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L715] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L727] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L734] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L735] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L744] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L746] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L932] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L700] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L701] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L690] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L831] RET transmit1() [L801] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L804] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L776] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L792] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L804] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L626] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L653] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L659] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L660] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L662] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L599] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 267 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 36.4s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15664 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15347 mSDsluCounter, 26306 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18376 mSDsCounter, 3010 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13899 IncrementalHoareTripleChecker+Invalid, 16909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3010 mSolverCounterUnsat, 7930 mSDtfsCounter, 13899 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2802 GetRequests, 2459 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8952occurred in iteration=21, InterpolantAutomatonStates: 286, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 4044 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 4911 NumberOfCodeBlocks, 4818 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4866 ConstructedInterpolants, 0 QuantifiedInterpolants, 7375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5087 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 40 InterpolantComputations, 27 PerfectInterpolantSequences, 1867/2115 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-11-16 09:58:11,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE