./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya --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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:06:44,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:06:45,032 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:06:45,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:06:45,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:06:45,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:06:45,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:06:45,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:06:45,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:06:45,068 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:06:45,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:06:45,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:06:45,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:06:45,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:06:45,071 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:06:45,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:06:45,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:06:45,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:06:45,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:06:45,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:06:45,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:06:45,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:06:45,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:06:45,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:06:45,078 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:06:45,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:06:45,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:06:45,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:06:45,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:06:45,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:06:45,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:06:45,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:06:45,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:06:45,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:06:45,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:06:45,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:06:45,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:06:45,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:06:45,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:06:45,083 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:06:45,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:06:45,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:06:45,084 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_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/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_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2023-11-29 01:06:45,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:06:45,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:06:45,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:06:45,327 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:06:45,327 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:06:45,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-11-29 01:06:48,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:06:48,323 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:06:48,323 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-11-29 01:06:48,336 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/data/5140a16f5/d0aaaf82ebed42d98bed752ce1ccf842/FLAGaf8359f3c [2023-11-29 01:06:48,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/data/5140a16f5/d0aaaf82ebed42d98bed752ce1ccf842 [2023-11-29 01:06:48,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:06:48,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:06:48,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:06:48,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:06:48,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:06:48,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e82494f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48, skipping insertion in model container [2023-11-29 01:06:48,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,410 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:06:48,541 WARN L240 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_3aa70be5-bd04-48b2-82db-7344147f61b8/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2023-11-29 01:06:48,593 WARN L240 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_3aa70be5-bd04-48b2-82db-7344147f61b8/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2023-11-29 01:06:48,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:06:48,640 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:06:48,653 WARN L240 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_3aa70be5-bd04-48b2-82db-7344147f61b8/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2023-11-29 01:06:48,674 WARN L240 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_3aa70be5-bd04-48b2-82db-7344147f61b8/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2023-11-29 01:06:48,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:06:48,708 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:06:48,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48 WrapperNode [2023-11-29 01:06:48,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:06:48,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:06:48,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:06:48,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:06:48,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,758 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 416 [2023-11-29 01:06:48,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:06:48,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:06:48,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:06:48,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:06:48,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,793 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:06:48,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:06:48,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:06:48,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:06:48,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:06:48,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (1/1) ... [2023-11-29 01:06:48,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:06:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:06:48,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:06:48,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:06:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:06:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 01:06:48,884 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 01:06:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 01:06:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 01:06:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 01:06:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 01:06:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 01:06:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 01:06:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 01:06:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 01:06:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 01:06:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 01:06:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 01:06:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 01:06:48,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 01:06:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 01:06:48,887 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 01:06:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 01:06:48,888 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 01:06:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 01:06:48,888 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 01:06:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 01:06:48,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:06:48,888 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 01:06:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 01:06:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 01:06:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 01:06:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:06:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:06:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 01:06:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 01:06:48,890 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-11-29 01:06:48,890 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-11-29 01:06:48,978 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:06:48,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:06:49,451 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:06:49,497 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:06:49,498 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-29 01:06:49,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:06:49 BoogieIcfgContainer [2023-11-29 01:06:49,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:06:49,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:06:49,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:06:49,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:06:49,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:06:48" (1/3) ... [2023-11-29 01:06:49,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b80a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:06:49, skipping insertion in model container [2023-11-29 01:06:49,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:48" (2/3) ... [2023-11-29 01:06:49,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b80a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:06:49, skipping insertion in model container [2023-11-29 01:06:49,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:06:49" (3/3) ... [2023-11-29 01:06:49,508 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-11-29 01:06:49,528 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:06:49,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 01:06:49,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:06:49,583 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50f4ccb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:06:49,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 01:06:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 145 states have (on average 1.6275862068965516) internal successors, (236), 153 states have internal predecessors, (236), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 01:06:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 01:06:49,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:49,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:49,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:49,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1328399088, now seen corresponding path program 1 times [2023-11-29 01:06:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084428036] [2023-11-29 01:06:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:06:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:06:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:06:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:50,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084428036] [2023-11-29 01:06:50,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084428036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:50,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:06:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831870062] [2023-11-29 01:06:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:06:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:06:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:06:50,051 INFO L87 Difference]: Start difference. First operand has 194 states, 145 states have (on average 1.6275862068965516) internal successors, (236), 153 states have internal predecessors, (236), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:50,955 INFO L93 Difference]: Finished difference Result 503 states and 783 transitions. [2023-11-29 01:06:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:06:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-29 01:06:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:50,971 INFO L225 Difference]: With dead ends: 503 [2023-11-29 01:06:50,971 INFO L226 Difference]: Without dead ends: 318 [2023-11-29 01:06:50,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:06:50,980 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 503 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:50,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 542 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:06:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-29 01:06:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 277. [2023-11-29 01:06:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 214 states have (on average 1.5046728971962617) internal successors, (322), 220 states have internal predecessors, (322), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2023-11-29 01:06:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 403 transitions. [2023-11-29 01:06:51,060 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 403 transitions. Word has length 52 [2023-11-29 01:06:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:51,061 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 403 transitions. [2023-11-29 01:06:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 403 transitions. [2023-11-29 01:06:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 01:06:51,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:51,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:51,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:06:51,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:51,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1795400300, now seen corresponding path program 1 times [2023-11-29 01:06:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:51,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688098861] [2023-11-29 01:06:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:51,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:06:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:51,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:06:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:51,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:06:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688098861] [2023-11-29 01:06:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688098861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:06:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74992544] [2023-11-29 01:06:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:51,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:06:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:06:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:06:51,242 INFO L87 Difference]: Start difference. First operand 277 states and 403 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:52,254 INFO L93 Difference]: Finished difference Result 606 states and 889 transitions. [2023-11-29 01:06:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:06:52,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-29 01:06:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:52,263 INFO L225 Difference]: With dead ends: 606 [2023-11-29 01:06:52,264 INFO L226 Difference]: Without dead ends: 424 [2023-11-29 01:06:52,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:06:52,268 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 487 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:52,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 862 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:06:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-11-29 01:06:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2023-11-29 01:06:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 281 states have (on average 1.498220640569395) internal successors, (421), 288 states have internal predecessors, (421), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2023-11-29 01:06:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 524 transitions. [2023-11-29 01:06:52,324 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 524 transitions. Word has length 52 [2023-11-29 01:06:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 524 transitions. [2023-11-29 01:06:52,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 524 transitions. [2023-11-29 01:06:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 01:06:52,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:52,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:06:52,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:52,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2075920274, now seen corresponding path program 1 times [2023-11-29 01:06:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17648273] [2023-11-29 01:06:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:06:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:06:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:06:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:52,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:52,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17648273] [2023-11-29 01:06:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17648273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:52,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:52,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:06:52,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047095332] [2023-11-29 01:06:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:52,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:06:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:06:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:06:52,489 INFO L87 Difference]: Start difference. First operand 361 states and 524 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:53,556 INFO L93 Difference]: Finished difference Result 931 states and 1360 transitions. [2023-11-29 01:06:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:06:53,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-29 01:06:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:53,565 INFO L225 Difference]: With dead ends: 931 [2023-11-29 01:06:53,565 INFO L226 Difference]: Without dead ends: 665 [2023-11-29 01:06:53,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:06:53,569 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 499 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:53,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 853 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:06:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-11-29 01:06:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 526. [2023-11-29 01:06:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 414 states have (on average 1.4927536231884058) internal successors, (618), 423 states have internal predecessors, (618), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2023-11-29 01:06:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 765 transitions. [2023-11-29 01:06:53,630 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 765 transitions. Word has length 52 [2023-11-29 01:06:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:53,630 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 765 transitions. [2023-11-29 01:06:53,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 765 transitions. [2023-11-29 01:06:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 01:06:53,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:53,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:53,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:06:53,634 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:53,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 847239724, now seen corresponding path program 1 times [2023-11-29 01:06:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698451988] [2023-11-29 01:06:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:53,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:53,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:06:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:06:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:06:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698451988] [2023-11-29 01:06:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698451988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:06:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995180905] [2023-11-29 01:06:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:53,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:06:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:06:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:06:53,780 INFO L87 Difference]: Start difference. First operand 526 states and 765 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:55,133 INFO L93 Difference]: Finished difference Result 2364 states and 3544 transitions. [2023-11-29 01:06:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:06:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-29 01:06:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:55,149 INFO L225 Difference]: With dead ends: 2364 [2023-11-29 01:06:55,149 INFO L226 Difference]: Without dead ends: 1934 [2023-11-29 01:06:55,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:06:55,154 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 908 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:55,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 705 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:06:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2023-11-29 01:06:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1614. [2023-11-29 01:06:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1259 states have (on average 1.4360603653693407) internal successors, (1808), 1295 states have internal predecessors, (1808), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2023-11-29 01:06:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2321 transitions. [2023-11-29 01:06:55,304 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2321 transitions. Word has length 52 [2023-11-29 01:06:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:55,304 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2321 transitions. [2023-11-29 01:06:55,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:06:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2321 transitions. [2023-11-29 01:06:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:06:55,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:55,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:55,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:06:55,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:55,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2042303814, now seen corresponding path program 1 times [2023-11-29 01:06:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238827602] [2023-11-29 01:06:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:06:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:06:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:06:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:06:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:06:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238827602] [2023-11-29 01:06:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238827602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:06:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834576540] [2023-11-29 01:06:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:55,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:06:55,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:06:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:06:55,494 INFO L87 Difference]: Start difference. First operand 1614 states and 2321 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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) [2023-11-29 01:06:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:56,265 INFO L93 Difference]: Finished difference Result 1820 states and 2619 transitions. [2023-11-29 01:06:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:06:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2023-11-29 01:06:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:56,301 INFO L225 Difference]: With dead ends: 1820 [2023-11-29 01:06:56,301 INFO L226 Difference]: Without dead ends: 1739 [2023-11-29 01:06:56,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:06:56,304 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 639 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:56,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 614 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:06:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-11-29 01:06:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1702. [2023-11-29 01:06:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1327 states have (on average 1.4355689525244912) internal successors, (1905), 1365 states have internal predecessors, (1905), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2023-11-29 01:06:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2445 transitions. [2023-11-29 01:06:56,502 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2445 transitions. Word has length 58 [2023-11-29 01:06:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:56,502 INFO L495 AbstractCegarLoop]: Abstraction has 1702 states and 2445 transitions. [2023-11-29 01:06:56,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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) [2023-11-29 01:06:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2445 transitions. [2023-11-29 01:06:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:06:56,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:56,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:56,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:06:56,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:56,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1908070150, now seen corresponding path program 1 times [2023-11-29 01:06:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038970507] [2023-11-29 01:06:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:06:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:06:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:06:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:06:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:06:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:56,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038970507] [2023-11-29 01:06:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038970507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:56,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:06:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085486203] [2023-11-29 01:06:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:56,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:06:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:06:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:06:56,662 INFO L87 Difference]: Start difference. First operand 1702 states and 2445 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-11-29 01:06:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:57,721 INFO L93 Difference]: Finished difference Result 2022 states and 2895 transitions. [2023-11-29 01:06:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:06:57,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2023-11-29 01:06:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:57,737 INFO L225 Difference]: With dead ends: 2022 [2023-11-29 01:06:57,737 INFO L226 Difference]: Without dead ends: 1860 [2023-11-29 01:06:57,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:06:57,741 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 513 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:57,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 973 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:06:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2023-11-29 01:06:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1790. [2023-11-29 01:06:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1395 states have (on average 1.4344086021505376) internal successors, (2001), 1435 states have internal predecessors, (2001), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2023-11-29 01:06:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2571 transitions. [2023-11-29 01:06:57,967 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2571 transitions. Word has length 58 [2023-11-29 01:06:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:57,968 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 2571 transitions. [2023-11-29 01:06:57,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-11-29 01:06:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2571 transitions. [2023-11-29 01:06:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:06:57,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:57,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:57,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:06:57,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:57,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash -458624444, now seen corresponding path program 1 times [2023-11-29 01:06:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848745423] [2023-11-29 01:06:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:06:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:06:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:06:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:06:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:06:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:58,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848745423] [2023-11-29 01:06:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848745423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:58,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:06:58,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563838238] [2023-11-29 01:06:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:58,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:06:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:06:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:06:58,117 INFO L87 Difference]: Start difference. First operand 1790 states and 2571 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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) [2023-11-29 01:06:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:58,978 INFO L93 Difference]: Finished difference Result 2066 states and 2960 transitions. [2023-11-29 01:06:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:06:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2023-11-29 01:06:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:58,993 INFO L225 Difference]: With dead ends: 2066 [2023-11-29 01:06:58,993 INFO L226 Difference]: Without dead ends: 1822 [2023-11-29 01:06:58,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:06:58,996 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 201 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:58,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1019 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:06:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2023-11-29 01:06:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1794. [2023-11-29 01:06:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1398 states have (on average 1.4320457796852646) internal successors, (2002), 1438 states have internal predecessors, (2002), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2023-11-29 01:06:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2573 transitions. [2023-11-29 01:06:59,202 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2573 transitions. Word has length 58 [2023-11-29 01:06:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:59,202 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 2573 transitions. [2023-11-29 01:06:59,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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) [2023-11-29 01:06:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2573 transitions. [2023-11-29 01:06:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:06:59,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:59,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:59,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:06:59,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:06:59,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1592359554, now seen corresponding path program 1 times [2023-11-29 01:06:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:06:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329674841] [2023-11-29 01:06:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:06:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:06:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:06:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:06:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:06:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:06:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:06:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:06:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:59,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:59,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329674841] [2023-11-29 01:06:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329674841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:06:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313268058] [2023-11-29 01:06:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:59,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:06:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:59,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:06:59,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:06:59,359 INFO L87 Difference]: Start difference. First operand 1794 states and 2573 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:07:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:01,140 INFO L93 Difference]: Finished difference Result 3018 states and 4271 transitions. [2023-11-29 01:07:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:07:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-11-29 01:07:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:01,158 INFO L225 Difference]: With dead ends: 3018 [2023-11-29 01:07:01,159 INFO L226 Difference]: Without dead ends: 2752 [2023-11-29 01:07:01,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 01:07:01,162 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 1824 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:01,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 1041 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:07:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2023-11-29 01:07:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2629. [2023-11-29 01:07:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2047 states have (on average 1.404494382022472) internal successors, (2875), 2102 states have internal predecessors, (2875), 320 states have call successors, (320), 226 states have call predecessors, (320), 260 states have return successors, (453), 306 states have call predecessors, (453), 316 states have call successors, (453) [2023-11-29 01:07:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3648 transitions. [2023-11-29 01:07:01,458 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3648 transitions. Word has length 58 [2023-11-29 01:07:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:01,459 INFO L495 AbstractCegarLoop]: Abstraction has 2629 states and 3648 transitions. [2023-11-29 01:07:01,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:07:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3648 transitions. [2023-11-29 01:07:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:07:01,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:01,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:01,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:07:01,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:01,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash 517310348, now seen corresponding path program 1 times [2023-11-29 01:07:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863637981] [2023-11-29 01:07:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:01,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863637981] [2023-11-29 01:07:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863637981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:01,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:01,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:07:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358131718] [2023-11-29 01:07:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:01,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:07:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:07:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:07:01,580 INFO L87 Difference]: Start difference. First operand 2629 states and 3648 transitions. Second operand has 9 states, 8 states have (on average 5.5) 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) [2023-11-29 01:07:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:02,432 INFO L93 Difference]: Finished difference Result 3822 states and 5223 transitions. [2023-11-29 01:07:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:07:02,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) 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 [2023-11-29 01:07:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:02,452 INFO L225 Difference]: With dead ends: 3822 [2023-11-29 01:07:02,452 INFO L226 Difference]: Without dead ends: 2727 [2023-11-29 01:07:02,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:07:02,457 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 203 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:02,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1016 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:07:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2023-11-29 01:07:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2653. [2023-11-29 01:07:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2065 states have (on average 1.397094430992736) internal successors, (2885), 2120 states have internal predecessors, (2885), 320 states have call successors, (320), 226 states have call predecessors, (320), 266 states have return successors, (459), 312 states have call predecessors, (459), 316 states have call successors, (459) [2023-11-29 01:07:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3664 transitions. [2023-11-29 01:07:02,762 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3664 transitions. Word has length 59 [2023-11-29 01:07:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:02,762 INFO L495 AbstractCegarLoop]: Abstraction has 2653 states and 3664 transitions. [2023-11-29 01:07:02,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) 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) [2023-11-29 01:07:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3664 transitions. [2023-11-29 01:07:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:07:02,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:02,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:02,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:07:02,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:02,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1854428914, now seen corresponding path program 1 times [2023-11-29 01:07:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:02,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436509609] [2023-11-29 01:07:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:02,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436509609] [2023-11-29 01:07:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436509609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:02,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:02,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:07:02,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607694271] [2023-11-29 01:07:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:02,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:07:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:07:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:07:02,956 INFO L87 Difference]: Start difference. First operand 2653 states and 3664 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) [2023-11-29 01:07:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:03,914 INFO L93 Difference]: Finished difference Result 3803 states and 5106 transitions. [2023-11-29 01:07:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:07:03,915 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 [2023-11-29 01:07:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:03,930 INFO L225 Difference]: With dead ends: 3803 [2023-11-29 01:07:03,931 INFO L226 Difference]: Without dead ends: 2891 [2023-11-29 01:07:03,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:07:03,934 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 641 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:03,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 629 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:07:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2023-11-29 01:07:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2598. [2023-11-29 01:07:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2026 states have (on average 1.395360315893386) internal successors, (2827), 2076 states have internal predecessors, (2827), 314 states have call successors, (314), 221 states have call predecessors, (314), 256 states have return successors, (444), 305 states have call predecessors, (444), 310 states have call successors, (444) [2023-11-29 01:07:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3585 transitions. [2023-11-29 01:07:04,179 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3585 transitions. Word has length 59 [2023-11-29 01:07:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:04,180 INFO L495 AbstractCegarLoop]: Abstraction has 2598 states and 3585 transitions. [2023-11-29 01:07:04,180 INFO L496 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) [2023-11-29 01:07:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3585 transitions. [2023-11-29 01:07:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:07:04,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:04,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:04,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:07:04,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:04,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1635574196, now seen corresponding path program 1 times [2023-11-29 01:07:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453166608] [2023-11-29 01:07:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:04,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453166608] [2023-11-29 01:07:04,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453166608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:04,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:04,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:07:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591910919] [2023-11-29 01:07:04,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:04,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:07:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:04,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:07:04,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:04,276 INFO L87 Difference]: Start difference. First operand 2598 states and 3585 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 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) [2023-11-29 01:07:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:05,073 INFO L93 Difference]: Finished difference Result 4747 states and 6356 transitions. [2023-11-29 01:07:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:07:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 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 [2023-11-29 01:07:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:05,099 INFO L225 Difference]: With dead ends: 4747 [2023-11-29 01:07:05,099 INFO L226 Difference]: Without dead ends: 3684 [2023-11-29 01:07:05,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:07:05,104 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 503 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:05,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 612 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:07:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2023-11-29 01:07:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3568. [2023-11-29 01:07:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3568 states, 2753 states have (on average 1.3534326189611332) internal successors, (3726), 2820 states have internal predecessors, (3726), 433 states have call successors, (433), 320 states have call predecessors, (433), 380 states have return successors, (635), 433 states have call predecessors, (635), 429 states have call successors, (635) [2023-11-29 01:07:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4794 transitions. [2023-11-29 01:07:05,467 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4794 transitions. Word has length 59 [2023-11-29 01:07:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:05,468 INFO L495 AbstractCegarLoop]: Abstraction has 3568 states and 4794 transitions. [2023-11-29 01:07:05,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 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) [2023-11-29 01:07:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4794 transitions. [2023-11-29 01:07:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 01:07:05,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:05,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:05,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:07:05,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:05,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1520117023, now seen corresponding path program 1 times [2023-11-29 01:07:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406285720] [2023-11-29 01:07:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:05,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406285720] [2023-11-29 01:07:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406285720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:05,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:07:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272466026] [2023-11-29 01:07:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:05,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:07:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:05,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:07:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:05,547 INFO L87 Difference]: Start difference. First operand 3568 states and 4794 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 01:07:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:06,444 INFO L93 Difference]: Finished difference Result 6620 states and 8675 transitions. [2023-11-29 01:07:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:07:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2023-11-29 01:07:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:06,467 INFO L225 Difference]: With dead ends: 6620 [2023-11-29 01:07:06,467 INFO L226 Difference]: Without dead ends: 4592 [2023-11-29 01:07:06,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:07:06,475 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 370 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:06,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 588 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:07:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2023-11-29 01:07:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4334. [2023-11-29 01:07:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 3333 states have (on average 1.336033603360336) internal successors, (4453), 3405 states have internal predecessors, (4453), 525 states have call successors, (525), 400 states have call predecessors, (525), 474 states have return successors, (749), 534 states have call predecessors, (749), 521 states have call successors, (749) [2023-11-29 01:07:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 5727 transitions. [2023-11-29 01:07:06,844 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 5727 transitions. Word has length 60 [2023-11-29 01:07:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:06,844 INFO L495 AbstractCegarLoop]: Abstraction has 4334 states and 5727 transitions. [2023-11-29 01:07:06,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 01:07:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 5727 transitions. [2023-11-29 01:07:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 01:07:06,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:06,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:07:06,847 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:06,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash 475131326, now seen corresponding path program 1 times [2023-11-29 01:07:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011749647] [2023-11-29 01:07:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:06,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:06,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011749647] [2023-11-29 01:07:06,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011749647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:06,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:07:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110068361] [2023-11-29 01:07:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:06,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:07:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:06,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:07:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:06,926 INFO L87 Difference]: Start difference. First operand 4334 states and 5727 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 01:07:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:07,701 INFO L93 Difference]: Finished difference Result 7898 states and 10193 transitions. [2023-11-29 01:07:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:07:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2023-11-29 01:07:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:07,723 INFO L225 Difference]: With dead ends: 7898 [2023-11-29 01:07:07,723 INFO L226 Difference]: Without dead ends: 5102 [2023-11-29 01:07:07,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:07:07,731 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 598 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:07,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 438 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:07:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2023-11-29 01:07:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4838. [2023-11-29 01:07:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4838 states, 3723 states have (on average 1.327692720923986) internal successors, (4943), 3799 states have internal predecessors, (4943), 581 states have call successors, (581), 450 states have call predecessors, (581), 532 states have return successors, (822), 594 states have call predecessors, (822), 577 states have call successors, (822) [2023-11-29 01:07:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 6346 transitions. [2023-11-29 01:07:08,220 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 6346 transitions. Word has length 66 [2023-11-29 01:07:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:08,220 INFO L495 AbstractCegarLoop]: Abstraction has 4838 states and 6346 transitions. [2023-11-29 01:07:08,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 01:07:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 6346 transitions. [2023-11-29 01:07:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 01:07:08,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:08,223 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:08,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:07:08,223 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:08,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1328016874, now seen corresponding path program 1 times [2023-11-29 01:07:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34114166] [2023-11-29 01:07:08,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:08,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34114166] [2023-11-29 01:07:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34114166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:08,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:08,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:07:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683524352] [2023-11-29 01:07:08,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:07:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:07:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:08,311 INFO L87 Difference]: Start difference. First operand 4838 states and 6346 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 01:07:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:09,419 INFO L93 Difference]: Finished difference Result 5846 states and 7563 transitions. [2023-11-29 01:07:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:07:09,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-11-29 01:07:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:09,448 INFO L225 Difference]: With dead ends: 5846 [2023-11-29 01:07:09,449 INFO L226 Difference]: Without dead ends: 5843 [2023-11-29 01:07:09,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:07:09,452 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 856 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:09,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 414 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:07:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5843 states. [2023-11-29 01:07:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5843 to 5258. [2023-11-29 01:07:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5258 states, 4036 states have (on average 1.3173934588701686) internal successors, (5317), 4115 states have internal predecessors, (5317), 631 states have call successors, (631), 494 states have call predecessors, (631), 589 states have return successors, (899), 654 states have call predecessors, (899), 628 states have call successors, (899) [2023-11-29 01:07:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 6847 transitions. [2023-11-29 01:07:09,938 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 6847 transitions. Word has length 67 [2023-11-29 01:07:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:09,939 INFO L495 AbstractCegarLoop]: Abstraction has 5258 states and 6847 transitions. [2023-11-29 01:07:09,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 01:07:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 6847 transitions. [2023-11-29 01:07:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 01:07:09,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:09,941 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:09,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:07:09,941 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:09,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1781806200, now seen corresponding path program 1 times [2023-11-29 01:07:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:09,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302750644] [2023-11-29 01:07:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302750644] [2023-11-29 01:07:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302750644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104721312] [2023-11-29 01:07:10,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:10,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:10,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:07:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:10,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:07:10,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:10,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:07:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104721312] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:07:10,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:07:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-29 01:07:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316764418] [2023-11-29 01:07:10,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:07:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:07:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:07:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:07:10,546 INFO L87 Difference]: Start difference. First operand 5258 states and 6847 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 01:07:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:12,686 INFO L93 Difference]: Finished difference Result 9230 states and 11710 transitions. [2023-11-29 01:07:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 01:07:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2023-11-29 01:07:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:12,716 INFO L225 Difference]: With dead ends: 9230 [2023-11-29 01:07:12,717 INFO L226 Difference]: Without dead ends: 9227 [2023-11-29 01:07:12,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2023-11-29 01:07:12,721 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 1016 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:12,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1075 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:07:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2023-11-29 01:07:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 8375. [2023-11-29 01:07:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8375 states, 6411 states have (on average 1.294649820620808) internal successors, (8300), 6525 states have internal predecessors, (8300), 990 states have call successors, (990), 808 states have call predecessors, (990), 972 states have return successors, (1400), 1047 states have call predecessors, (1400), 987 states have call successors, (1400) [2023-11-29 01:07:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8375 states to 8375 states and 10690 transitions. [2023-11-29 01:07:13,850 INFO L78 Accepts]: Start accepts. Automaton has 8375 states and 10690 transitions. Word has length 68 [2023-11-29 01:07:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:13,850 INFO L495 AbstractCegarLoop]: Abstraction has 8375 states and 10690 transitions. [2023-11-29 01:07:13,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 01:07:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8375 states and 10690 transitions. [2023-11-29 01:07:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 01:07:13,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:13,853 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:13,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:07:14,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:14,054 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:14,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1137729558, now seen corresponding path program 2 times [2023-11-29 01:07:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75525648] [2023-11-29 01:07:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:07:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75525648] [2023-11-29 01:07:14,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75525648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:14,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:14,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:07:14,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035381538] [2023-11-29 01:07:14,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:14,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:07:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:14,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:07:14,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:14,122 INFO L87 Difference]: Start difference. First operand 8375 states and 10690 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 01:07:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:15,175 INFO L93 Difference]: Finished difference Result 10763 states and 13693 transitions. [2023-11-29 01:07:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:07:15,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-11-29 01:07:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:15,186 INFO L225 Difference]: With dead ends: 10763 [2023-11-29 01:07:15,186 INFO L226 Difference]: Without dead ends: 5125 [2023-11-29 01:07:15,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:07:15,194 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 423 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:15,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 591 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:07:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2023-11-29 01:07:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 4189. [2023-11-29 01:07:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 3231 states have (on average 1.3163107397090683) internal successors, (4253), 3291 states have internal predecessors, (4253), 509 states have call successors, (509), 390 states have call predecessors, (509), 447 states have return successors, (699), 513 states have call predecessors, (699), 506 states have call successors, (699) [2023-11-29 01:07:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 5461 transitions. [2023-11-29 01:07:15,588 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 5461 transitions. Word has length 71 [2023-11-29 01:07:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:15,588 INFO L495 AbstractCegarLoop]: Abstraction has 4189 states and 5461 transitions. [2023-11-29 01:07:15,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 01:07:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 5461 transitions. [2023-11-29 01:07:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 01:07:15,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:15,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:15,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:07:15,591 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:15,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1976505401, now seen corresponding path program 1 times [2023-11-29 01:07:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439257289] [2023-11-29 01:07:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:07:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:07:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439257289] [2023-11-29 01:07:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439257289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:07:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126589374] [2023-11-29 01:07:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:07:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:07:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:07:15,691 INFO L87 Difference]: Start difference. First operand 4189 states and 5461 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 01:07:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:17,092 INFO L93 Difference]: Finished difference Result 9507 states and 11992 transitions. [2023-11-29 01:07:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:07:17,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2023-11-29 01:07:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:17,113 INFO L225 Difference]: With dead ends: 9507 [2023-11-29 01:07:17,113 INFO L226 Difference]: Without dead ends: 6117 [2023-11-29 01:07:17,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-29 01:07:17,123 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 956 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:17,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 680 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:07:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2023-11-29 01:07:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 5857. [2023-11-29 01:07:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5857 states, 4464 states have (on average 1.2780017921146953) internal successors, (5705), 4561 states have internal predecessors, (5705), 709 states have call successors, (709), 562 states have call predecessors, (709), 682 states have return successors, (1049), 739 states have call predecessors, (1049), 706 states have call successors, (1049) [2023-11-29 01:07:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5857 states to 5857 states and 7463 transitions. [2023-11-29 01:07:17,988 INFO L78 Accepts]: Start accepts. Automaton has 5857 states and 7463 transitions. Word has length 76 [2023-11-29 01:07:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:17,988 INFO L495 AbstractCegarLoop]: Abstraction has 5857 states and 7463 transitions. [2023-11-29 01:07:17,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 01:07:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5857 states and 7463 transitions. [2023-11-29 01:07:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 01:07:17,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:17,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:07:17,993 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:17,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -816846335, now seen corresponding path program 1 times [2023-11-29 01:07:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429270011] [2023-11-29 01:07:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 01:07:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:07:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 01:07:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429270011] [2023-11-29 01:07:18,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429270011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343891116] [2023-11-29 01:07:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:18,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:18,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:18,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:18,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:07:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:18,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:07:18,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:07:18,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:18,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343891116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:07:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246363761] [2023-11-29 01:07:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:18,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:07:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:07:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:18,200 INFO L87 Difference]: Start difference. First operand 5857 states and 7463 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:18,828 INFO L93 Difference]: Finished difference Result 8701 states and 11644 transitions. [2023-11-29 01:07:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:07:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2023-11-29 01:07:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:18,844 INFO L225 Difference]: With dead ends: 8701 [2023-11-29 01:07:18,844 INFO L226 Difference]: Without dead ends: 7184 [2023-11-29 01:07:18,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:18,850 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 107 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:18,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 587 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7184 states. [2023-11-29 01:07:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7184 to 7184. [2023-11-29 01:07:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7184 states, 5507 states have (on average 1.2981659705828945) internal successors, (7149), 5621 states have internal predecessors, (7149), 868 states have call successors, (868), 668 states have call predecessors, (868), 807 states have return successors, (1348), 904 states have call predecessors, (1348), 865 states have call successors, (1348) [2023-11-29 01:07:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7184 states to 7184 states and 9365 transitions. [2023-11-29 01:07:19,567 INFO L78 Accepts]: Start accepts. Automaton has 7184 states and 9365 transitions. Word has length 84 [2023-11-29 01:07:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:19,567 INFO L495 AbstractCegarLoop]: Abstraction has 7184 states and 9365 transitions. [2023-11-29 01:07:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7184 states and 9365 transitions. [2023-11-29 01:07:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 01:07:19,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:19,572 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:19,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:07:19,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 01:07:19,773 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:19,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2055529371, now seen corresponding path program 1 times [2023-11-29 01:07:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693607064] [2023-11-29 01:07:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 01:07:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:07:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693607064] [2023-11-29 01:07:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693607064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:19,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:19,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:07:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594575473] [2023-11-29 01:07:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:19,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:07:19,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:07:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:07:19,884 INFO L87 Difference]: Start difference. First operand 7184 states and 9365 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 01:07:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:21,597 INFO L93 Difference]: Finished difference Result 10274 states and 13113 transitions. [2023-11-29 01:07:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:07:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2023-11-29 01:07:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:21,616 INFO L225 Difference]: With dead ends: 10274 [2023-11-29 01:07:21,616 INFO L226 Difference]: Without dead ends: 6431 [2023-11-29 01:07:21,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-29 01:07:21,625 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 1019 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:21,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 946 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:07:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6431 states. [2023-11-29 01:07:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6431 to 6027. [2023-11-29 01:07:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 4616 states have (on average 1.3011265164644714) internal successors, (6006), 4718 states have internal predecessors, (6006), 733 states have call successors, (733), 550 states have call predecessors, (733), 676 states have return successors, (1117), 768 states have call predecessors, (1117), 730 states have call successors, (1117) [2023-11-29 01:07:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 7856 transitions. [2023-11-29 01:07:22,285 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 7856 transitions. Word has length 86 [2023-11-29 01:07:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:22,286 INFO L495 AbstractCegarLoop]: Abstraction has 6027 states and 7856 transitions. [2023-11-29 01:07:22,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 01:07:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 7856 transitions. [2023-11-29 01:07:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 01:07:22,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:22,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:22,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:07:22,296 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:22,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1198985313, now seen corresponding path program 1 times [2023-11-29 01:07:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733646343] [2023-11-29 01:07:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 01:07:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:07:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:07:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 01:07:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733646343] [2023-11-29 01:07:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733646343] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279023462] [2023-11-29 01:07:22,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:22,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:22,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:07:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:22,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:07:22,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:07:22,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279023462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 01:07:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040980153] [2023-11-29 01:07:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:22,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:07:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:07:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:22,669 INFO L87 Difference]: Start difference. First operand 6027 states and 7856 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:07:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:23,291 INFO L93 Difference]: Finished difference Result 9618 states and 13127 transitions. [2023-11-29 01:07:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:07:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2023-11-29 01:07:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:23,306 INFO L225 Difference]: With dead ends: 9618 [2023-11-29 01:07:23,306 INFO L226 Difference]: Without dead ends: 7452 [2023-11-29 01:07:23,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:23,312 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 199 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:23,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 383 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2023-11-29 01:07:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7408. [2023-11-29 01:07:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7408 states, 5707 states have (on average 1.3215349570702646) internal successors, (7542), 5830 states have internal predecessors, (7542), 897 states have call successors, (897), 660 states have call predecessors, (897), 802 states have return successors, (1361), 927 states have call predecessors, (1361), 894 states have call successors, (1361) [2023-11-29 01:07:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 9800 transitions. [2023-11-29 01:07:24,009 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 9800 transitions. Word has length 107 [2023-11-29 01:07:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:24,010 INFO L495 AbstractCegarLoop]: Abstraction has 7408 states and 9800 transitions. [2023-11-29 01:07:24,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:07:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 9800 transitions. [2023-11-29 01:07:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 01:07:24,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:24,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:24,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:07:24,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:24,219 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:24,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -956017786, now seen corresponding path program 1 times [2023-11-29 01:07:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:24,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209194030] [2023-11-29 01:07:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:24,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:07:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:07:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:07:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:07:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 01:07:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209194030] [2023-11-29 01:07:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209194030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882383834] [2023-11-29 01:07:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:24,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:24,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:24,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:07:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:24,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:07:24,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 01:07:24,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:24,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882383834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:24,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:24,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:07:24,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590731194] [2023-11-29 01:07:24,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:24,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:07:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:07:24,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:24,461 INFO L87 Difference]: Start difference. First operand 7408 states and 9800 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:07:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:25,148 INFO L93 Difference]: Finished difference Result 12036 states and 16649 transitions. [2023-11-29 01:07:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:07:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 122 [2023-11-29 01:07:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:25,164 INFO L225 Difference]: With dead ends: 12036 [2023-11-29 01:07:25,164 INFO L226 Difference]: Without dead ends: 7812 [2023-11-29 01:07:25,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:25,174 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:25,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 267 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2023-11-29 01:07:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 7717. [2023-11-29 01:07:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7717 states, 5991 states have (on average 1.28509430812886) internal successors, (7699), 6109 states have internal predecessors, (7699), 893 states have call successors, (893), 686 states have call predecessors, (893), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-11-29 01:07:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7717 states to 7717 states and 9935 transitions. [2023-11-29 01:07:25,882 INFO L78 Accepts]: Start accepts. Automaton has 7717 states and 9935 transitions. Word has length 122 [2023-11-29 01:07:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:25,883 INFO L495 AbstractCegarLoop]: Abstraction has 7717 states and 9935 transitions. [2023-11-29 01:07:25,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:07:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7717 states and 9935 transitions. [2023-11-29 01:07:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 01:07:25,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:25,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:25,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:07:26,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:26,090 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:26,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash 895698313, now seen corresponding path program 1 times [2023-11-29 01:07:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268851638] [2023-11-29 01:07:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:07:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:07:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:07:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:07:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 01:07:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:26,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268851638] [2023-11-29 01:07:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268851638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:26,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896148018] [2023-11-29 01:07:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:26,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:26,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:26,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:26,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:07:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:26,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:07:26,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 01:07:26,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896148018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:07:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598510950] [2023-11-29 01:07:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:26,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:07:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:07:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:26,375 INFO L87 Difference]: Start difference. First operand 7717 states and 9935 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 01:07:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:27,269 INFO L93 Difference]: Finished difference Result 12157 states and 16026 transitions. [2023-11-29 01:07:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:07:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2023-11-29 01:07:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:27,284 INFO L225 Difference]: With dead ends: 12157 [2023-11-29 01:07:27,284 INFO L226 Difference]: Without dead ends: 7932 [2023-11-29 01:07:27,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:27,292 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 212 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:27,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 383 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2023-11-29 01:07:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7687. [2023-11-29 01:07:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7687 states, 5961 states have (on average 1.2714309679583962) internal successors, (7579), 6079 states have internal predecessors, (7579), 893 states have call successors, (893), 686 states have call predecessors, (893), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-11-29 01:07:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7687 states to 7687 states and 9815 transitions. [2023-11-29 01:07:27,951 INFO L78 Accepts]: Start accepts. Automaton has 7687 states and 9815 transitions. Word has length 122 [2023-11-29 01:07:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 7687 states and 9815 transitions. [2023-11-29 01:07:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 01:07:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7687 states and 9815 transitions. [2023-11-29 01:07:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 01:07:27,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:27,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:27,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:07:28,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:28,162 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:28,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 766176521, now seen corresponding path program 1 times [2023-11-29 01:07:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528562527] [2023-11-29 01:07:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 01:07:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 01:07:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 01:07:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:07:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 01:07:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528562527] [2023-11-29 01:07:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528562527] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4629387] [2023-11-29 01:07:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:28,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:28,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:28,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:28,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:07:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:28,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:07:28,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 01:07:28,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4629387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:28,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:28,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:07:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49908132] [2023-11-29 01:07:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:28,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:07:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:07:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:28,419 INFO L87 Difference]: Start difference. First operand 7687 states and 9815 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:07:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:29,549 INFO L93 Difference]: Finished difference Result 16401 states and 21767 transitions. [2023-11-29 01:07:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:07:29,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-29 01:07:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:29,569 INFO L225 Difference]: With dead ends: 16401 [2023-11-29 01:07:29,569 INFO L226 Difference]: Without dead ends: 11902 [2023-11-29 01:07:29,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:29,580 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 117 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:29,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 583 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:07:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2023-11-29 01:07:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 11898. [2023-11-29 01:07:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11898 states, 9286 states have (on average 1.2747146241654104) internal successors, (11837), 9469 states have internal predecessors, (11837), 1381 states have call successors, (1381), 1036 states have call predecessors, (1381), 1229 states have return successors, (2339), 1410 states have call predecessors, (2339), 1378 states have call successors, (2339) [2023-11-29 01:07:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11898 states to 11898 states and 15557 transitions. [2023-11-29 01:07:30,531 INFO L78 Accepts]: Start accepts. Automaton has 11898 states and 15557 transitions. Word has length 123 [2023-11-29 01:07:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:30,531 INFO L495 AbstractCegarLoop]: Abstraction has 11898 states and 15557 transitions. [2023-11-29 01:07:30,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:07:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11898 states and 15557 transitions. [2023-11-29 01:07:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 01:07:30,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:30,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:30,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:07:30,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:30,744 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:30,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1622899648, now seen corresponding path program 1 times [2023-11-29 01:07:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838418126] [2023-11-29 01:07:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:07:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 01:07:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838418126] [2023-11-29 01:07:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838418126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:30,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084554088] [2023-11-29 01:07:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:30,831 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:30,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:07:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:30,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:07:30,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:07:30,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084554088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:07:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297075350] [2023-11-29 01:07:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:30,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:07:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:07:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:30,994 INFO L87 Difference]: Start difference. First operand 11898 states and 15557 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:07:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:31,862 INFO L93 Difference]: Finished difference Result 15150 states and 20307 transitions. [2023-11-29 01:07:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:07:31,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2023-11-29 01:07:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:31,880 INFO L225 Difference]: With dead ends: 15150 [2023-11-29 01:07:31,880 INFO L226 Difference]: Without dead ends: 10796 [2023-11-29 01:07:31,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:07:31,892 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 85 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:31,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 547 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10796 states. [2023-11-29 01:07:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10796 to 10664. [2023-11-29 01:07:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10664 states, 8318 states have (on average 1.2620822313056024) internal successors, (10498), 8485 states have internal predecessors, (10498), 1237 states have call successors, (1237), 936 states have call predecessors, (1237), 1107 states have return successors, (1999), 1260 states have call predecessors, (1999), 1234 states have call successors, (1999) [2023-11-29 01:07:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 13734 transitions. [2023-11-29 01:07:32,940 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 13734 transitions. Word has length 124 [2023-11-29 01:07:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:32,940 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 13734 transitions. [2023-11-29 01:07:32,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:07:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 13734 transitions. [2023-11-29 01:07:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 01:07:32,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:32,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:32,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 01:07:33,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:33,154 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:33,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1600264158, now seen corresponding path program 1 times [2023-11-29 01:07:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481840505] [2023-11-29 01:07:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:07:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 01:07:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481840505] [2023-11-29 01:07:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481840505] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992524688] [2023-11-29 01:07:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:33,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:33,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:33,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:33,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:07:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:33,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:07:33,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 01:07:33,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992524688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 01:07:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924287416] [2023-11-29 01:07:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:33,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:07:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:07:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:07:33,442 INFO L87 Difference]: Start difference. First operand 10664 states and 13734 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:34,458 INFO L93 Difference]: Finished difference Result 13824 states and 18104 transitions. [2023-11-29 01:07:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:07:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-11-29 01:07:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:34,473 INFO L225 Difference]: With dead ends: 13824 [2023-11-29 01:07:34,473 INFO L226 Difference]: Without dead ends: 9164 [2023-11-29 01:07:34,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:07:34,481 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 295 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:34,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 360 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:07:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2023-11-29 01:07:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 9104. [2023-11-29 01:07:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9104 states, 7078 states have (on average 1.2309974569087312) internal successors, (8713), 7199 states have internal predecessors, (8713), 1077 states have call successors, (1077), 816 states have call predecessors, (1077), 947 states have return successors, (1626), 1098 states have call predecessors, (1626), 1074 states have call successors, (1626) [2023-11-29 01:07:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9104 states to 9104 states and 11416 transitions. [2023-11-29 01:07:35,263 INFO L78 Accepts]: Start accepts. Automaton has 9104 states and 11416 transitions. Word has length 125 [2023-11-29 01:07:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:35,263 INFO L495 AbstractCegarLoop]: Abstraction has 9104 states and 11416 transitions. [2023-11-29 01:07:35,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9104 states and 11416 transitions. [2023-11-29 01:07:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 01:07:35,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:35,270 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:35,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:07:35,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:35,472 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:35,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1075728224, now seen corresponding path program 1 times [2023-11-29 01:07:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269535853] [2023-11-29 01:07:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:07:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 01:07:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:35,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269535853] [2023-11-29 01:07:35,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269535853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:35,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780346321] [2023-11-29 01:07:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:35,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:35,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:35,584 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:35,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:07:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:35,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:07:35,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 01:07:35,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:35,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780346321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:35,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:35,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 01:07:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449217471] [2023-11-29 01:07:35,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:07:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:35,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:07:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:07:35,749 INFO L87 Difference]: Start difference. First operand 9104 states and 11416 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:36,782 INFO L93 Difference]: Finished difference Result 14130 states and 18158 transitions. [2023-11-29 01:07:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:07:36,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-11-29 01:07:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:36,797 INFO L225 Difference]: With dead ends: 14130 [2023-11-29 01:07:36,798 INFO L226 Difference]: Without dead ends: 8478 [2023-11-29 01:07:36,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:07:36,806 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 313 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 355 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:07:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8478 states. [2023-11-29 01:07:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8478 to 6622. [2023-11-29 01:07:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6622 states, 5132 states have (on average 1.1971940763834763) internal successors, (6144), 5221 states have internal predecessors, (6144), 777 states have call successors, (777), 600 states have call predecessors, (777), 711 states have return successors, (1147), 806 states have call predecessors, (1147), 774 states have call successors, (1147) [2023-11-29 01:07:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 8068 transitions. [2023-11-29 01:07:37,465 INFO L78 Accepts]: Start accepts. Automaton has 6622 states and 8068 transitions. Word has length 125 [2023-11-29 01:07:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:37,466 INFO L495 AbstractCegarLoop]: Abstraction has 6622 states and 8068 transitions. [2023-11-29 01:07:37,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6622 states and 8068 transitions. [2023-11-29 01:07:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 01:07:37,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:37,470 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:37,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:07:37,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 01:07:37,671 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:37,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 192219234, now seen corresponding path program 1 times [2023-11-29 01:07:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794290368] [2023-11-29 01:07:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:07:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 01:07:37,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794290368] [2023-11-29 01:07:37,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794290368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91346701] [2023-11-29 01:07:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:37,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:37,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:37,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:37,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:07:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:37,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:07:37,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 01:07:37,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91346701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:37,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 01:07:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176804203] [2023-11-29 01:07:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:07:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:07:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:37,898 INFO L87 Difference]: Start difference. First operand 6622 states and 8068 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:38,542 INFO L93 Difference]: Finished difference Result 9026 states and 11168 transitions. [2023-11-29 01:07:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:07:38,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-11-29 01:07:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:38,550 INFO L225 Difference]: With dead ends: 9026 [2023-11-29 01:07:38,551 INFO L226 Difference]: Without dead ends: 5039 [2023-11-29 01:07:38,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:38,556 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 11 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:38,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 710 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2023-11-29 01:07:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5039. [2023-11-29 01:07:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5039 states, 3877 states have (on average 1.1859685323703895) internal successors, (4598), 3948 states have internal predecessors, (4598), 587 states have call successors, (587), 470 states have call predecessors, (587), 573 states have return successors, (804), 624 states have call predecessors, (804), 584 states have call successors, (804) [2023-11-29 01:07:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 5989 transitions. [2023-11-29 01:07:39,255 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 5989 transitions. Word has length 125 [2023-11-29 01:07:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:39,255 INFO L495 AbstractCegarLoop]: Abstraction has 5039 states and 5989 transitions. [2023-11-29 01:07:39,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 5989 transitions. [2023-11-29 01:07:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 01:07:39,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:39,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:39,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 01:07:39,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 01:07:39,461 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:39,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2025413922, now seen corresponding path program 1 times [2023-11-29 01:07:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470676344] [2023-11-29 01:07:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:07:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 01:07:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470676344] [2023-11-29 01:07:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470676344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655911590] [2023-11-29 01:07:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:39,584 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:39,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:07:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:39,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:07:39,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 01:07:39,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655911590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:39,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 01:07:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909385774] [2023-11-29 01:07:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:39,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:07:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:07:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:39,705 INFO L87 Difference]: Start difference. First operand 5039 states and 5989 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:40,160 INFO L93 Difference]: Finished difference Result 6134 states and 7319 transitions. [2023-11-29 01:07:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:07:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-11-29 01:07:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:40,166 INFO L225 Difference]: With dead ends: 6134 [2023-11-29 01:07:40,166 INFO L226 Difference]: Without dead ends: 3907 [2023-11-29 01:07:40,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:40,169 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:40,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 709 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:07:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2023-11-29 01:07:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3907. [2023-11-29 01:07:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3907 states, 2966 states have (on average 1.1857720836142953) internal successors, (3517), 3026 states have internal predecessors, (3517), 463 states have call successors, (463), 381 states have call predecessors, (463), 476 states have return successors, (621), 502 states have call predecessors, (621), 460 states have call successors, (621) [2023-11-29 01:07:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 4601 transitions. [2023-11-29 01:07:40,551 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 4601 transitions. Word has length 125 [2023-11-29 01:07:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:40,552 INFO L495 AbstractCegarLoop]: Abstraction has 3907 states and 4601 transitions. [2023-11-29 01:07:40,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 4601 transitions. [2023-11-29 01:07:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 01:07:40,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:40,554 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:40,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:07:40,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 01:07:40,754 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:40,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1372525982, now seen corresponding path program 1 times [2023-11-29 01:07:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365043603] [2023-11-29 01:07:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:07:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 01:07:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365043603] [2023-11-29 01:07:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365043603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:40,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:07:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997697935] [2023-11-29 01:07:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:40,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:07:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:07:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:40,856 INFO L87 Difference]: Start difference. First operand 3907 states and 4601 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 01:07:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:41,762 INFO L93 Difference]: Finished difference Result 4066 states and 4777 transitions. [2023-11-29 01:07:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:07:41,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2023-11-29 01:07:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:41,767 INFO L225 Difference]: With dead ends: 4066 [2023-11-29 01:07:41,767 INFO L226 Difference]: Without dead ends: 4063 [2023-11-29 01:07:41,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:07:41,769 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 540 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:41,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 558 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:07:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2023-11-29 01:07:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4032. [2023-11-29 01:07:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 3066 states have (on average 1.182648401826484) internal successors, (3626), 3126 states have internal predecessors, (3626), 477 states have call successors, (477), 391 states have call predecessors, (477), 487 states have return successors, (637), 517 states have call predecessors, (637), 475 states have call successors, (637) [2023-11-29 01:07:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 4740 transitions. [2023-11-29 01:07:42,193 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 4740 transitions. Word has length 125 [2023-11-29 01:07:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:42,193 INFO L495 AbstractCegarLoop]: Abstraction has 4032 states and 4740 transitions. [2023-11-29 01:07:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 01:07:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 4740 transitions. [2023-11-29 01:07:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 01:07:42,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:42,196 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:42,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:07:42,196 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:42,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1601398172, now seen corresponding path program 1 times [2023-11-29 01:07:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791801839] [2023-11-29 01:07:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:07:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:07:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:07:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 01:07:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:07:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:07:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 01:07:42,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791801839] [2023-11-29 01:07:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791801839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257333604] [2023-11-29 01:07:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:07:42,325 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:07:42,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 01:07:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:42,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:07:42,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:07:42,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:07:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257333604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:42,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:07:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-29 01:07:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776929809] [2023-11-29 01:07:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:42,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:07:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:07:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:07:42,467 INFO L87 Difference]: Start difference. First operand 4032 states and 4740 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:07:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:42,837 INFO L93 Difference]: Finished difference Result 5745 states and 6817 transitions. [2023-11-29 01:07:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:07:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-29 01:07:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:42,842 INFO L225 Difference]: With dead ends: 5745 [2023-11-29 01:07:42,842 INFO L226 Difference]: Without dead ends: 2585 [2023-11-29 01:07:42,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:07:42,846 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 32 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:42,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1149 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:07:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2023-11-29 01:07:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2463. [2023-11-29 01:07:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1943 states have (on average 1.1698404529078745) internal successors, (2273), 1966 states have internal predecessors, (2273), 266 states have call successors, (266), 205 states have call predecessors, (266), 252 states have return successors, (344), 292 states have call predecessors, (344), 264 states have call successors, (344) [2023-11-29 01:07:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 2883 transitions. [2023-11-29 01:07:43,095 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 2883 transitions. Word has length 131 [2023-11-29 01:07:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:43,095 INFO L495 AbstractCegarLoop]: Abstraction has 2463 states and 2883 transitions. [2023-11-29 01:07:43,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:07:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 2883 transitions. [2023-11-29 01:07:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 01:07:43,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:43,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:43,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 01:07:43,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:07:43,298 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:43,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash -523809464, now seen corresponding path program 1 times [2023-11-29 01:07:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518324927] [2023-11-29 01:07:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:07:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:07:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:07:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:07:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:07:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:07:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:07:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:07:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:07:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:07:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:07:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:07:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-29 01:07:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518324927] [2023-11-29 01:07:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518324927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:07:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154256620] [2023-11-29 01:07:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:43,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:07:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:07:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:43,368 INFO L87 Difference]: Start difference. First operand 2463 states and 2883 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 01:07:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:43,924 INFO L93 Difference]: Finished difference Result 2511 states and 2933 transitions. [2023-11-29 01:07:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:07:43,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2023-11-29 01:07:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:43,928 INFO L225 Difference]: With dead ends: 2511 [2023-11-29 01:07:43,928 INFO L226 Difference]: Without dead ends: 2171 [2023-11-29 01:07:43,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:07:43,929 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 285 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:43,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 503 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:07:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2023-11-29 01:07:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2126. [2023-11-29 01:07:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1690 states have (on average 1.172189349112426) internal successors, (1981), 1710 states have internal predecessors, (1981), 225 states have call successors, (225), 170 states have call predecessors, (225), 209 states have return successors, (289), 246 states have call predecessors, (289), 223 states have call successors, (289) [2023-11-29 01:07:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2495 transitions. [2023-11-29 01:07:44,142 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2495 transitions. Word has length 133 [2023-11-29 01:07:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:44,142 INFO L495 AbstractCegarLoop]: Abstraction has 2126 states and 2495 transitions. [2023-11-29 01:07:44,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 01:07:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2495 transitions. [2023-11-29 01:07:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-29 01:07:44,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:44,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:44,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:07:44,145 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:44,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1337113526, now seen corresponding path program 1 times [2023-11-29 01:07:44,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:44,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873582085] [2023-11-29 01:07:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:07:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:07:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:07:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:07:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:07:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:07:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:07:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:07:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:07:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:07:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 01:07:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:07:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873582085] [2023-11-29 01:07:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873582085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:07:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:07:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:07:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608968919] [2023-11-29 01:07:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:07:44,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:07:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:07:44,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:07:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:07:44,220 INFO L87 Difference]: Start difference. First operand 2126 states and 2495 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:44,749 INFO L93 Difference]: Finished difference Result 2690 states and 3143 transitions. [2023-11-29 01:07:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:07:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2023-11-29 01:07:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:44,753 INFO L225 Difference]: With dead ends: 2690 [2023-11-29 01:07:44,753 INFO L226 Difference]: Without dead ends: 2161 [2023-11-29 01:07:44,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:07:44,755 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 187 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:44,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 448 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:07:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2023-11-29 01:07:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2128. [2023-11-29 01:07:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1692 states have (on average 1.1719858156028369) internal successors, (1983), 1712 states have internal predecessors, (1983), 225 states have call successors, (225), 170 states have call predecessors, (225), 209 states have return successors, (289), 246 states have call predecessors, (289), 223 states have call successors, (289) [2023-11-29 01:07:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2497 transitions. [2023-11-29 01:07:44,960 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2497 transitions. Word has length 129 [2023-11-29 01:07:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:44,960 INFO L495 AbstractCegarLoop]: Abstraction has 2128 states and 2497 transitions. [2023-11-29 01:07:44,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:07:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2497 transitions. [2023-11-29 01:07:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 01:07:44,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:44,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:44,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 01:07:44,962 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:07:44,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1566691016, now seen corresponding path program 1 times [2023-11-29 01:07:44,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:07:44,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308273695] [2023-11-29 01:07:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:07:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:07:44,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:07:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:07:45,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:07:45,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:07:45,042 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 01:07:45,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 01:07:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 01:07:45,048 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:07:45,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:07:45,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:07:45,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:07:45,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:07:45,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:07:45 BoogieIcfgContainer [2023-11-29 01:07:45,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:07:45,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:07:45,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:07:45,168 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:07:45,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:06:49" (3/4) ... [2023-11-29 01:07:45,169 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 01:07:45,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:07:45,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:07:45,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:07:45,288 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:07:45,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:07:45,289 INFO L158 Benchmark]: Toolchain (without parser) took 56935.15ms. Allocated memory was 180.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 132.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 858.0MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,289 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:07:45,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.89ms. Allocated memory is still 180.4MB. Free memory was 132.4MB in the beginning and 115.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.91ms. Allocated memory is still 180.4MB. Free memory was 115.5MB in the beginning and 112.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,290 INFO L158 Benchmark]: Boogie Preprocessor took 61.51ms. Allocated memory is still 180.4MB. Free memory was 112.8MB in the beginning and 109.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,290 INFO L158 Benchmark]: RCFGBuilder took 676.88ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 133.5MB in the end (delta: -24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,291 INFO L158 Benchmark]: TraceAbstraction took 55665.95ms. Allocated memory was 180.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 132.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 839.1MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,291 INFO L158 Benchmark]: Witness Printer took 121.38ms. Allocated memory is still 2.3GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:07:45,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.89ms. Allocated memory is still 180.4MB. Free memory was 132.4MB in the beginning and 115.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.91ms. Allocated memory is still 180.4MB. Free memory was 115.5MB in the beginning and 112.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.51ms. Allocated memory is still 180.4MB. Free memory was 112.8MB in the beginning and 109.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 676.88ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 133.5MB in the end (delta: -24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 55665.95ms. Allocated memory was 180.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 132.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 839.1MB. Max. memory is 16.1GB. * Witness Printer took 121.38ms. Allocated memory is still 2.3GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 496]: 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 ; [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L708-L719] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } 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=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE, EXPR \read(tmp_ndt_2) [L727] EXPR t1_st = 1 [L728] CALL, EXPR transmit1() [L576] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 [L589] t1_pc = 1 [L590] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET, EXPR transmit1() [L722-L733] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } 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=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE, EXPR \read(tmp_ndt_1) [L713] EXPR m_st = 1 [L714] CALL, EXPR master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET, EXPR master() [L708-L719] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } 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=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE, EXPR \read(tmp_ndt_2) [L727] EXPR t1_st = 1 [L728] CALL, EXPR transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 [L595] token += 1 [L596] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 [L589] t1_pc = 1 [L590] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET, EXPR transmit1() [L722-L733] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } 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=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 194 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15181 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14788 mSDsluCounter, 21140 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14616 mSDsCounter, 3408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16341 IncrementalHoareTripleChecker+Invalid, 19749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3408 mSolverCounterUnsat, 6524 mSDtfsCounter, 16341 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2494 GetRequests, 2115 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11898occurred in iteration=23, InterpolantAutomatonStates: 343, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 7530 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 4322 NumberOfCodeBlocks, 4322 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4215 ConstructedInterpolants, 0 QuantifiedInterpolants, 7381 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4930 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 45 InterpolantComputations, 31 PerfectInterpolantSequences, 1552/1715 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 01:07:45,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3aa70be5-bd04-48b2-82db-7344147f61b8/bin/uautomizer-verify-BQ2R08f2Ya/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