./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU --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 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:16:26,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:16:26,120 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:16:26,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:16:26,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:16:26,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:16:26,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:16:26,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:16:26,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:16:26,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:16:26,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:16:26,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:16:26,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:16:26,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:16:26,173 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:16:26,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:16:26,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:16:26,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:16:26,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:16:26,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:16:26,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:16:26,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:16:26,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:16:26,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:16:26,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:16:26,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:16:26,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:16:26,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:16:26,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:16:26,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:16:26,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:16:26,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:16:26,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:16:26,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:16:26,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:16:26,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:16:26,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:16:26,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:16:26,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:16:26,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:16:26,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:16:26,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:16:26,189 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2024-10-31 22:16:26,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:16:26,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:16:26,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:16:26,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:16:26,621 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:16:26,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c Unable to find full path for "g++" [2024-10-31 22:16:29,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:16:29,394 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:16:29,394 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-10-31 22:16:29,419 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/data/3de0c05e4/b0d58542614f4787a32f61bd69fa933e/FLAGee469b7e9 [2024-10-31 22:16:29,441 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/data/3de0c05e4/b0d58542614f4787a32f61bd69fa933e [2024-10-31 22:16:29,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:16:29,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:16:29,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:16:29,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:16:29,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:16:29,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:29,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8088a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29, skipping insertion in model container [2024-10-31 22:16:29,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:29,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:16:29,726 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-10-31 22:16:29,796 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-10-31 22:16:29,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:16:29,856 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:16:29,870 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-10-31 22:16:29,901 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-10-31 22:16:29,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:16:29,953 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:16:29,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29 WrapperNode [2024-10-31 22:16:29,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:16:29,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:16:29,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:16:29,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:16:29,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:29,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,016 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 409 [2024-10-31 22:16:30,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:16:30,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:16:30,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:16:30,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:16:30,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,055 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:16:30,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:16:30,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:16:30,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:16:30,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:16:30,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (1/1) ... [2024-10-31 22:16:30,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:16:30,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:16:30,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:16:30,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:16:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:16:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-31 22:16:30,159 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-31 22:16:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-31 22:16:30,159 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-31 22:16:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-31 22:16:30,160 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-31 22:16:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-31 22:16:30,160 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-31 22:16:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-31 22:16:30,160 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-31 22:16:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-31 22:16:30,161 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-31 22:16:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-31 22:16:30,161 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-31 22:16:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-31 22:16:30,161 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-31 22:16:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-31 22:16:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-31 22:16:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-31 22:16:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-31 22:16:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-31 22:16:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-31 22:16:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:16:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-31 22:16:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-31 22:16:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-31 22:16:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-31 22:16:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:16:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:16:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-31 22:16:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-31 22:16:30,271 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:16:30,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:16:30,838 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-31 22:16:30,838 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:16:30,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:16:30,878 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-31 22:16:30,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:30 BoogieIcfgContainer [2024-10-31 22:16:30,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:16:30,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:16:30,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:16:30,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:16:30,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:16:29" (1/3) ... [2024-10-31 22:16:30,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18218200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:16:30, skipping insertion in model container [2024-10-31 22:16:30,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:29" (2/3) ... [2024-10-31 22:16:30,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18218200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:16:30, skipping insertion in model container [2024-10-31 22:16:30,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:30" (3/3) ... [2024-10-31 22:16:30,890 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-10-31 22:16:30,906 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:16:30,906 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:16:30,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:16:30,996 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;@7db3ccdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:16:30,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 22:16:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 164 states have (on average 1.524390243902439) internal successors, (250), 171 states have internal predecessors, (250), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 22:16:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:31,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:31,018 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] [2024-10-31 22:16:31,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash 550227357, now seen corresponding path program 1 times [2024-10-31 22:16:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501128227] [2024-10-31 22:16:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:16:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:16:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:16:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:16:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:16:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:16:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:16:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501128227] [2024-10-31 22:16:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501128227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:31,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:31,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:16:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506761864] [2024-10-31 22:16:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:31,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:16:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:16:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:16:31,872 INFO L87 Difference]: Start difference. First operand has 211 states, 164 states have (on average 1.524390243902439) internal successors, (250), 171 states have internal predecessors, (250), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-10-31 22:16:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:16:33,219 INFO L93 Difference]: Finished difference Result 541 states and 802 transitions. [2024-10-31 22:16:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:16:33,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-31 22:16:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:16:33,241 INFO L225 Difference]: With dead ends: 541 [2024-10-31 22:16:33,241 INFO L226 Difference]: Without dead ends: 337 [2024-10-31 22:16:33,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:16:33,255 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 553 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:16:33,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 721 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 22:16:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-31 22:16:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 297. [2024-10-31 22:16:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.4094827586206897) internal successors, (327), 239 states have internal predecessors, (327), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-31 22:16:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 411 transitions. [2024-10-31 22:16:33,358 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 411 transitions. Word has length 59 [2024-10-31 22:16:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:16:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 411 transitions. [2024-10-31 22:16:33,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-10-31 22:16:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 411 transitions. [2024-10-31 22:16:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:33,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:33,363 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] [2024-10-31 22:16:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:16:33,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1312876988, now seen corresponding path program 1 times [2024-10-31 22:16:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307860344] [2024-10-31 22:16:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:16:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:16:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:16:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:16:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:16:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:16:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:16:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:33,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-10-31 22:16:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307860344] [2024-10-31 22:16:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307860344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:16:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388530390] [2024-10-31 22:16:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:33,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:16:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:16:33,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:16:33,629 INFO L87 Difference]: Start difference. First operand 297 states and 411 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-10-31 22:16:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:16:34,921 INFO L93 Difference]: Finished difference Result 646 states and 890 transitions. [2024-10-31 22:16:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:16:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-31 22:16:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:16:34,926 INFO L225 Difference]: With dead ends: 646 [2024-10-31 22:16:34,927 INFO L226 Difference]: Without dead ends: 468 [2024-10-31 22:16:34,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:16:34,931 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 719 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:16:34,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 936 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 22:16:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-31 22:16:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 393. [2024-10-31 22:16:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 308 states have (on average 1.3993506493506493) internal successors, (431), 317 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2024-10-31 22:16:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 545 transitions. [2024-10-31 22:16:35,000 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 545 transitions. Word has length 59 [2024-10-31 22:16:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:16:35,001 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 545 transitions. [2024-10-31 22:16:35,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-10-31 22:16:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 545 transitions. [2024-10-31 22:16:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:35,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:35,010 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] [2024-10-31 22:16:35,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:16:35,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2088603970, now seen corresponding path program 1 times [2024-10-31 22:16:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:35,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840915229] [2024-10-31 22:16:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:16:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:16:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:16:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:16:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:16:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:16:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:16:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:35,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840915229] [2024-10-31 22:16:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840915229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:16:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565019682] [2024-10-31 22:16:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:35,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:16:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:16:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:16:35,299 INFO L87 Difference]: Start difference. First operand 393 states and 545 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-10-31 22:16:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:16:36,233 INFO L93 Difference]: Finished difference Result 693 states and 957 transitions. [2024-10-31 22:16:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:16:36,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-31 22:16:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:16:36,238 INFO L225 Difference]: With dead ends: 693 [2024-10-31 22:16:36,239 INFO L226 Difference]: Without dead ends: 425 [2024-10-31 22:16:36,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:16:36,241 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 208 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:16:36,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1129 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:16:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-31 22:16:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 398. [2024-10-31 22:16:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 312 states have (on average 1.3878205128205128) internal successors, (433), 321 states have internal predecessors, (433), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2024-10-31 22:16:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 548 transitions. [2024-10-31 22:16:36,302 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 548 transitions. Word has length 59 [2024-10-31 22:16:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:16:36,303 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 548 transitions. [2024-10-31 22:16:36,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-10-31 22:16:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 548 transitions. [2024-10-31 22:16:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:36,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:36,306 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] [2024-10-31 22:16:36,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:16:36,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:36,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1813844356, now seen corresponding path program 1 times [2024-10-31 22:16:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152131001] [2024-10-31 22:16:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:16:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:16:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:16:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:16:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:16:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:16:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:16:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:36,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152131001] [2024-10-31 22:16:36,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152131001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:36,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:16:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453133558] [2024-10-31 22:16:36,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:16:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:36,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:16:36,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:16:36,501 INFO L87 Difference]: Start difference. First operand 398 states and 548 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:16:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:16:38,905 INFO L93 Difference]: Finished difference Result 2066 states and 2826 transitions. [2024-10-31 22:16:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-31 22:16:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2024-10-31 22:16:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:16:38,934 INFO L225 Difference]: With dead ends: 2066 [2024-10-31 22:16:38,935 INFO L226 Difference]: Without dead ends: 1793 [2024-10-31 22:16:38,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-31 22:16:38,947 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1378 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:16:38,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 1280 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-31 22:16:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-10-31 22:16:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1535. [2024-10-31 22:16:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1209 states have (on average 1.3300248138957815) internal successors, (1608), 1238 states have internal predecessors, (1608), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2024-10-31 22:16:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2026 transitions. [2024-10-31 22:16:39,230 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2026 transitions. Word has length 59 [2024-10-31 22:16:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:16:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2026 transitions. [2024-10-31 22:16:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:16:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2026 transitions. [2024-10-31 22:16:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:39,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:39,238 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] [2024-10-31 22:16:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:16:39,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:39,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1509448253, now seen corresponding path program 1 times [2024-10-31 22:16:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057560187] [2024-10-31 22:16:39,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:16:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:16:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:16:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:16:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:16:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:16:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:16:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057560187] [2024-10-31 22:16:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057560187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:39,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:39,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:16:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237891350] [2024-10-31 22:16:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:16:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:16:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:16:39,455 INFO L87 Difference]: Start difference. First operand 1535 states and 2026 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-10-31 22:16:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:16:40,477 INFO L93 Difference]: Finished difference Result 3130 states and 4140 transitions. [2024-10-31 22:16:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:16:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-31 22:16:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:16:40,488 INFO L225 Difference]: With dead ends: 3130 [2024-10-31 22:16:40,488 INFO L226 Difference]: Without dead ends: 1720 [2024-10-31 22:16:40,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:16:40,493 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 308 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:16:40,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1009 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:16:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-31 22:16:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1580. [2024-10-31 22:16:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1245 states have (on average 1.3132530120481927) internal successors, (1635), 1274 states have internal predecessors, (1635), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2024-10-31 22:16:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2065 transitions. [2024-10-31 22:16:40,683 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2065 transitions. Word has length 59 [2024-10-31 22:16:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:16:40,684 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2065 transitions. [2024-10-31 22:16:40,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-10-31 22:16:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2065 transitions. [2024-10-31 22:16:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:40,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:40,687 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] [2024-10-31 22:16:40,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:16:40,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:40,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash -295990081, now seen corresponding path program 1 times [2024-10-31 22:16:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:40,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161338214] [2024-10-31 22:16:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:40,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:16:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:16:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:16:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:16:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:16:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:16:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:16:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:40,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:40,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161338214] [2024-10-31 22:16:40,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161338214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:40,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:40,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:16:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398594010] [2024-10-31 22:16:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:40,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:16:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:40,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:16:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:16:40,920 INFO L87 Difference]: Start difference. First operand 1580 states and 2065 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-10-31 22:16:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:16:42,156 INFO L93 Difference]: Finished difference Result 3015 states and 3902 transitions. [2024-10-31 22:16:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:16:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-31 22:16:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:16:42,167 INFO L225 Difference]: With dead ends: 3015 [2024-10-31 22:16:42,168 INFO L226 Difference]: Without dead ends: 1779 [2024-10-31 22:16:42,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:16:42,172 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 692 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:16:42,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 702 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:16:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2024-10-31 22:16:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1558. [2024-10-31 22:16:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1231 states have (on average 1.3086921202274573) internal successors, (1611), 1254 states have internal predecessors, (1611), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2024-10-31 22:16:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2025 transitions. [2024-10-31 22:16:42,343 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2025 transitions. Word has length 59 [2024-10-31 22:16:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:16:42,345 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2025 transitions. [2024-10-31 22:16:42,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-10-31 22:16:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2025 transitions. [2024-10-31 22:16:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:16:42,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:16:42,350 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] [2024-10-31 22:16:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:16:42,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:16:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2004832509, now seen corresponding path program 1 times [2024-10-31 22:16:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071535531] [2024-10-31 22:16:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:16:42,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:16:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:16:42,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:16:42,419 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:16:42,421 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-31 22:16:42,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-31 22:16:42,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:16:42,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:42,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:16:42,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:16:42 BoogieIcfgContainer [2024-10-31 22:16:42,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:16:42,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:16:42,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:16:42,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:16:42,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:30" (3/4) ... [2024-10-31 22:16:42,554 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:16:42,663 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:16:42,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:16:42,664 INFO L158 Benchmark]: Toolchain (without parser) took 13217.54ms. Allocated memory was 153.1MB in the beginning and 262.1MB in the end (delta: 109.1MB). Free memory was 113.7MB in the beginning and 165.6MB in the end (delta: -51.9MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,664 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 153.1MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:16:42,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.49ms. Allocated memory is still 153.1MB. Free memory was 113.3MB in the beginning and 94.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.22ms. Allocated memory is still 153.1MB. Free memory was 94.5MB in the beginning and 91.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,665 INFO L158 Benchmark]: Boogie Preprocessor took 63.07ms. Allocated memory is still 153.1MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,666 INFO L158 Benchmark]: RCFGBuilder took 797.37ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 88.5MB in the beginning and 186.6MB in the end (delta: -98.1MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,670 INFO L158 Benchmark]: TraceAbstraction took 11668.62ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 185.6MB in the beginning and 175.0MB in the end (delta: 10.6MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,670 INFO L158 Benchmark]: Witness Printer took 111.44ms. Allocated memory is still 262.1MB. Free memory was 175.0MB in the beginning and 165.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 22:16:42,672 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.33ms. Allocated memory is still 153.1MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.49ms. Allocated memory is still 153.1MB. Free memory was 113.3MB in the beginning and 94.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.22ms. Allocated memory is still 153.1MB. Free memory was 94.5MB in the beginning and 91.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.07ms. Allocated memory is still 153.1MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 797.37ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 88.5MB in the beginning and 186.6MB in the end (delta: -98.1MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11668.62ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 185.6MB in the beginning and 175.0MB in the end (delta: 10.6MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Witness Printer took 111.44ms. Allocated memory is still 262.1MB. Free memory was 175.0MB in the beginning and 165.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] 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, 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, t1_i=0, t1_pc=0, t1_st=0, token=0] [L962] COND TRUE __VERIFIER_nondet_int() [L963] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L85] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L104] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L367] CALL error1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] - UnprovableResult [Line: 496]: 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 15 procedures, 211 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3918 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3858 mSDsluCounter, 5777 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4551 mSDsCounter, 1011 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5034 IncrementalHoareTripleChecker+Invalid, 6045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1011 mSolverCounterUnsat, 1226 mSDtfsCounter, 5034 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1580occurred in iteration=5, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 6 MinimizatonAttempts, 761 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-31 22:16:42,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca56db1-9f32-4b19-9080-42067cfde51f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE