./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/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_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/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_60674a82-80a2-4999-bc39-8f8f1108397e/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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:56:45,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:56:45,870 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:56:45,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:56:45,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:56:45,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:56:45,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:56:45,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:56:45,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:56:45,906 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:56:45,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:56:45,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:56:45,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:56:45,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:56:45,909 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:56:45,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:56:45,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:56:45,910 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:56:45,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:56:45,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:56:45,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:56:45,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:56:45,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:56:45,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:56:45,914 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:56:45,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:56:45,915 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:56:45,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:56:45,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:56:45,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:56:45,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:56:45,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:56:45,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:56:45,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:56:45,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:56:45,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:56:45,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:56:45,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:56:45,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:56:45,919 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:56:45,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:56:45,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:56:45,920 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_60674a82-80a2-4999-bc39-8f8f1108397e/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_60674a82-80a2-4999-bc39-8f8f1108397e/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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2023-11-29 06:56:46,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:56:46,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:56:46,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:56:46,186 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:56:46,186 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:56:46,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-11-29 06:56:49,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:56:49,200 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:56:49,201 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-11-29 06:56:49,213 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/data/8b1f9a660/139551e06f99403da771aba06ec32606/FLAG7ee83a0c9 [2023-11-29 06:56:49,225 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/data/8b1f9a660/139551e06f99403da771aba06ec32606 [2023-11-29 06:56:49,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:56:49,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:56:49,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:49,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:56:49,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:56:49,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613214aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49, skipping insertion in model container [2023-11-29 06:56:49,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:56:49,410 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_60674a82-80a2-4999-bc39-8f8f1108397e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2023-11-29 06:56:49,466 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_60674a82-80a2-4999-bc39-8f8f1108397e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-11-29 06:56:49,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:49,506 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:56:49,516 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_60674a82-80a2-4999-bc39-8f8f1108397e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2023-11-29 06:56:49,543 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_60674a82-80a2-4999-bc39-8f8f1108397e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-11-29 06:56:49,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:49,587 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:56:49,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49 WrapperNode [2023-11-29 06:56:49,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:49,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:56:49,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:56:49,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:56:49,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,644 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 448 [2023-11-29 06:56:49,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:56:49,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:56:49,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:56:49,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:56:49,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,676 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 06:56:49,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:56:49,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:56:49,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:56:49,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:56:49,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (1/1) ... [2023-11-29 06:56:49,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:56:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:56:49,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:56:49,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:56:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:56:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 06:56:49,798 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 06:56:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 06:56:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 06:56:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 06:56:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 06:56:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 06:56:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 06:56:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 06:56:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 06:56:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 06:56:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 06:56:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 06:56:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 06:56:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 06:56:49,801 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 06:56:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 06:56:49,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 06:56:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 06:56:49,801 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 06:56:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 06:56:49,801 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 06:56:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:56:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 06:56:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 06:56:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 06:56:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 06:56:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:56:49,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:56:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 06:56:49,803 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 06:56:49,905 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:56:49,907 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:56:50,293 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-11-29 06:56:50,294 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-11-29 06:56:50,336 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:56:50,384 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:56:50,384 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-29 06:56:50,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:50 BoogieIcfgContainer [2023-11-29 06:56:50,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:56:50,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:56:50,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:56:50,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:56:50,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:56:49" (1/3) ... [2023-11-29 06:56:50,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edab29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:56:50, skipping insertion in model container [2023-11-29 06:56:50,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:49" (2/3) ... [2023-11-29 06:56:50,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edab29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:56:50, skipping insertion in model container [2023-11-29 06:56:50,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:50" (3/3) ... [2023-11-29 06:56:50,395 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-11-29 06:56:50,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:56:50,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 06:56:50,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:56:50,472 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;@52314f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:56:50,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 06:56:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 06:56:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:56:50,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:50,489 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] [2023-11-29 06:56:50,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:50,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:50,495 INFO L85 PathProgramCache]: Analyzing trace with hash 635992734, now seen corresponding path program 1 times [2023-11-29 06:56:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:50,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896597905] [2023-11-29 06:56:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:56:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:56:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:56:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:50,882 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 06:56:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896597905] [2023-11-29 06:56:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896597905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:56:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851285518] [2023-11-29 06:56:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:50,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:56:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:56:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:56:50,923 INFO L87 Difference]: Start difference. First operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:51,852 INFO L93 Difference]: Finished difference Result 507 states and 787 transitions. [2023-11-29 06:56:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:56:51,855 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 06:56:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:51,869 INFO L225 Difference]: With dead ends: 507 [2023-11-29 06:56:51,869 INFO L226 Difference]: Without dead ends: 317 [2023-11-29 06:56:51,874 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 06:56:51,878 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 524 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:51,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 553 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:56:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-29 06:56:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2023-11-29 06:56:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 215 states have (on average 1.4930232558139536) internal successors, (321), 220 states have internal predecessors, (321), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2023-11-29 06:56:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 404 transitions. [2023-11-29 06:56:51,953 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 404 transitions. Word has length 51 [2023-11-29 06:56:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:51,953 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 404 transitions. [2023-11-29 06:56:51,954 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 404 transitions. [2023-11-29 06:56:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:56:51,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:51,958 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] [2023-11-29 06:56:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:56:51,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:51,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1482341282, now seen corresponding path program 1 times [2023-11-29 06:56:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879646392] [2023-11-29 06:56:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:52,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:56:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:56:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:56:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:52,142 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 06:56:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879646392] [2023-11-29 06:56:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879646392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:56:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361289667] [2023-11-29 06:56:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:52,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:56:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:56:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:56:52,146 INFO L87 Difference]: Start difference. First operand 278 states and 404 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:53,119 INFO L93 Difference]: Finished difference Result 588 states and 856 transitions. [2023-11-29 06:56:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:56:53,121 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 06:56:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:53,127 INFO L225 Difference]: With dead ends: 588 [2023-11-29 06:56:53,127 INFO L226 Difference]: Without dead ends: 418 [2023-11-29 06:56:53,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:56:53,131 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 510 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:53,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 804 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:56:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-11-29 06:56:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 357. [2023-11-29 06:56:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 277 states have (on average 1.48014440433213) internal successors, (410), 283 states have internal predecessors, (410), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2023-11-29 06:56:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 515 transitions. [2023-11-29 06:56:53,195 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 515 transitions. Word has length 51 [2023-11-29 06:56:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:53,196 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 515 transitions. [2023-11-29 06:56:53,196 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 515 transitions. [2023-11-29 06:56:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:56:53,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:53,199 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] [2023-11-29 06:56:53,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:56:53,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:53,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash 110533984, now seen corresponding path program 1 times [2023-11-29 06:56:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318709839] [2023-11-29 06:56:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:56:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:56:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:56:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,346 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 06:56:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:53,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318709839] [2023-11-29 06:56:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318709839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:53,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:56:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427401103] [2023-11-29 06:56:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:56:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:56:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:56:53,349 INFO L87 Difference]: Start difference. First operand 357 states and 515 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:54,356 INFO L93 Difference]: Finished difference Result 898 states and 1297 transitions. [2023-11-29 06:56:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:56:54,357 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 06:56:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:54,362 INFO L225 Difference]: With dead ends: 898 [2023-11-29 06:56:54,363 INFO L226 Difference]: Without dead ends: 649 [2023-11-29 06:56:54,364 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 06:56:54,366 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 522 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:54,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 795 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:56:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-11-29 06:56:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 512. [2023-11-29 06:56:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 400 states have (on average 1.4675) internal successors, (587), 408 states have internal predecessors, (587), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2023-11-29 06:56:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 736 transitions. [2023-11-29 06:56:54,419 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 736 transitions. Word has length 51 [2023-11-29 06:56:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:54,420 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 736 transitions. [2023-11-29 06:56:54,420 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 736 transitions. [2023-11-29 06:56:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:56:54,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:54,423 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] [2023-11-29 06:56:54,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:56:54,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:54,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1734833182, now seen corresponding path program 1 times [2023-11-29 06:56:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27978547] [2023-11-29 06:56:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:56:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:56:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:56:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,562 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 06:56:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27978547] [2023-11-29 06:56:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27978547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:56:54,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393696606] [2023-11-29 06:56:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:54,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:56:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:54,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:56:54,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:56:54,566 INFO L87 Difference]: Start difference. First operand 512 states and 736 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:55,796 INFO L93 Difference]: Finished difference Result 2323 states and 3463 transitions. [2023-11-29 06:56:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:56:55,797 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 06:56:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:55,808 INFO L225 Difference]: With dead ends: 2323 [2023-11-29 06:56:55,808 INFO L226 Difference]: Without dead ends: 1920 [2023-11-29 06:56:55,810 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 06:56:55,811 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 1042 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:55,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 677 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:56:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2023-11-29 06:56:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1600. [2023-11-29 06:56:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1245 states have (on average 1.427309236947791) internal successors, (1777), 1280 states have internal predecessors, (1777), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2023-11-29 06:56:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2292 transitions. [2023-11-29 06:56:55,930 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2292 transitions. Word has length 51 [2023-11-29 06:56:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:55,930 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2292 transitions. [2023-11-29 06:56:55,930 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 06:56:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2292 transitions. [2023-11-29 06:56:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:56:55,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:55,933 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] [2023-11-29 06:56:55,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:56:55,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:55,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:55,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1245975289, now seen corresponding path program 1 times [2023-11-29 06:56:55,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:55,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697132346] [2023-11-29 06:56:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:56:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:56:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:56:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:56:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 06:56:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:56,056 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 06:56:56,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:56,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697132346] [2023-11-29 06:56:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697132346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:56,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:56,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:56:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717382780] [2023-11-29 06:56:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:56,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:56:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:56:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:56:56,058 INFO L87 Difference]: Start difference. First operand 1600 states and 2292 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 06:56:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:56,920 INFO L93 Difference]: Finished difference Result 1832 states and 2639 transitions. [2023-11-29 06:56:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:56:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2023-11-29 06:56:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:56,932 INFO L225 Difference]: With dead ends: 1832 [2023-11-29 06:56:56,932 INFO L226 Difference]: Without dead ends: 1738 [2023-11-29 06:56:56,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:56:56,935 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 578 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:56,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 724 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:56:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2023-11-29 06:56:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1701. [2023-11-29 06:56:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1324 states have (on average 1.4297583081570997) internal successors, (1893), 1361 states have internal predecessors, (1893), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2023-11-29 06:56:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2439 transitions. [2023-11-29 06:56:57,042 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2439 transitions. Word has length 57 [2023-11-29 06:56:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:57,042 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2439 transitions. [2023-11-29 06:56:57,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 06:56:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2439 transitions. [2023-11-29 06:56:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:56:57,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:57,044 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] [2023-11-29 06:56:57,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:56:57,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:57,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -698017479, now seen corresponding path program 1 times [2023-11-29 06:56:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326889649] [2023-11-29 06:56:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:56:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:56:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:56:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:56:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 06:56:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:57,199 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 06:56:57,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326889649] [2023-11-29 06:56:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326889649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:57,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:56:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906838611] [2023-11-29 06:56:57,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:57,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:56:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:56:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:56:57,202 INFO L87 Difference]: Start difference. First operand 1701 states and 2439 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 06:56:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:58,292 INFO L93 Difference]: Finished difference Result 2062 states and 2969 transitions. [2023-11-29 06:56:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:56:58,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2023-11-29 06:56:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:58,305 INFO L225 Difference]: With dead ends: 2062 [2023-11-29 06:56:58,305 INFO L226 Difference]: Without dead ends: 1874 [2023-11-29 06:56:58,307 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 06:56:58,308 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 554 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:58,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1049 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:56:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2023-11-29 06:56:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1802. [2023-11-29 06:56:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1403 states have (on average 1.4312188168210978) internal successors, (2008), 1442 states have internal predecessors, (2008), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2023-11-29 06:56:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2588 transitions. [2023-11-29 06:56:58,417 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2588 transitions. Word has length 57 [2023-11-29 06:56:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 2588 transitions. [2023-11-29 06:56:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 06:56:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2588 transitions. [2023-11-29 06:56:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:56:58,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:58,420 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] [2023-11-29 06:56:58,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:56:58,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:58,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash 195468859, now seen corresponding path program 1 times [2023-11-29 06:56:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754475889] [2023-11-29 06:56:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:56:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:56:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:56:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:56:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:56:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 06:56:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:58,508 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 06:56:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754475889] [2023-11-29 06:56:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754475889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:58,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:56:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784659974] [2023-11-29 06:56:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:58,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:56:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:56:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:56:58,510 INFO L87 Difference]: Start difference. First operand 1802 states and 2588 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 06:56:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:59,332 INFO L93 Difference]: Finished difference Result 2408 states and 3464 transitions. [2023-11-29 06:56:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:56:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2023-11-29 06:56:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:59,344 INFO L225 Difference]: With dead ends: 2408 [2023-11-29 06:56:59,344 INFO L226 Difference]: Without dead ends: 2125 [2023-11-29 06:56:59,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:56:59,347 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 784 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:59,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 628 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:56:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-11-29 06:56:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2054. [2023-11-29 06:56:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1600 states have (on average 1.42875) internal successors, (2286), 1643 states have internal predecessors, (2286), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2023-11-29 06:56:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2934 transitions. [2023-11-29 06:56:59,494 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2934 transitions. Word has length 57 [2023-11-29 06:56:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:59,494 INFO L495 AbstractCegarLoop]: Abstraction has 2054 states and 2934 transitions. [2023-11-29 06:56:59,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 06:56:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2934 transitions. [2023-11-29 06:56:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:56:59,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:59,496 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 06:56:59,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:56:59,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:59,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1598588300, now seen corresponding path program 1 times [2023-11-29 06:56:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993330935] [2023-11-29 06:56:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:56:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:56:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:56:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:56:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:56:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 06:56:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:56:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:59,611 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 06:56:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:59,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993330935] [2023-11-29 06:56:59,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993330935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:56:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150158391] [2023-11-29 06:56:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:59,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:56:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:56:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:56:59,613 INFO L87 Difference]: Start difference. First operand 2054 states and 2934 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 06:57:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:00,491 INFO L93 Difference]: Finished difference Result 2662 states and 3804 transitions. [2023-11-29 06:57:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:57:00,492 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 06:57:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:00,506 INFO L225 Difference]: With dead ends: 2662 [2023-11-29 06:57:00,506 INFO L226 Difference]: Without dead ends: 2127 [2023-11-29 06:57:00,509 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 06:57:00,510 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 215 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:00,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1025 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:57:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2023-11-29 06:57:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2066. [2023-11-29 06:57:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 1609 states have (on average 1.4244872591671847) internal successors, (2292), 1652 states have internal predecessors, (2292), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2023-11-29 06:57:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2943 transitions. [2023-11-29 06:57:00,767 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2943 transitions. Word has length 58 [2023-11-29 06:57:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:00,767 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 2943 transitions. [2023-11-29 06:57:00,767 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 06:57:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2943 transitions. [2023-11-29 06:57:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:57:00,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:00,770 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 06:57:00,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:57:00,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:00,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1670974858, now seen corresponding path program 1 times [2023-11-29 06:57:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123957375] [2023-11-29 06:57:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:57:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:57:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 06:57:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:57:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:00,925 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 06:57:00,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123957375] [2023-11-29 06:57:00,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123957375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:00,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:00,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:57:00,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950042076] [2023-11-29 06:57:00,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:57:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:00,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:57:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:57:00,928 INFO L87 Difference]: Start difference. First operand 2066 states and 2943 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 06:57:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:02,873 INFO L93 Difference]: Finished difference Result 4065 states and 5858 transitions. [2023-11-29 06:57:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 06:57:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-11-29 06:57:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:02,887 INFO L225 Difference]: With dead ends: 4065 [2023-11-29 06:57:02,887 INFO L226 Difference]: Without dead ends: 2399 [2023-11-29 06:57:02,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 06:57:02,892 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 1153 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:02,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1339 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 06:57:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2023-11-29 06:57:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2269. [2023-11-29 06:57:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 1756 states have (on average 1.4071753986332574) internal successors, (2471), 1803 states have internal predecessors, (2471), 296 states have call successors, (296), 184 states have call predecessors, (296), 215 states have return successors, (434), 288 states have call predecessors, (434), 294 states have call successors, (434) [2023-11-29 06:57:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 3201 transitions. [2023-11-29 06:57:03,106 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 3201 transitions. Word has length 58 [2023-11-29 06:57:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:03,106 INFO L495 AbstractCegarLoop]: Abstraction has 2269 states and 3201 transitions. [2023-11-29 06:57:03,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 06:57:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 3201 transitions. [2023-11-29 06:57:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:57:03,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:03,109 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 06:57:03,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:57:03,109 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:03,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash -753332195, now seen corresponding path program 1 times [2023-11-29 06:57:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:03,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928071145] [2023-11-29 06:57:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:57:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:57:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:57:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:57:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:03,232 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 06:57:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928071145] [2023-11-29 06:57:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928071145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:03,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:57:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135313342] [2023-11-29 06:57:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:03,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:57:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:03,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:57:03,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:57:03,234 INFO L87 Difference]: Start difference. First operand 2269 states and 3201 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 06:57:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:04,018 INFO L93 Difference]: Finished difference Result 3152 states and 4440 transitions. [2023-11-29 06:57:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:57:04,018 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 06:57:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:04,030 INFO L225 Difference]: With dead ends: 3152 [2023-11-29 06:57:04,030 INFO L226 Difference]: Without dead ends: 2402 [2023-11-29 06:57:04,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:57:04,033 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 309 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:04,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 887 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:57:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2023-11-29 06:57:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2305. [2023-11-29 06:57:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1783 states have (on average 1.4010095344924285) internal successors, (2498), 1830 states have internal predecessors, (2498), 296 states have call successors, (296), 184 states have call predecessors, (296), 224 states have return successors, (443), 297 states have call predecessors, (443), 294 states have call successors, (443) [2023-11-29 06:57:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3237 transitions. [2023-11-29 06:57:04,193 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3237 transitions. Word has length 59 [2023-11-29 06:57:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:04,193 INFO L495 AbstractCegarLoop]: Abstraction has 2305 states and 3237 transitions. [2023-11-29 06:57:04,193 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 06:57:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3237 transitions. [2023-11-29 06:57:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:57:04,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:04,195 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 06:57:04,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:57:04,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:04,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash -612783585, now seen corresponding path program 1 times [2023-11-29 06:57:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:04,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741130615] [2023-11-29 06:57:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:57:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:57:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:57:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:57:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:04,325 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 06:57:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741130615] [2023-11-29 06:57:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741130615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:57:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643984244] [2023-11-29 06:57:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:04,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:57:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:57:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:04,327 INFO L87 Difference]: Start difference. First operand 2305 states and 3237 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 06:57:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:05,356 INFO L93 Difference]: Finished difference Result 3199 states and 4454 transitions. [2023-11-29 06:57:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:57:05,356 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 06:57:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:05,372 INFO L225 Difference]: With dead ends: 3199 [2023-11-29 06:57:05,372 INFO L226 Difference]: Without dead ends: 2493 [2023-11-29 06:57:05,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:57:05,376 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 562 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:05,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 720 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:57:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2023-11-29 06:57:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2312. [2023-11-29 06:57:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 1790 states have (on average 1.3983240223463687) internal successors, (2503), 1835 states have internal predecessors, (2503), 297 states have call successors, (297), 185 states have call predecessors, (297), 223 states have return successors, (439), 298 states have call predecessors, (439), 295 states have call successors, (439) [2023-11-29 06:57:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3239 transitions. [2023-11-29 06:57:05,615 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3239 transitions. Word has length 59 [2023-11-29 06:57:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:05,615 INFO L495 AbstractCegarLoop]: Abstraction has 2312 states and 3239 transitions. [2023-11-29 06:57:05,615 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 06:57:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3239 transitions. [2023-11-29 06:57:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:57:05,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:05,617 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 06:57:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:57:05,618 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:05,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1430432035, now seen corresponding path program 1 times [2023-11-29 06:57:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946704545] [2023-11-29 06:57:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:57:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:57:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:57:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:57:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:05,720 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 06:57:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:05,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946704545] [2023-11-29 06:57:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946704545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:57:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72342584] [2023-11-29 06:57:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:05,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:57:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:57:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:57:05,723 INFO L87 Difference]: Start difference. First operand 2312 states and 3239 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 06:57:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:06,495 INFO L93 Difference]: Finished difference Result 4034 states and 5598 transitions. [2023-11-29 06:57:06,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:57:06,497 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 06:57:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:06,513 INFO L225 Difference]: With dead ends: 4034 [2023-11-29 06:57:06,513 INFO L226 Difference]: Without dead ends: 3244 [2023-11-29 06:57:06,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:57:06,516 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 660 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:06,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 497 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:57:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2023-11-29 06:57:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 3086. [2023-11-29 06:57:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2369 states have (on average 1.3748417053609119) internal successors, (3257), 2427 states have internal predecessors, (3257), 401 states have call successors, (401), 249 states have call predecessors, (401), 314 states have return successors, (629), 419 states have call predecessors, (629), 399 states have call successors, (629) [2023-11-29 06:57:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4287 transitions. [2023-11-29 06:57:06,766 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4287 transitions. Word has length 59 [2023-11-29 06:57:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:06,767 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4287 transitions. [2023-11-29 06:57:06,767 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 06:57:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4287 transitions. [2023-11-29 06:57:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 06:57:06,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:06,769 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 06:57:06,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:57:06,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:06,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1175759513, now seen corresponding path program 1 times [2023-11-29 06:57:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975725523] [2023-11-29 06:57:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:57:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:57:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:57:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:57:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:57:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:06,829 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 06:57:06,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975725523] [2023-11-29 06:57:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975725523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:06,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:06,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:57:06,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532985416] [2023-11-29 06:57:06,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:06,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:57:06,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:06,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:57:06,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:57:06,831 INFO L87 Difference]: Start difference. First operand 3086 states and 4287 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 06:57:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:07,396 INFO L93 Difference]: Finished difference Result 4668 states and 6502 transitions. [2023-11-29 06:57:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:57:07,397 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 06:57:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:07,406 INFO L225 Difference]: With dead ends: 4668 [2023-11-29 06:57:07,406 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 06:57:07,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:57:07,415 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 410 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:07,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 442 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:57:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 06:57:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2023-11-29 06:57:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1169 states have (on average 1.4208725406330196) internal successors, (1661), 1201 states have internal predecessors, (1661), 194 states have call successors, (194), 120 states have call predecessors, (194), 136 states have return successors, (291), 182 states have call predecessors, (291), 194 states have call successors, (291) [2023-11-29 06:57:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2146 transitions. [2023-11-29 06:57:07,572 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2146 transitions. Word has length 60 [2023-11-29 06:57:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:07,572 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 2146 transitions. [2023-11-29 06:57:07,573 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 06:57:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2146 transitions. [2023-11-29 06:57:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 06:57:07,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:07,576 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] [2023-11-29 06:57:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:57:07,576 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:07,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash -254958315, now seen corresponding path program 1 times [2023-11-29 06:57:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316526307] [2023-11-29 06:57:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 06:57:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:57:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,672 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 06:57:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316526307] [2023-11-29 06:57:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316526307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755287381] [2023-11-29 06:57:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:07,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:07,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:57:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:07,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:57:07,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:07,818 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 06:57:07,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755287381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:07,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 06:57:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679435150] [2023-11-29 06:57:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:07,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:07,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:07,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:57:07,821 INFO L87 Difference]: Start difference. First operand 1500 states and 2146 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 06:57:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:08,017 INFO L93 Difference]: Finished difference Result 4317 states and 6275 transitions. [2023-11-29 06:57:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:08,018 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2023-11-29 06:57:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:08,033 INFO L225 Difference]: With dead ends: 4317 [2023-11-29 06:57:08,033 INFO L226 Difference]: Without dead ends: 2827 [2023-11-29 06:57:08,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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 06:57:08,039 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 107 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:08,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 339 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2023-11-29 06:57:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2023-11-29 06:57:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2212 states have (on average 1.4037070524412296) internal successors, (3105), 2261 states have internal predecessors, (3105), 353 states have call successors, (353), 226 states have call predecessors, (353), 261 states have return successors, (590), 347 states have call predecessors, (590), 353 states have call successors, (590) [2023-11-29 06:57:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4048 transitions. [2023-11-29 06:57:08,224 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4048 transitions. Word has length 83 [2023-11-29 06:57:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:08,225 INFO L495 AbstractCegarLoop]: Abstraction has 2827 states and 4048 transitions. [2023-11-29 06:57:08,225 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 06:57:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4048 transitions. [2023-11-29 06:57:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 06:57:08,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:08,230 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] [2023-11-29 06:57:08,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:57:08,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 06:57:08,431 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:08,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1397568783, now seen corresponding path program 1 times [2023-11-29 06:57:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569515239] [2023-11-29 06:57:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 06:57:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 06:57:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:57:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,524 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 06:57:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569515239] [2023-11-29 06:57:08,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569515239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790517447] [2023-11-29 06:57:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:08,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:08,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:08,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:08,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:57:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:08,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:57:08,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:08,730 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 06:57:08,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790517447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 06:57:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282656457] [2023-11-29 06:57:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:08,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:57:08,733 INFO L87 Difference]: Start difference. First operand 2827 states and 4048 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 06:57:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:09,090 INFO L93 Difference]: Finished difference Result 6364 states and 9215 transitions. [2023-11-29 06:57:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:09,090 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-11-29 06:57:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:09,112 INFO L225 Difference]: With dead ends: 6364 [2023-11-29 06:57:09,112 INFO L226 Difference]: Without dead ends: 4225 [2023-11-29 06:57:09,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 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 06:57:09,119 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:09,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2023-11-29 06:57:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4183. [2023-11-29 06:57:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 3278 states have (on average 1.400549115314216) internal successors, (4591), 3348 states have internal predecessors, (4591), 517 states have call successors, (517), 336 states have call predecessors, (517), 387 states have return successors, (834), 506 states have call predecessors, (834), 517 states have call successors, (834) [2023-11-29 06:57:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5942 transitions. [2023-11-29 06:57:09,396 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5942 transitions. Word has length 106 [2023-11-29 06:57:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:09,397 INFO L495 AbstractCegarLoop]: Abstraction has 4183 states and 5942 transitions. [2023-11-29 06:57:09,397 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 06:57:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5942 transitions. [2023-11-29 06:57:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:57:09,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:09,404 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] [2023-11-29 06:57:09,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:57:09,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 06:57:09,605 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:09,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash -687488582, now seen corresponding path program 1 times [2023-11-29 06:57:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220831371] [2023-11-29 06:57:09,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:57:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 06:57:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 06:57:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 06:57:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,720 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 06:57:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220831371] [2023-11-29 06:57:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220831371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391656038] [2023-11-29 06:57:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:09,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:09,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:57:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:09,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:57:09,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:09,867 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 06:57:09,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:09,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391656038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:09,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:09,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 06:57:09,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198806033] [2023-11-29 06:57:09,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:09,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:09,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:09,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:09,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:57:09,869 INFO L87 Difference]: Start difference. First operand 4183 states and 5942 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, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 06:57:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:10,202 INFO L93 Difference]: Finished difference Result 8759 states and 12689 transitions. [2023-11-29 06:57:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:10,202 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, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2023-11-29 06:57:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:10,219 INFO L225 Difference]: With dead ends: 8759 [2023-11-29 06:57:10,220 INFO L226 Difference]: Without dead ends: 4587 [2023-11-29 06:57:10,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 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 06:57:10,229 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 112 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:10,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2023-11-29 06:57:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4492. [2023-11-29 06:57:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3562 states have (on average 1.3329590117911285) internal successors, (4748), 3627 states have internal predecessors, (4748), 513 states have call successors, (513), 362 states have call predecessors, (513), 416 states have return successors, (816), 510 states have call predecessors, (816), 513 states have call successors, (816) [2023-11-29 06:57:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6077 transitions. [2023-11-29 06:57:10,569 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6077 transitions. Word has length 121 [2023-11-29 06:57:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:10,569 INFO L495 AbstractCegarLoop]: Abstraction has 4492 states and 6077 transitions. [2023-11-29 06:57:10,569 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, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 06:57:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6077 transitions. [2023-11-29 06:57:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:57:10,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:10,576 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] [2023-11-29 06:57:10,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:57:10,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 06:57:10,777 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:10,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash -48704103, now seen corresponding path program 2 times [2023-11-29 06:57:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007098661] [2023-11-29 06:57:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:57:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 06:57:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 06:57:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 06:57:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:10,867 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 06:57:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007098661] [2023-11-29 06:57:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007098661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598313742] [2023-11-29 06:57:10,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:57:10,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:10,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:10,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:10,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:57:10,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:57:10,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:57:10,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:57:10,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 06:57:10,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598313742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-11-29 06:57:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91602040] [2023-11-29 06:57:10,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:10,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:57:10,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:10,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:57:10,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:10,989 INFO L87 Difference]: Start difference. First operand 4492 states and 6077 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 06:57:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:11,391 INFO L93 Difference]: Finished difference Result 9011 states and 12512 transitions. [2023-11-29 06:57:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:57:11,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 121 [2023-11-29 06:57:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:11,408 INFO L225 Difference]: With dead ends: 9011 [2023-11-29 06:57:11,409 INFO L226 Difference]: Without dead ends: 4532 [2023-11-29 06:57:11,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:11,422 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:11,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2023-11-29 06:57:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4512. [2023-11-29 06:57:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3582 states have (on average 1.3101619207146846) internal successors, (4693), 3647 states have internal predecessors, (4693), 513 states have call successors, (513), 362 states have call predecessors, (513), 416 states have return successors, (816), 510 states have call predecessors, (816), 513 states have call successors, (816) [2023-11-29 06:57:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6022 transitions. [2023-11-29 06:57:11,759 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6022 transitions. Word has length 121 [2023-11-29 06:57:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:11,759 INFO L495 AbstractCegarLoop]: Abstraction has 4512 states and 6022 transitions. [2023-11-29 06:57:11,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 06:57:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6022 transitions. [2023-11-29 06:57:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:57:11,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:11,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:11,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:57:11,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 06:57:11,976 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:11,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -502757219, now seen corresponding path program 1 times [2023-11-29 06:57:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277627596] [2023-11-29 06:57:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:57:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 06:57:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 06:57:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 06:57:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-29 06:57:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277627596] [2023-11-29 06:57:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277627596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:12,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:12,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:57:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33452930] [2023-11-29 06:57:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:57:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:12,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:57:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:12,154 INFO L87 Difference]: Start difference. First operand 4512 states and 6022 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:57:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:12,929 INFO L93 Difference]: Finished difference Result 7264 states and 9616 transitions. [2023-11-29 06:57:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:57:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2023-11-29 06:57:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:12,940 INFO L225 Difference]: With dead ends: 7264 [2023-11-29 06:57:12,940 INFO L226 Difference]: Without dead ends: 4457 [2023-11-29 06:57:12,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:57:12,947 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 338 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:12,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 334 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:57:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2023-11-29 06:57:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 3771. [2023-11-29 06:57:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 2996 states have (on average 1.2880507343124166) internal successors, (3859), 3058 states have internal predecessors, (3859), 419 states have call successors, (419), 292 states have call predecessors, (419), 355 states have return successors, (687), 424 states have call predecessors, (687), 419 states have call successors, (687) [2023-11-29 06:57:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 4965 transitions. [2023-11-29 06:57:13,237 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 4965 transitions. Word has length 121 [2023-11-29 06:57:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:13,237 INFO L495 AbstractCegarLoop]: Abstraction has 3771 states and 4965 transitions. [2023-11-29 06:57:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:57:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 4965 transitions. [2023-11-29 06:57:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:57:13,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:13,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:13,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:57:13,243 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:13,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1374306011, now seen corresponding path program 1 times [2023-11-29 06:57:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863614289] [2023-11-29 06:57:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:13,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:57:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 06:57:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 06:57:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 06:57:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-29 06:57:13,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:13,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863614289] [2023-11-29 06:57:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863614289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:13,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:13,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:57:13,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334700582] [2023-11-29 06:57:13,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:13,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:57:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:57:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:13,417 INFO L87 Difference]: Start difference. First operand 3771 states and 4965 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:57:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:14,218 INFO L93 Difference]: Finished difference Result 6913 states and 9082 transitions. [2023-11-29 06:57:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:57:14,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2023-11-29 06:57:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:14,228 INFO L225 Difference]: With dead ends: 6913 [2023-11-29 06:57:14,228 INFO L226 Difference]: Without dead ends: 4016 [2023-11-29 06:57:14,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:57:14,236 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 331 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:14,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 353 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:57:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2023-11-29 06:57:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3306. [2023-11-29 06:57:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 2630 states have (on average 1.2927756653992395) internal successors, (3400), 2675 states have internal predecessors, (3400), 371 states have call successors, (371), 256 states have call predecessors, (371), 304 states have return successors, (601), 376 states have call predecessors, (601), 371 states have call successors, (601) [2023-11-29 06:57:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4372 transitions. [2023-11-29 06:57:14,548 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4372 transitions. Word has length 121 [2023-11-29 06:57:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:14,549 INFO L495 AbstractCegarLoop]: Abstraction has 3306 states and 4372 transitions. [2023-11-29 06:57:14,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:57:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4372 transitions. [2023-11-29 06:57:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:57:14,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:14,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:14,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:57:14,553 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:14,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash 603572445, now seen corresponding path program 1 times [2023-11-29 06:57:14,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:14,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329632381] [2023-11-29 06:57:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:57:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 06:57:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 06:57:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 06:57:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 06:57:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329632381] [2023-11-29 06:57:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329632381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116285853] [2023-11-29 06:57:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:14,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:14,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:14,637 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:14,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:57:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:14,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:57:14,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:14,784 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 06:57:14,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116285853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:14,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-29 06:57:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20479027] [2023-11-29 06:57:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:14,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:14,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:14,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:57:14,787 INFO L87 Difference]: Start difference. First operand 3306 states and 4372 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 06:57:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:15,008 INFO L93 Difference]: Finished difference Result 6579 states and 8730 transitions. [2023-11-29 06:57:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 121 [2023-11-29 06:57:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:15,018 INFO L225 Difference]: With dead ends: 6579 [2023-11-29 06:57:15,018 INFO L226 Difference]: Without dead ends: 3469 [2023-11-29 06:57:15,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:57:15,026 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:15,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 251 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2023-11-29 06:57:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3285. [2023-11-29 06:57:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 2609 states have (on average 1.2709850517439631) internal successors, (3316), 2654 states have internal predecessors, (3316), 371 states have call successors, (371), 256 states have call predecessors, (371), 304 states have return successors, (601), 376 states have call predecessors, (601), 371 states have call successors, (601) [2023-11-29 06:57:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4288 transitions. [2023-11-29 06:57:15,360 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4288 transitions. Word has length 121 [2023-11-29 06:57:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:15,360 INFO L495 AbstractCegarLoop]: Abstraction has 3285 states and 4288 transitions. [2023-11-29 06:57:15,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 06:57:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4288 transitions. [2023-11-29 06:57:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 06:57:15,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:15,364 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] [2023-11-29 06:57:15,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:57:15,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:15,565 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:15,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 718626576, now seen corresponding path program 1 times [2023-11-29 06:57:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993582004] [2023-11-29 06:57:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 06:57:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 06:57:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 06:57:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 06:57:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 06:57:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993582004] [2023-11-29 06:57:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993582004] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500342696] [2023-11-29 06:57:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:15,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:15,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:15,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:57:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:15,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:57:15,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:15,846 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 06:57:15,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500342696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:15,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:15,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-29 06:57:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279447892] [2023-11-29 06:57:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:15,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:15,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:15,848 INFO L87 Difference]: Start difference. First operand 3285 states and 4288 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 06:57:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:16,288 INFO L93 Difference]: Finished difference Result 9587 states and 12512 transitions. [2023-11-29 06:57:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:16,288 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-11-29 06:57:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:16,303 INFO L225 Difference]: With dead ends: 9587 [2023-11-29 06:57:16,303 INFO L226 Difference]: Without dead ends: 6317 [2023-11-29 06:57:16,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:16,313 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 105 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:16,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 320 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2023-11-29 06:57:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5827. [2023-11-29 06:57:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5827 states, 4632 states have (on average 1.2538860103626943) internal successors, (5808), 4716 states have internal predecessors, (5808), 659 states have call successors, (659), 460 states have call predecessors, (659), 535 states have return successors, (1019), 654 states have call predecessors, (1019), 659 states have call successors, (1019) [2023-11-29 06:57:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 7486 transitions. [2023-11-29 06:57:16,752 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 7486 transitions. Word has length 122 [2023-11-29 06:57:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 5827 states and 7486 transitions. [2023-11-29 06:57:16,752 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 06:57:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 7486 transitions. [2023-11-29 06:57:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 06:57:16,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:16,755 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] [2023-11-29 06:57:16,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:57:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:16,956 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:16,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -450238612, now seen corresponding path program 1 times [2023-11-29 06:57:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789374959] [2023-11-29 06:57:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:16,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 06:57:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:57:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:57:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 06:57:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 06:57:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789374959] [2023-11-29 06:57:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789374959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68881173] [2023-11-29 06:57:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:17,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:17,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:17,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 06:57:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:17,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:57:17,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:17,202 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 06:57:17,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68881173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-29 06:57:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845609267] [2023-11-29 06:57:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:17,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:57:17,204 INFO L87 Difference]: Start difference. First operand 5827 states and 7486 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 06:57:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:17,567 INFO L93 Difference]: Finished difference Result 8479 states and 11186 transitions. [2023-11-29 06:57:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:17,568 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-29 06:57:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:17,576 INFO L225 Difference]: With dead ends: 8479 [2023-11-29 06:57:17,577 INFO L226 Difference]: Without dead ends: 5363 [2023-11-29 06:57:17,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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 06:57:17,584 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:17,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 312 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2023-11-29 06:57:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 5297. [2023-11-29 06:57:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5297 states, 4215 states have (on average 1.231079478054567) internal successors, (5189), 4293 states have internal predecessors, (5189), 601 states have call successors, (601), 420 states have call predecessors, (601), 480 states have return successors, (885), 587 states have call predecessors, (885), 601 states have call successors, (885) [2023-11-29 06:57:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 6675 transitions. [2023-11-29 06:57:17,916 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 6675 transitions. Word has length 123 [2023-11-29 06:57:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:17,917 INFO L495 AbstractCegarLoop]: Abstraction has 5297 states and 6675 transitions. [2023-11-29 06:57:17,917 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 06:57:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 6675 transitions. [2023-11-29 06:57:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 06:57:17,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:17,921 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] [2023-11-29 06:57:17,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 06:57:18,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 06:57:18,122 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:18,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1360454050, now seen corresponding path program 1 times [2023-11-29 06:57:18,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:18,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996148972] [2023-11-29 06:57:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 06:57:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:57:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:57:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 06:57:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,241 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 06:57:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996148972] [2023-11-29 06:57:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996148972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670022996] [2023-11-29 06:57:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:18,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:18,243 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:18,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 06:57:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:18,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:57:18,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:18,356 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 06:57:18,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670022996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:18,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 06:57:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407296327] [2023-11-29 06:57:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:18,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:57:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:57:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:57:18,358 INFO L87 Difference]: Start difference. First operand 5297 states and 6675 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 06:57:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:18,717 INFO L93 Difference]: Finished difference Result 10269 states and 13171 transitions. [2023-11-29 06:57:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:57:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-11-29 06:57:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:18,724 INFO L225 Difference]: With dead ends: 10269 [2023-11-29 06:57:18,725 INFO L226 Difference]: Without dead ends: 4117 [2023-11-29 06:57:18,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 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 06:57:18,733 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 11 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:18,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2023-11-29 06:57:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3995. [2023-11-29 06:57:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3203 states have (on average 1.2182329066500157) internal successors, (3902), 3253 states have internal predecessors, (3902), 443 states have call successors, (443), 317 states have call predecessors, (443), 348 states have return successors, (581), 426 states have call predecessors, (581), 443 states have call successors, (581) [2023-11-29 06:57:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 4926 transitions. [2023-11-29 06:57:18,968 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 4926 transitions. Word has length 124 [2023-11-29 06:57:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:18,968 INFO L495 AbstractCegarLoop]: Abstraction has 3995 states and 4926 transitions. [2023-11-29 06:57:18,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 06:57:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 4926 transitions. [2023-11-29 06:57:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 06:57:18,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:18,971 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] [2023-11-29 06:57:18,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 06:57:19,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 06:57:19,172 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:19,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 865400034, now seen corresponding path program 1 times [2023-11-29 06:57:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103475618] [2023-11-29 06:57:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 06:57:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:57:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:57:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 06:57:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:19,276 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 06:57:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103475618] [2023-11-29 06:57:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103475618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:57:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564321921] [2023-11-29 06:57:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:19,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:57:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:57:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:57:19,279 INFO L87 Difference]: Start difference. First operand 3995 states and 4926 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 06:57:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:20,300 INFO L93 Difference]: Finished difference Result 8449 states and 10385 transitions. [2023-11-29 06:57:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:57:20,301 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), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2023-11-29 06:57:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:20,311 INFO L225 Difference]: With dead ends: 8449 [2023-11-29 06:57:20,311 INFO L226 Difference]: Without dead ends: 4944 [2023-11-29 06:57:20,317 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 06:57:20,318 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 384 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:20,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 349 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:57:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2023-11-29 06:57:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4429. [2023-11-29 06:57:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4429 states, 3562 states have (on average 1.2139247613700168) internal successors, (4324), 3611 states have internal predecessors, (4324), 475 states have call successors, (475), 337 states have call predecessors, (475), 391 states have return successors, (610), 482 states have call predecessors, (610), 475 states have call successors, (610) [2023-11-29 06:57:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 5409 transitions. [2023-11-29 06:57:20,628 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 5409 transitions. Word has length 124 [2023-11-29 06:57:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:20,629 INFO L495 AbstractCegarLoop]: Abstraction has 4429 states and 5409 transitions. [2023-11-29 06:57:20,629 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), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 06:57:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 5409 transitions. [2023-11-29 06:57:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 06:57:20,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:20,634 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:57:20,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 06:57:20,634 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:20,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1490897935, now seen corresponding path program 1 times [2023-11-29 06:57:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691139763] [2023-11-29 06:57:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 06:57:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:57:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:57:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:57:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:57:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 06:57:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 06:57:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 06:57:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 06:57:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 06:57:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691139763] [2023-11-29 06:57:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691139763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312795017] [2023-11-29 06:57:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:20,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:20,840 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:20,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 06:57:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:20,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:57:20,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 06:57:20,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312795017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:20,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-29 06:57:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480921274] [2023-11-29 06:57:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:20,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:57:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:57:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:20,987 INFO L87 Difference]: Start difference. First operand 4429 states and 5409 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 06:57:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:21,430 INFO L93 Difference]: Finished difference Result 9715 states and 11926 transitions. [2023-11-29 06:57:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:57:21,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2023-11-29 06:57:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:21,440 INFO L225 Difference]: With dead ends: 9715 [2023-11-29 06:57:21,440 INFO L226 Difference]: Without dead ends: 6120 [2023-11-29 06:57:21,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:57:21,445 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 116 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:21,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 279 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:57:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2023-11-29 06:57:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6117. [2023-11-29 06:57:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 4913 states have (on average 1.2116832892326481) internal successors, (5953), 4976 states have internal predecessors, (5953), 664 states have call successors, (664), 471 states have call predecessors, (664), 539 states have return successors, (862), 671 states have call predecessors, (862), 664 states have call successors, (862) [2023-11-29 06:57:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 7479 transitions. [2023-11-29 06:57:21,828 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 7479 transitions. Word has length 142 [2023-11-29 06:57:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:21,828 INFO L495 AbstractCegarLoop]: Abstraction has 6117 states and 7479 transitions. [2023-11-29 06:57:21,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 06:57:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 7479 transitions. [2023-11-29 06:57:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 06:57:21,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:21,832 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:57:21,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 06:57:22,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 06:57:22,033 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:22,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1983524109, now seen corresponding path program 1 times [2023-11-29 06:57:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383519622] [2023-11-29 06:57:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:57:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:57:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:57:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 06:57:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 06:57:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:57:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:57:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:57:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:57:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 06:57:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 06:57:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 06:57:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 06:57:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 06:57:22,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383519622] [2023-11-29 06:57:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383519622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941651956] [2023-11-29 06:57:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:22,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:57:22,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:22,185 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:57:22,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 06:57:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:22,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:57:22,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 06:57:22,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:57:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941651956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:57:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-29 06:57:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779664228] [2023-11-29 06:57:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:22,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:57:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:57:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:57:22,421 INFO L87 Difference]: Start difference. First operand 6117 states and 7479 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:57:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:22,765 INFO L93 Difference]: Finished difference Result 9036 states and 11156 transitions. [2023-11-29 06:57:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:57:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 142 [2023-11-29 06:57:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:22,766 INFO L225 Difference]: With dead ends: 9036 [2023-11-29 06:57:22,766 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:57:22,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:57:22,773 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 104 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:22,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 121 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:57:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:57:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:57:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:57:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:57:22,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2023-11-29 06:57:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:22,777 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:57:22,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:57:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:57:22,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:57:22,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 06:57:22,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 06:57:22,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 06:57:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 06:57:22,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:58:24,407 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2023-11-29 06:58:24,408 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2023-11-29 06:58:24,408 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 915 925) the Hoare annotation is: (let ((.cse8 (< ~E_M~0 2)) (.cse9 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (< |old(~m_st~0)| 2)) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (< ~E_1~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 (= |old(~t1_st~0)| 0) .cse4 .cse5 .cse6 .cse7 (not (= (+ ~local~0 1) ~token~0))) (or .cse0 (< 0 ~t1_pc~0) .cse1 .cse8 .cse3 .cse4 (= ~m_pc~0 1) .cse6 .cse9) (or .cse0 .cse1 (< |old(~t1_st~0)| 2) .cse2 .cse8 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))))) [2023-11-29 06:58:24,408 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-11-29 06:58:24,408 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2023-11-29 06:58:24,408 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-11-29 06:58:24,408 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2023-11-29 06:58:24,409 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (< ~p_dw_pc~0 1)) (.cse7 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse7))) [2023-11-29 06:58:24,409 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2023-11-29 06:58:24,409 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2023-11-29 06:58:24,409 INFO L899 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2023-11-29 06:58:24,409 INFO L899 garLoopResultBuilder]: For program point L733(lines 721 735) no Hoare annotation was computed. [2023-11-29 06:58:24,409 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 890 914) the Hoare annotation is: (let ((.cse11 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (not (= (+ ~local~0 1) ~token~0))) (.cse1 (< 0 ~t1_pc~0)) (.cse5 (= ~m_pc~0 1)) (.cse12 (< |old(~t1_st~0)| 2)) (.cse9 (< ~E_M~0 2)) (.cse10 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse11 (= ~m_st~0 |old(~m_st~0)|))) (.cse13 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse6 (< |old(~m_st~0)| 2)) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (< ~E_1~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10) (or (and .cse11 (= ~m_st~0 0)) .cse0 .cse12 .cse13 .cse9 .cse3 .cse4 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse14) (or .cse0 .cse2 .cse13 .cse3 (= |old(~t1_st~0)| 0) .cse4 .cse6 .cse7 .cse8 .cse14) (or .cse0 .cse2 .cse13 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7 .cse10) (or .cse0 .cse2 .cse12 .cse13 .cse9 .cse3 .cse4 .cse7 .cse10) (or .cse0 .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 .cse8 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)))))) [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L714(lines 702 716) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2023-11-29 06:58:24,410 INFO L899 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2023-11-29 06:58:24,411 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-11-29 06:58:24,411 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2023-11-29 06:58:24,411 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-11-29 06:58:24,411 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2023-11-29 06:58:24,411 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-11-29 06:58:24,411 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: (let ((.cse7 (< ~p_dw_pc~0 1)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) [2023-11-29 06:58:24,411 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse7 (< ~p_dw_pc~0 1)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) [2023-11-29 06:58:24,412 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse8 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse11 (not (= ~p_dw_pc~0 0))) (.cse13 (and .cse8 (= activate_threads1_~tmp~1 0) .cse3)) (.cse9 (= ~p_dw_pc~0 1)) (.cse12 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse14 (and .cse8 .cse3)) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse7 (< ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |old(~p_dw_st~0)| 0))) (or .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse10) (or .cse0 .cse1 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13) (or .cse0 .cse1 .cse4 .cse11 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6 .cse13) (or .cse0 .cse1 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse12 .cse10) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7)))) [2023-11-29 06:58:24,412 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-11-29 06:58:24,412 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2023-11-29 06:58:24,412 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2023-11-29 06:58:24,412 INFO L899 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2023-11-29 06:58:24,412 INFO L899 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2023-11-29 06:58:24,412 INFO L899 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2023-11-29 06:58:24,412 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 834 861) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 ~local~0))) (.cse10 (< 0 ~t1_pc~0)) (.cse13 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (< ~t1_st~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (< ~m_st~0 2)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (< |old(~E_1~0)| 2)) (.cse7 (< |old(~E_M~0)| 2)) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= (+ ~local~0 1) ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse13 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse14) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14))) [2023-11-29 06:58:24,412 INFO L899 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse4 (= ~m_pc~0 1)) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (< ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse8))) [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-11-29 06:58:24,413 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-11-29 06:58:24,414 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L895 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 663 698) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point L799-1(lines 789 827) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 (<= 1 ~p_dw_pc~0) .cse4 .cse5))))) (or (and (= ~c_dr_pc~0 0) .cse0) (and (= ~c_dr_pc~0 1) .cse0))) [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 992 1050) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 619 662) no Hoare annotation was computed. [2023-11-29 06:58:24,415 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,415 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L895 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L802-2(lines 802 809) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2023-11-29 06:58:24,416 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-11-29 06:58:24,417 INFO L895 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9))) [2023-11-29 06:58:24,417 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9))) [2023-11-29 06:58:24,417 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 783 833) no Hoare annotation was computed. [2023-11-29 06:58:24,417 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,417 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-11-29 06:58:24,417 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-11-29 06:58:24,417 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-11-29 06:58:24,417 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9))) [2023-11-29 06:58:24,417 INFO L895 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~token~0 ~local~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= ~m_pc~0 1)) (<= ~t1_pc~0 0) .cse3 .cse4 .cse5))) [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 203 261) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 369 386) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-11-29 06:58:24,418 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,418 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,419 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-11-29 06:58:24,419 INFO L895 garLoopResultBuilder]: At program point L1007-1(lines 1007 1044) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,419 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,419 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2023-11-29 06:58:24,419 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2023-11-29 06:58:24,419 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 678 691) the Hoare annotation is: (let ((.cse8 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= (+ ~local~0 1) ~token~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-29 06:58:24,419 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,419 INFO L899 garLoopResultBuilder]: For program point L480(lines 469 482) no Hoare annotation was computed. [2023-11-29 06:58:24,420 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-11-29 06:58:24,420 INFO L899 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2023-11-29 06:58:24,420 INFO L895 garLoopResultBuilder]: At program point L813-1(lines 789 827) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,420 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 634 655) the Hoare annotation is: (let ((.cse6 (not (= ~m_pc~0 1))) (.cse9 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse7 .cse8))) [2023-11-29 06:58:24,420 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-11-29 06:58:24,420 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-11-29 06:58:24,420 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 1) .cse4 .cse5) (and .cse1 .cse2 .cse3 (<= 1 ~p_dw_pc~0) .cse4 .cse5))) [2023-11-29 06:58:24,421 INFO L895 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L286-1(lines 277 294) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2023-11-29 06:58:24,421 INFO L899 garLoopResultBuilder]: For program point L816-2(lines 816 823) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L895 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-11-29 06:58:24,422 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2023-11-29 06:58:24,423 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 353 368) no Hoare annotation was computed. [2023-11-29 06:58:24,423 INFO L899 garLoopResultBuilder]: For program point L754-1(lines 745 762) no Hoare annotation was computed. [2023-11-29 06:58:24,423 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0))))) [2023-11-29 06:58:24,423 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-11-29 06:58:24,423 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2023-11-29 06:58:24,423 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-11-29 06:58:24,423 INFO L895 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,423 INFO L895 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,424 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2023-11-29 06:58:24,424 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,424 INFO L899 garLoopResultBuilder]: For program point L954-1(lines 935 962) no Hoare annotation was computed. [2023-11-29 06:58:24,424 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-11-29 06:58:24,424 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-11-29 06:58:24,424 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:58:24,424 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,424 INFO L899 garLoopResultBuilder]: For program point L988(lines 977 990) no Hoare annotation was computed. [2023-11-29 06:58:24,425 INFO L895 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 06:58:24,425 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-11-29 06:58:24,425 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2023-11-29 06:58:24,425 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-11-29 06:58:24,425 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-11-29 06:58:24,425 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-11-29 06:58:24,425 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2023-11-29 06:58:24,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point $Ultimate##115(lines 648 654) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-11-29 06:58:24,426 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point L311(lines 298 313) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2023-11-29 06:58:24,427 INFO L899 garLoopResultBuilder]: For program point L779(lines 766 781) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 763 782) the Hoare annotation is: true [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse4 (= ~m_pc~0 1)) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (< ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse8))) [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2023-11-29 06:58:24,428 INFO L899 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2023-11-29 06:58:24,429 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 862 889) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 ~local~0))) (.cse10 (< 0 ~t1_pc~0)) (.cse13 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (< ~t1_st~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (< ~m_st~0 2)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (< |old(~E_1~0)| 2)) (.cse7 (< |old(~E_M~0)| 2)) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= (+ ~local~0 1) ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse13 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse14) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14))) [2023-11-29 06:58:24,429 INFO L899 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2023-11-29 06:58:24,432 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] [2023-11-29 06:58:24,434 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:58:24,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:58:24 BoogieIcfgContainer [2023-11-29 06:58:24,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:58:24,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:58:24,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:58:24,461 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:58:24,461 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:50" (3/4) ... [2023-11-29 06:58:24,464 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:58:24,467 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-11-29 06:58:24,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-29 06:58:24,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-29 06:58:24,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-29 06:58:24,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-29 06:58:24,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-29 06:58:24,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-11-29 06:58:24,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-29 06:58:24,484 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2023-11-29 06:58:24,485 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 06:58:24,487 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:58:24,488 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:58:24,651 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:58:24,652 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:58:24,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:58:24,653 INFO L158 Benchmark]: Toolchain (without parser) took 95424.37ms. Allocated memory was 121.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 77.7MB in the beginning and 780.6MB in the end (delta: -702.9MB). Peak memory consumption was 691.7MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,653 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 89.2MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:58:24,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.95ms. Allocated memory is still 121.6MB. Free memory was 77.7MB in the beginning and 60.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.55ms. Allocated memory is still 121.6MB. Free memory was 59.7MB in the beginning and 57.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,654 INFO L158 Benchmark]: Boogie Preprocessor took 77.06ms. Allocated memory was 121.6MB in the beginning and 163.6MB in the end (delta: 41.9MB). Free memory was 57.1MB in the beginning and 134.9MB in the end (delta: -77.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,654 INFO L158 Benchmark]: RCFGBuilder took 662.51ms. Allocated memory is still 163.6MB. Free memory was 134.8MB in the beginning and 103.0MB in the end (delta: 31.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,654 INFO L158 Benchmark]: TraceAbstraction took 94071.63ms. Allocated memory was 163.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 102.0MB in the beginning and 792.2MB in the end (delta: -690.2MB). Peak memory consumption was 908.8MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,655 INFO L158 Benchmark]: Witness Printer took 191.53ms. Allocated memory is still 1.5GB. Free memory was 792.2MB in the beginning and 780.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 06:58:24,656 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.17ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 89.2MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.95ms. Allocated memory is still 121.6MB. Free memory was 77.7MB in the beginning and 60.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.55ms. Allocated memory is still 121.6MB. Free memory was 59.7MB in the beginning and 57.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.06ms. Allocated memory was 121.6MB in the beginning and 163.6MB in the end (delta: 41.9MB). Free memory was 57.1MB in the beginning and 134.9MB in the end (delta: -77.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * RCFGBuilder took 662.51ms. Allocated memory is still 163.6MB. Free memory was 134.8MB in the beginning and 103.0MB in the end (delta: 31.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 94071.63ms. Allocated memory was 163.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 102.0MB in the beginning and 792.2MB in the end (delta: -690.2MB). Peak memory consumption was 908.8MB. Max. memory is 16.1GB. * Witness Printer took 191.53ms. Allocated memory is still 1.5GB. Free memory was 792.2MB in the beginning and 780.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 199 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 94.0s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9936 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9665 mSDsluCounter, 13892 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9636 mSDsCounter, 2080 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13498 IncrementalHoareTripleChecker+Invalid, 15578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2080 mSolverCounterUnsat, 4256 mSDtfsCounter, 13498 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2026 GetRequests, 1732 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6117occurred in iteration=25, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4297 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 7154 PreInvPairs, 8271 NumberOfFragments, 6425 HoareAnnotationTreeSize, 7154 FomulaSimplifications, 834116 FormulaSimplificationTreeSizeReduction, 49.4s HoareSimplificationTime, 52 FomulaSimplificationsInter, 89650 FormulaSimplificationTreeSizeReductionInter, 11.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3504 NumberOfCodeBlocks, 3432 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3468 ConstructedInterpolants, 0 QuantifiedInterpolants, 6314 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4007 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 36 InterpolantComputations, 26 PerfectInterpolantSequences, 1485/1626 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2)) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((c_dr_pc == 0) && (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (E_M == 2)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (E_M == 2)) && (M_E == 2)))) || ((c_dr_pc == 1) && (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (E_M == 2)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (E_M == 2)) && (M_E == 2))))) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (p_dw_st == 0)) && (c_dr_pc == 0))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2)) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2))) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0))) && (token == local)) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0))) && (token == local))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0)))) || (((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0)))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2)) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2))) || ((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (E_M == 2)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-11-29 06:58:24,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60674a82-80a2-4999-bc39-8f8f1108397e/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 Result: TRUE