./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:47,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:47,908 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:51:47,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:47,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:47,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:47,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:47,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:47,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:47,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:47,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:47,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:47,944 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:47,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:47,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:51:47,946 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:47,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:47,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:47,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:47,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:51:47,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:47,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:51:47,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:47,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:51:47,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:47,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:47,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:47,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:47,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:47,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:47,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:47,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:51:47,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:51:47,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:51:47,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:47,964 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:51:47,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:47,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:47,964 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:47,965 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_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/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_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2023-11-06 22:51:48,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:48,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:48,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:48,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:48,271 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:48,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2023-11-06 22:51:51,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:51:51,648 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:51:51,649 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2023-11-06 22:51:51,660 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/data/9d63abf65/c027ddffcbbe456582962195c8c07e34/FLAGaca2d1e53 [2023-11-06 22:51:51,675 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/data/9d63abf65/c027ddffcbbe456582962195c8c07e34 [2023-11-06 22:51:51,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:51:51,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:51:51,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:51,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:51:51,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:51:51,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:51" (1/1) ... [2023-11-06 22:51:51,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f077ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:51, skipping insertion in model container [2023-11-06 22:51:51,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:51" (1/1) ... [2023-11-06 22:51:51,726 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:51:51,906 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_c903b96c-4ff5-4514-adb2-15bb8fdff26a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2023-11-06 22:51:51,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:51,983 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:51:51,996 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_c903b96c-4ff5-4514-adb2-15bb8fdff26a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2023-11-06 22:51:52,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:52,044 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:51:52,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52 WrapperNode [2023-11-06 22:51:52,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:52,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:52,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:51:52,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:51:52,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,088 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 189 [2023-11-06 22:51:52,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:52,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:51:52,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:51:52,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:51:52,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:51:52,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:51:52,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:51:52,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:51:52,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (1/1) ... [2023-11-06 22:51:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:52,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:52,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:51:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:51:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 22:51:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 22:51:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-06 22:51:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-06 22:51:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 22:51:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 22:51:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 22:51:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 22:51:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 22:51:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 22:51:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 22:51:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 22:51:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:51:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 22:51:52,207 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 22:51:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:51:52,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:51:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-06 22:51:52,208 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-06 22:51:52,282 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:51:52,285 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:51:52,625 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:51:52,633 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:51:52,633 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:51:52,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:52 BoogieIcfgContainer [2023-11-06 22:51:52,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:51:52,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:51:52,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:51:52,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:51:52,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:51" (1/3) ... [2023-11-06 22:51:52,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f6c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:52, skipping insertion in model container [2023-11-06 22:51:52,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:52" (2/3) ... [2023-11-06 22:51:52,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f6c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:52, skipping insertion in model container [2023-11-06 22:51:52,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:52" (3/3) ... [2023-11-06 22:51:52,645 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2023-11-06 22:51:52,668 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:51:52,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:51:52,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:51:52,728 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=LoopsAndPotentialCycles, 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;@5fba2b77, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:51:52,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:51:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:51:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:52,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:52,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:52,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:52,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2023-11-06 22:51:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524325036] [2023-11-06 22:51:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:51:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,284 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-06 22:51:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524325036] [2023-11-06 22:51:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524325036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:53,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:51:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940209835] [2023-11-06 22:51:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:53,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:51:53,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:51:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:51:53,324 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:51:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:53,833 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2023-11-06 22:51:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2023-11-06 22:51:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:53,850 INFO L225 Difference]: With dead ends: 215 [2023-11-06 22:51:53,851 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:51:53,856 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-06 22:51:53,863 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 213 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:53,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 239 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:51:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2023-11-06 22:51:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:51:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2023-11-06 22:51:53,940 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2023-11-06 22:51:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:53,940 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2023-11-06 22:51:53,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:51:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2023-11-06 22:51:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:53,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:53,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:53,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:51:53,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:53,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2023-11-06 22:51:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435251486] [2023-11-06 22:51:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:51:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,321 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-06 22:51:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435251486] [2023-11-06 22:51:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435251486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406694282] [2023-11-06 22:51:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:54,329 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-06 22:51:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:55,035 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2023-11-06 22:51:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:51:55,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2023-11-06 22:51:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:55,039 INFO L225 Difference]: With dead ends: 320 [2023-11-06 22:51:55,039 INFO L226 Difference]: Without dead ends: 232 [2023-11-06 22:51:55,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:51:55,043 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 412 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:55,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 346 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-06 22:51:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2023-11-06 22:51:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-11-06 22:51:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2023-11-06 22:51:55,089 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2023-11-06 22:51:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:55,090 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2023-11-06 22:51:55,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-06 22:51:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2023-11-06 22:51:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:55,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:55,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:55,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:51:55,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:55,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2023-11-06 22:51:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:55,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667350098] [2023-11-06 22:51:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:51:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,355 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-06 22:51:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:55,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667350098] [2023-11-06 22:51:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667350098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:55,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:55,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185470797] [2023-11-06 22:51:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:55,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:55,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:55,361 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-06 22:51:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:56,082 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2023-11-06 22:51:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:51:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2023-11-06 22:51:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:56,088 INFO L225 Difference]: With dead ends: 540 [2023-11-06 22:51:56,088 INFO L226 Difference]: Without dead ends: 363 [2023-11-06 22:51:56,090 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-06 22:51:56,092 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 452 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:56,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 574 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-06 22:51:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2023-11-06 22:51:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2023-11-06 22:51:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2023-11-06 22:51:56,195 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2023-11-06 22:51:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:56,195 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2023-11-06 22:51:56,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-06 22:51:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2023-11-06 22:51:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:56,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:56,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:56,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:51:56,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:56,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2023-11-06 22:51:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569738451] [2023-11-06 22:51:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:51:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,452 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-06 22:51:56,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:56,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569738451] [2023-11-06 22:51:56,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569738451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:56,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:56,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:51:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916611805] [2023-11-06 22:51:56,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:56,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:56,456 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-06 22:51:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:56,949 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2023-11-06 22:51:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:51:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2023-11-06 22:51:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:56,957 INFO L225 Difference]: With dead ends: 590 [2023-11-06 22:51:56,958 INFO L226 Difference]: Without dead ends: 323 [2023-11-06 22:51:56,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:51:56,971 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 120 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:56,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 489 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-06 22:51:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2023-11-06 22:51:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2023-11-06 22:51:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2023-11-06 22:51:57,039 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2023-11-06 22:51:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:57,040 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2023-11-06 22:51:57,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-06 22:51:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2023-11-06 22:51:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:57,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:57,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:57,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:51:57,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:57,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2023-11-06 22:51:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:57,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117389891] [2023-11-06 22:51:57,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:57,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:51:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,247 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-06 22:51:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117389891] [2023-11-06 22:51:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117389891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:51:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666895358] [2023-11-06 22:51:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:57,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:57,251 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 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-06 22:51:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:58,773 INFO L93 Difference]: Finished difference Result 1956 states and 2670 transitions. [2023-11-06 22:51:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:51:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2023-11-06 22:51:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:58,792 INFO L225 Difference]: With dead ends: 1956 [2023-11-06 22:51:58,792 INFO L226 Difference]: Without dead ends: 1684 [2023-11-06 22:51:58,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:51:58,798 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 1192 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:58,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 722 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:51:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2023-11-06 22:51:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1434. [2023-11-06 22:51:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2023-11-06 22:51:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1882 transitions. [2023-11-06 22:51:59,039 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1882 transitions. Word has length 64 [2023-11-06 22:51:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:59,040 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1882 transitions. [2023-11-06 22:51:59,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 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-06 22:51:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1882 transitions. [2023-11-06 22:51:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:59,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:59,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:51:59,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:59,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2023-11-06 22:51:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:59,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573060830] [2023-11-06 22:51:59,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:59,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:51:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,212 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-06 22:51:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573060830] [2023-11-06 22:51:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573060830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:51:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253282342] [2023-11-06 22:51:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:59,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:59,215 INFO L87 Difference]: Start difference. First operand 1434 states and 1882 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-06 22:51:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:59,809 INFO L93 Difference]: Finished difference Result 3035 states and 4006 transitions. [2023-11-06 22:51:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:51:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2023-11-06 22:51:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:59,820 INFO L225 Difference]: With dead ends: 3035 [2023-11-06 22:51:59,820 INFO L226 Difference]: Without dead ends: 1623 [2023-11-06 22:51:59,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:51:59,825 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 118 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:59,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 488 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2023-11-06 22:51:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1479. [2023-11-06 22:51:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2023-11-06 22:51:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1921 transitions. [2023-11-06 22:51:59,981 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1921 transitions. Word has length 64 [2023-11-06 22:51:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:59,981 INFO L495 AbstractCegarLoop]: Abstraction has 1479 states and 1921 transitions. [2023-11-06 22:51:59,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-06 22:51:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1921 transitions. [2023-11-06 22:51:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:51:59,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:59,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:59,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:51:59,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:59,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2023-11-06 22:51:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776636712] [2023-11-06 22:51:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:00,166 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-06 22:52:00,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:00,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776636712] [2023-11-06 22:52:00,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776636712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:00,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:00,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:52:00,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226474845] [2023-11-06 22:52:00,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:00,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:52:00,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:00,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:52:00,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:00,169 INFO L87 Difference]: Start difference. First operand 1479 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-06 22:52:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:00,953 INFO L93 Difference]: Finished difference Result 2914 states and 3760 transitions. [2023-11-06 22:52:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:52:00,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2023-11-06 22:52:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:00,965 INFO L225 Difference]: With dead ends: 2914 [2023-11-06 22:52:00,965 INFO L226 Difference]: Without dead ends: 1677 [2023-11-06 22:52:00,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:52:00,970 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 337 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:00,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 392 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:52:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2023-11-06 22:52:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1457. [2023-11-06 22:52:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2023-11-06 22:52:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1881 transitions. [2023-11-06 22:52:01,152 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1881 transitions. Word has length 64 [2023-11-06 22:52:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:01,153 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1881 transitions. [2023-11-06 22:52:01,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-06 22:52:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1881 transitions. [2023-11-06 22:52:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:52:01,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:01,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:01,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:52:01,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:01,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2023-11-06 22:52:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:01,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939422791] [2023-11-06 22:52:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,287 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-06 22:52:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:01,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939422791] [2023-11-06 22:52:01,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939422791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:01,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:52:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855421710] [2023-11-06 22:52:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:01,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:52:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:52:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:01,289 INFO L87 Difference]: Start difference. First operand 1457 states and 1881 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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-06 22:52:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:01,999 INFO L93 Difference]: Finished difference Result 4532 states and 5857 transitions. [2023-11-06 22:52:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:52:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 64 [2023-11-06 22:52:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:02,020 INFO L225 Difference]: With dead ends: 4532 [2023-11-06 22:52:02,021 INFO L226 Difference]: Without dead ends: 3100 [2023-11-06 22:52:02,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:52:02,026 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 301 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:02,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 325 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:52:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2023-11-06 22:52:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2828. [2023-11-06 22:52:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2023-11-06 22:52:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3619 transitions. [2023-11-06 22:52:02,343 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3619 transitions. Word has length 64 [2023-11-06 22:52:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:02,344 INFO L495 AbstractCegarLoop]: Abstraction has 2828 states and 3619 transitions. [2023-11-06 22:52:02,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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-06 22:52:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3619 transitions. [2023-11-06 22:52:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:52:02,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:02,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:02,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:52:02,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:02,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2023-11-06 22:52:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526035409] [2023-11-06 22:52:02,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,425 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-06 22:52:02,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526035409] [2023-11-06 22:52:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526035409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:02,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:02,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:52:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678327433] [2023-11-06 22:52:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:02,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:52:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:52:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:52:02,428 INFO L87 Difference]: Start difference. First operand 2828 states and 3619 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 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-06 22:52:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:03,213 INFO L93 Difference]: Finished difference Result 7846 states and 10129 transitions. [2023-11-06 22:52:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:52:03,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 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 65 [2023-11-06 22:52:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:03,244 INFO L225 Difference]: With dead ends: 7846 [2023-11-06 22:52:03,245 INFO L226 Difference]: Without dead ends: 5022 [2023-11-06 22:52:03,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:52:03,253 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 388 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:03,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 239 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:52:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2023-11-06 22:52:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4506. [2023-11-06 22:52:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2023-11-06 22:52:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5736 transitions. [2023-11-06 22:52:03,813 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5736 transitions. Word has length 65 [2023-11-06 22:52:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:03,813 INFO L495 AbstractCegarLoop]: Abstraction has 4506 states and 5736 transitions. [2023-11-06 22:52:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 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-06 22:52:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5736 transitions. [2023-11-06 22:52:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:52:03,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:03,816 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:03,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:52:03,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:03,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2023-11-06 22:52:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012990775] [2023-11-06 22:52:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:03,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:03,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012990775] [2023-11-06 22:52:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012990775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:03,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:03,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:52:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433324458] [2023-11-06 22:52:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:03,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:52:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:52:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:03,915 INFO L87 Difference]: Start difference. First operand 4506 states and 5736 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:52:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:04,884 INFO L93 Difference]: Finished difference Result 6136 states and 7738 transitions. [2023-11-06 22:52:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:52:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2023-11-06 22:52:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:04,923 INFO L225 Difference]: With dead ends: 6136 [2023-11-06 22:52:04,923 INFO L226 Difference]: Without dead ends: 6133 [2023-11-06 22:52:04,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:52:04,927 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 559 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:04,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 230 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:52:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2023-11-06 22:52:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5560. [2023-11-06 22:52:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2023-11-06 22:52:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 7025 transitions. [2023-11-06 22:52:05,578 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 7025 transitions. Word has length 72 [2023-11-06 22:52:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:05,580 INFO L495 AbstractCegarLoop]: Abstraction has 5560 states and 7025 transitions. [2023-11-06 22:52:05,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:52:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 7025 transitions. [2023-11-06 22:52:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:52:05,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:05,584 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:05,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:52:05,585 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:05,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:05,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2023-11-06 22:52:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541526675] [2023-11-06 22:52:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541526675] [2023-11-06 22:52:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541526675] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306698970] [2023-11-06 22:52:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:05,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:05,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:05,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:52:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:05,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:52:05,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:06,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306698970] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:06,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-06 22:52:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142362689] [2023-11-06 22:52:06,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:06,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:52:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:52:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:52:06,358 INFO L87 Difference]: Start difference. First operand 5560 states and 7025 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-06 22:52:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:09,021 INFO L93 Difference]: Finished difference Result 13206 states and 16553 transitions. [2023-11-06 22:52:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:52:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 73 [2023-11-06 22:52:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:09,101 INFO L225 Difference]: With dead ends: 13206 [2023-11-06 22:52:09,101 INFO L226 Difference]: Without dead ends: 13203 [2023-11-06 22:52:09,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:52:09,108 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 1008 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:09,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 670 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:52:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2023-11-06 22:52:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 10818. [2023-11-06 22:52:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10818 states, 8399 states have (on average 1.249315394689844) internal successors, (10493), 8508 states have internal predecessors, (10493), 1191 states have call successors, (1191), 1025 states have call predecessors, (1191), 1227 states have return successors, (1955), 1290 states have call predecessors, (1955), 1190 states have call successors, (1955) [2023-11-06 22:52:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 13639 transitions. [2023-11-06 22:52:10,746 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 13639 transitions. Word has length 73 [2023-11-06 22:52:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:10,746 INFO L495 AbstractCegarLoop]: Abstraction has 10818 states and 13639 transitions. [2023-11-06 22:52:10,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-06 22:52:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 13639 transitions. [2023-11-06 22:52:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:52:10,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:10,751 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:10,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:10,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:10,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:10,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2023-11-06 22:52:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510366388] [2023-11-06 22:52:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510366388] [2023-11-06 22:52:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510366388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:52:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681775929] [2023-11-06 22:52:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:11,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:52:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:11,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:52:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:52:11,037 INFO L87 Difference]: Start difference. First operand 10818 states and 13639 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:52:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:12,435 INFO L93 Difference]: Finished difference Result 17361 states and 21981 transitions. [2023-11-06 22:52:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:52:12,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 76 [2023-11-06 22:52:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:12,476 INFO L225 Difference]: With dead ends: 17361 [2023-11-06 22:52:12,476 INFO L226 Difference]: Without dead ends: 7423 [2023-11-06 22:52:12,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:52:12,503 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 211 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:12,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 374 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:52:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2023-11-06 22:52:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 6871. [2023-11-06 22:52:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 5346 states have (on average 1.222035166479611) internal successors, (6533), 5411 states have internal predecessors, (6533), 758 states have call successors, (758), 649 states have call predecessors, (758), 766 states have return successors, (1174), 816 states have call predecessors, (1174), 757 states have call successors, (1174) [2023-11-06 22:52:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 8465 transitions. [2023-11-06 22:52:13,495 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 8465 transitions. Word has length 76 [2023-11-06 22:52:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:13,496 INFO L495 AbstractCegarLoop]: Abstraction has 6871 states and 8465 transitions. [2023-11-06 22:52:13,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:52:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 8465 transitions. [2023-11-06 22:52:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:52:13,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:13,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:13,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:52:13,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:13,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2023-11-06 22:52:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268184001] [2023-11-06 22:52:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:52:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:52:13,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:13,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268184001] [2023-11-06 22:52:13,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268184001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:13,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:13,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:52:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659325675] [2023-11-06 22:52:13,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:13,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:52:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:52:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:13,653 INFO L87 Difference]: Start difference. First operand 6871 states and 8465 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:52:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:15,794 INFO L93 Difference]: Finished difference Result 20729 states and 25646 transitions. [2023-11-06 22:52:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:52:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2023-11-06 22:52:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:15,856 INFO L225 Difference]: With dead ends: 20729 [2023-11-06 22:52:15,856 INFO L226 Difference]: Without dead ends: 13886 [2023-11-06 22:52:15,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:52:15,875 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 725 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:15,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 367 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:52:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13886 states. [2023-11-06 22:52:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13886 to 13027. [2023-11-06 22:52:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13027 states, 10018 states have (on average 1.19944100618886) internal successors, (12016), 10185 states have internal predecessors, (12016), 1462 states have call successors, (1462), 1253 states have call predecessors, (1462), 1546 states have return successors, (2563), 1594 states have call predecessors, (2563), 1461 states have call successors, (2563) [2023-11-06 22:52:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 16041 transitions. [2023-11-06 22:52:17,519 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 16041 transitions. Word has length 83 [2023-11-06 22:52:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:17,520 INFO L495 AbstractCegarLoop]: Abstraction has 13027 states and 16041 transitions. [2023-11-06 22:52:17,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:52:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 16041 transitions. [2023-11-06 22:52:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:52:17,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:17,529 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:17,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:52:17,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:17,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2023-11-06 22:52:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640874866] [2023-11-06 22:52:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:52:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:52:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640874866] [2023-11-06 22:52:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640874866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:17,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:17,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:52:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18196845] [2023-11-06 22:52:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:17,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:52:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:52:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:17,698 INFO L87 Difference]: Start difference. First operand 13027 states and 16041 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:52:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:19,996 INFO L93 Difference]: Finished difference Result 23901 states and 29354 transitions. [2023-11-06 22:52:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:52:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2023-11-06 22:52:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:20,046 INFO L225 Difference]: With dead ends: 23901 [2023-11-06 22:52:20,046 INFO L226 Difference]: Without dead ends: 11510 [2023-11-06 22:52:20,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:52:20,080 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 1053 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:20,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 442 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:52:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2023-11-06 22:52:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 10610. [2023-11-06 22:52:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 8186 states have (on average 1.1887368678231127) internal successors, (9731), 8322 states have internal predecessors, (9731), 1169 states have call successors, (1169), 1002 states have call predecessors, (1169), 1254 states have return successors, (1902), 1291 states have call predecessors, (1902), 1168 states have call successors, (1902) [2023-11-06 22:52:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 12802 transitions. [2023-11-06 22:52:21,434 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 12802 transitions. Word has length 92 [2023-11-06 22:52:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:21,435 INFO L495 AbstractCegarLoop]: Abstraction has 10610 states and 12802 transitions. [2023-11-06 22:52:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:52:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 12802 transitions. [2023-11-06 22:52:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:52:21,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:21,451 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:21,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:52:21,452 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:21,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2023-11-06 22:52:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796961990] [2023-11-06 22:52:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:52:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:52:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:52:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:52:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:52:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:52:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:52:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-06 22:52:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:21,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796961990] [2023-11-06 22:52:21,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796961990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:21,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753600277] [2023-11-06 22:52:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:21,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:21,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:21,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:52:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:52:21,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:52:21,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:52:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753600277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:52:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-06 22:52:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212524087] [2023-11-06 22:52:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:21,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:52:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:21,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:52:21,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:52:21,880 INFO L87 Difference]: Start difference. First operand 10610 states and 12802 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:52:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:22,502 INFO L93 Difference]: Finished difference Result 15682 states and 18945 transitions. [2023-11-06 22:52:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:52:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2023-11-06 22:52:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:22,523 INFO L225 Difference]: With dead ends: 15682 [2023-11-06 22:52:22,523 INFO L226 Difference]: Without dead ends: 5100 [2023-11-06 22:52:22,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:52:22,550 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 34 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:22,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 605 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2023-11-06 22:52:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4667. [2023-11-06 22:52:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3699 states have (on average 1.1732900783995674) internal successors, (4340), 3735 states have internal predecessors, (4340), 467 states have call successors, (467), 386 states have call predecessors, (467), 500 states have return successors, (738), 545 states have call predecessors, (738), 466 states have call successors, (738) [2023-11-06 22:52:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 5545 transitions. [2023-11-06 22:52:23,111 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 5545 transitions. Word has length 144 [2023-11-06 22:52:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:23,112 INFO L495 AbstractCegarLoop]: Abstraction has 4667 states and 5545 transitions. [2023-11-06 22:52:23,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:52:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 5545 transitions. [2023-11-06 22:52:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:52:23,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:23,123 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:52:23,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:52:23,330 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:23,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2023-11-06 22:52:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719281742] [2023-11-06 22:52:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:52:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:52:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:52:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:52:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:52:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:52:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:52:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-06 22:52:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719281742] [2023-11-06 22:52:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719281742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:52:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350404769] [2023-11-06 22:52:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:23,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:52:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:52:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:52:23,429 INFO L87 Difference]: Start difference. First operand 4667 states and 5545 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:52:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:24,047 INFO L93 Difference]: Finished difference Result 5210 states and 6157 transitions. [2023-11-06 22:52:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:52:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 146 [2023-11-06 22:52:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:24,062 INFO L225 Difference]: With dead ends: 5210 [2023-11-06 22:52:24,063 INFO L226 Difference]: Without dead ends: 4461 [2023-11-06 22:52:24,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:24,067 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 219 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:24,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 210 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:52:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2023-11-06 22:52:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4242. [2023-11-06 22:52:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4242 states, 3370 states have (on average 1.175074183976261) internal successors, (3960), 3403 states have internal predecessors, (3960), 421 states have call successors, (421), 346 states have call predecessors, (421), 450 states have return successors, (674), 492 states have call predecessors, (674), 420 states have call successors, (674) [2023-11-06 22:52:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 5055 transitions. [2023-11-06 22:52:24,567 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 5055 transitions. Word has length 146 [2023-11-06 22:52:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:24,568 INFO L495 AbstractCegarLoop]: Abstraction has 4242 states and 5055 transitions. [2023-11-06 22:52:24,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:52:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 5055 transitions. [2023-11-06 22:52:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 22:52:24,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:24,577 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:24,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:52:24,578 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:24,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 83168210, now seen corresponding path program 1 times [2023-11-06 22:52:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850380819] [2023-11-06 22:52:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:52:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:52:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:52:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:52:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:52:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:52:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:52:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:52:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:52:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:52:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:52:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:52:24,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:24,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850380819] [2023-11-06 22:52:24,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850380819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523261367] [2023-11-06 22:52:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:24,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:24,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:24,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:24,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:52:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:52:24,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 22:52:25,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:52:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523261367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:52:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:52:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990324383] [2023-11-06 22:52:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:25,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:25,070 INFO L87 Difference]: Start difference. First operand 4242 states and 5055 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:52:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:25,448 INFO L93 Difference]: Finished difference Result 6078 states and 7215 transitions. [2023-11-06 22:52:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2023-11-06 22:52:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:25,456 INFO L225 Difference]: With dead ends: 6078 [2023-11-06 22:52:25,456 INFO L226 Difference]: Without dead ends: 2113 [2023-11-06 22:52:25,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:25,463 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:25,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2023-11-06 22:52:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2023-11-06 22:52:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1690 states have (on average 1.16094674556213) internal successors, (1962), 1707 states have internal predecessors, (1962), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (303), 237 states have call predecessors, (303), 201 states have call successors, (303) [2023-11-06 22:52:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2467 transitions. [2023-11-06 22:52:25,759 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2467 transitions. Word has length 157 [2023-11-06 22:52:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:25,760 INFO L495 AbstractCegarLoop]: Abstraction has 2113 states and 2467 transitions. [2023-11-06 22:52:25,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:52:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2467 transitions. [2023-11-06 22:52:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 22:52:25,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:25,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:25,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:25,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:52:25,972 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:25,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2023-11-06 22:52:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037898075] [2023-11-06 22:52:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:52:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:52:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:52:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:52:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:52:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:52:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:52:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-06 22:52:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037898075] [2023-11-06 22:52:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037898075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:26,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:52:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699575565] [2023-11-06 22:52:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:52:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:52:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:26,120 INFO L87 Difference]: Start difference. First operand 2113 states and 2467 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:52:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:26,695 INFO L93 Difference]: Finished difference Result 3977 states and 4677 transitions. [2023-11-06 22:52:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:52:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2023-11-06 22:52:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:26,703 INFO L225 Difference]: With dead ends: 3977 [2023-11-06 22:52:26,703 INFO L226 Difference]: Without dead ends: 2216 [2023-11-06 22:52:26,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:52:26,708 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 190 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:26,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 356 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:52:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2023-11-06 22:52:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1672. [2023-11-06 22:52:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1341 states have (on average 1.1670395227442207) internal successors, (1565), 1357 states have internal predecessors, (1565), 158 states have call successors, (158), 132 states have call predecessors, (158), 172 states have return successors, (235), 182 states have call predecessors, (235), 157 states have call successors, (235) [2023-11-06 22:52:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2023-11-06 22:52:26,949 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 158 [2023-11-06 22:52:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:26,949 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2023-11-06 22:52:26,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:52:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2023-11-06 22:52:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-06 22:52:26,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:26,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:52:26,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:52:26,954 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:26,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2023-11-06 22:52:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099694122] [2023-11-06 22:52:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:52:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:52:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:52:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:52:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:52:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:52:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:52:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:52:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099694122] [2023-11-06 22:52:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099694122] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526807538] [2023-11-06 22:52:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:27,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:27,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:27,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:52:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:27,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:52:27,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:52:27,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-06 22:52:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526807538] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:27,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2023-11-06 22:52:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974243153] [2023-11-06 22:52:27,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:27,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:52:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:52:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:52:27,814 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-06 22:52:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:28,961 INFO L93 Difference]: Finished difference Result 3707 states and 4436 transitions. [2023-11-06 22:52:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:52:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 161 [2023-11-06 22:52:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:28,969 INFO L225 Difference]: With dead ends: 3707 [2023-11-06 22:52:28,969 INFO L226 Difference]: Without dead ends: 1959 [2023-11-06 22:52:28,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:52:28,974 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 825 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:28,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 334 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:52:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2023-11-06 22:52:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1759. [2023-11-06 22:52:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1386 states have (on average 1.1392496392496392) internal successors, (1579), 1407 states have internal predecessors, (1579), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2023-11-06 22:52:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2045 transitions. [2023-11-06 22:52:29,228 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2045 transitions. Word has length 161 [2023-11-06 22:52:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:29,228 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2045 transitions. [2023-11-06 22:52:29,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-06 22:52:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2045 transitions. [2023-11-06 22:52:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-11-06 22:52:29,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:29,235 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:52:29,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:29,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:29,448 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:29,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 11419214, now seen corresponding path program 1 times [2023-11-06 22:52:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459049826] [2023-11-06 22:52:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:52:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:52:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:52:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:52:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:52:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:52:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:52:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:52:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:52:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:52:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:52:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:52:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459049826] [2023-11-06 22:52:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459049826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608772935] [2023-11-06 22:52:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:29,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:29,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:29,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:29,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:52:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:29,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:52:29,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-06 22:52:29,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:52:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608772935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:29,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:52:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-06 22:52:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023309400] [2023-11-06 22:52:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:29,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:52:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:52:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:52:29,808 INFO L87 Difference]: Start difference. First operand 1759 states and 2045 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:52:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:30,309 INFO L93 Difference]: Finished difference Result 3404 states and 3968 transitions. [2023-11-06 22:52:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:52:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 178 [2023-11-06 22:52:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:30,314 INFO L225 Difference]: With dead ends: 3404 [2023-11-06 22:52:30,314 INFO L226 Difference]: Without dead ends: 1476 [2023-11-06 22:52:30,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:30,318 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:30,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 224 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2023-11-06 22:52:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1439. [2023-11-06 22:52:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1142 states have (on average 1.1287215411558669) internal successors, (1289), 1154 states have internal predecessors, (1289), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2023-11-06 22:52:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1648 transitions. [2023-11-06 22:52:30,545 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1648 transitions. Word has length 178 [2023-11-06 22:52:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:30,545 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 1648 transitions. [2023-11-06 22:52:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:52:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1648 transitions. [2023-11-06 22:52:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-11-06 22:52:30,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:30,553 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:30,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:30,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:30,759 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:30,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2023-11-06 22:52:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:30,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377023116] [2023-11-06 22:52:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:30,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:52:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:52:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:52:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:52:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:52:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:52:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:52:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:52:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:52:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:52:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-06 22:52:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-06 22:52:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-06 22:52:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:52:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-06 22:52:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-06 22:52:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-06 22:52:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2023-11-06 22:52:30,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377023116] [2023-11-06 22:52:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377023116] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947858796] [2023-11-06 22:52:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:30,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:30,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:30,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:30,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:52:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:31,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:52:31,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-06 22:52:31,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-06 22:52:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947858796] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:31,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-11-06 22:52:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109142038] [2023-11-06 22:52:31,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:31,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:52:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:52:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:52:31,567 INFO L87 Difference]: Start difference. First operand 1439 states and 1648 transitions. Second operand has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-06 22:52:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:32,367 INFO L93 Difference]: Finished difference Result 1742 states and 1983 transitions. [2023-11-06 22:52:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:52:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 252 [2023-11-06 22:52:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:32,369 INFO L225 Difference]: With dead ends: 1742 [2023-11-06 22:52:32,369 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:52:32,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 549 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:52:32,374 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 255 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:32,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 351 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:52:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:52:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:52:32,375 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-06 22:52:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:52:32,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2023-11-06 22:52:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:32,377 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:52:32,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-06 22:52:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:52:32,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:52:32,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:52:32,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 22:52:32,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:32,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:53:02,655 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2023-11-06 22:53:02,655 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2023-11-06 22:53:02,655 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2023-11-06 22:53:02,656 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse20 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse15 (= ~p_dw_pc~0 1))) (let ((.cse13 (not .cse15)) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse9 (< ~q_write_ev~0 2)) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse20)) (.cse12 (not (= ~q_free~0 0))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse0 (< 0 ~q_req_up~0)) (.cse16 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~c_num_read~0 0))) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse7 (not (= ~q_free~0 1))) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse14 (not (= ~q_read_ev~0 2))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (< 0 ~c_dr_pc~0)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse5 .cse6 .cse8 .cse9 .cse14 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse16 .cse3 .cse17 .cse15 .cse18 .cse7 .cse8 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse6 .cse8 .cse19 .cse11) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse16 .cse3 .cse17 .cse18 (and .cse20 (= ~p_dw_st~0 0)) .cse6 .cse7 (not .cse1) .cse14 .cse10 .cse19 .cse11)))) [2023-11-06 22:53:02,656 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse20 (= ~p_dw_pc~0 1)) (.cse25 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse24 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse3 (= activate_threads_~tmp~1 0))) (let ((.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_write_ev~0 2)) (.cse18 (and .cse25 .cse24 .cse3)) (.cse19 (not .cse20)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse0 (< 0 ~q_req_up~0)) (.cse21 (not (= ~p_num_write~0 0))) (.cse22 (not (= ~c_num_read~0 0))) (.cse23 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (= ~q_free~0 1))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~c_dr_st~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse17 (and .cse25 .cse24)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~q_free~0 0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse15 (< 0 ~c_dr_pc~0)) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse13 .cse6 .cse8 .cse10 (and (not .cse14) .cse3) .cse15 .cse12) (or (and (= ~q_read_ev~0 1) .cse16 .cse14) .cse0 .cse1 .cse17 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse18 .cse0 .cse1 .cse2 .cse13 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse17 .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse1 .cse17 .cse21 .cse2 .cse22 .cse20 .cse23 .cse7 .cse8 .cse11 .cse12) (or .cse1 .cse21 .cse2 .cse22 .cse3 .cse20 .cse23 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse18 .cse0 .cse1 .cse2 .cse13 .cse19 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse10 .cse12) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse21 .cse2 .cse22 .cse23 (and .cse24 .cse3 .cse14) .cse6 .cse7 (not .cse1) .cse10 .cse11 .cse15 .cse12) (or .cse25 .cse1 .cse2 .cse13 .cse20 .cse6 .cse8 .cse15 .cse12) (or (and .cse16 .cse14) .cse1 .cse17 .cse2 .cse13 .cse6 .cse8 .cse15 .cse12)))) [2023-11-06 22:53:02,657 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2023-11-06 22:53:02,657 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2023-11-06 22:53:02,657 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 331) the Hoare annotation is: (let ((.cse20 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse15 (= ~p_dw_pc~0 1))) (let ((.cse13 (not .cse15)) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse9 (< ~q_write_ev~0 2)) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse20)) (.cse12 (not (= ~q_free~0 0))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse0 (< 0 ~q_req_up~0)) (.cse16 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~c_num_read~0 0))) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse7 (not (= ~q_free~0 1))) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse14 (not (= ~q_read_ev~0 2))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (< 0 ~c_dr_pc~0)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse5 .cse6 .cse8 .cse9 .cse14 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse16 .cse3 .cse17 .cse15 .cse18 .cse7 .cse8 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse6 .cse8 .cse19 .cse11) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse16 .cse3 .cse17 .cse18 (and .cse20 (= ~p_dw_st~0 0)) .cse6 .cse7 (not .cse1) .cse14 .cse10 .cse19 .cse11)))) [2023-11-06 22:53:02,657 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-11-06 22:53:02,657 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2023-11-06 22:53:02,658 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2023-11-06 22:53:02,658 INFO L895 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse20 (= ~q_read_ev~0 2)) (.cse19 (= ~p_dw_st~0 0)) (.cse1 (= ~c_dr_st~0 0))) (let ((.cse17 (not (= ~q_free~0 0))) (.cse16 (not .cse1)) (.cse18 (not (= ~p_dw_pc~0 1))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse2 (not .cse19)) (.cse12 (< 0 ~q_req_up~0)) (.cse3 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~q_free~0 1))) (.cse14 (< ~q_write_ev~0 2)) (.cse15 (not .cse20)) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (< 0 ~c_dr_pc~0)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse14 .cse15 .cse9 .cse11) (or .cse0 .cse12 .cse16 .cse4 .cse17 .cse18 .cse19 .cse13 .cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14 .cse15 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse17 .cse7 .cse10 .cse11) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~q_req_up~0 1)) .cse4 .cse5 .cse17 .cse19 (< ~q_read_ev~0 1) .cse7 .cse14 (and .cse16 .cse20) .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse18 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 .cse7 .cse8 .cse14 .cse15 .cse9 .cse11) (or .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse10 .cse11)))) [2023-11-06 22:53:02,658 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 251 270) the Hoare annotation is: true [2023-11-06 22:53:02,658 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-11-06 22:53:02,658 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 251 270) no Hoare annotation was computed. [2023-11-06 22:53:02,659 INFO L895 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse26 (= ~c_num_read~0 ~p_num_write~0)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~q_free~0 1)) (.cse1 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse21 (= 1 ~c_dr_i~0)) (.cse25 (= ~c_dr_pc~0 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse23 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse2 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse17 (and .cse26 .cse22 .cse24 .cse1 .cse21 .cse25 .cse5 .cse23)) (.cse11 (< 0 ~q_req_up~0)) (.cse15 (not .cse5)) (.cse13 (not (= ~q_read_ev~0 2))) (.cse16 (not .cse26)) (.cse6 (= ~p_dw_st~0 0)) (.cse18 (not .cse25)) (.cse8 (not .cse24)) (.cse19 (< ~q_write_ev~0 2)) (.cse9 (not .cse23)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (not .cse22)) (.cse20 (not (= ~q_free~0 0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse14 (< 0 ~c_dr_pc~0)) (.cse10 (not .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not .cse6) .cse11 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse2 .cse3 .cse4 .cse7 .cse12 .cse8 .cse13 .cse9 .cse14 .cse10) (or .cse0 (not (= ~q_read_ev~0 1)) .cse11 .cse3 .cse15 .cse16 .cse17 .cse18 .cse12 .cse8 .cse19 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse3 .cse20 .cse15 .cse6 .cse18 .cse12 .cse19 .cse13 .cse10) (or .cse0 .cse11 .cse3 .cse15 .cse16 .cse17 .cse6 .cse18 .cse12 .cse8 .cse19 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse3 .cse20 .cse15 (<= 1 ~q_write_ev~0) .cse6 (= ~q_write_ev~0 0) .cse18 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse16 .cse5 .cse6 .cse18 .cse12 .cse8 .cse19 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse20 .cse12 .cse14 .cse10)))) [2023-11-06 22:53:02,659 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-11-06 22:53:02,659 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2023-11-06 22:53:02,659 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2023-11-06 22:53:02,659 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 80 98) no Hoare annotation was computed. [2023-11-06 22:53:02,659 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 80 98) the Hoare annotation is: true [2023-11-06 22:53:02,659 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2023-11-06 22:53:02,660 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 271 288) the Hoare annotation is: (let ((.cse21 (= ~q_read_ev~0 2)) (.cse5 (= ~p_dw_pc~0 1)) (.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse3 (and .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse12 (not (= ~p_num_write~0 0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_free~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (< 0 ~c_dr_pc~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse15 (< 0 ~q_req_up~0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~q_free~0 0))) (.cse17 (not .cse5)) (.cse6 (= ~p_dw_st~0 0)) (.cse18 (not (= |old(~q_read_ev~0)| 2))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse19 (and .cse22 .cse21)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse2 .cse3 .cse13 .cse5 .cse6 .cse14 .cse9 .cse10 .cse11) (or .cse0 .cse15 .cse2 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse19 .cse11) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse16 .cse6 .cse8 .cse20 .cse11) (or (not .cse6) .cse15 (and (= ~q_write_ev~0 2) .cse21) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse12 .cse2 .cse13 .cse14 .cse18 .cse8 .cse9 .cse10 .cse20 .cse11) (or .cse0 .cse1 .cse15 .cse2 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse19 .cse11)))) [2023-11-06 22:53:02,660 INFO L899 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2023-11-06 22:53:02,660 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2023-11-06 22:53:02,660 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2023-11-06 22:53:02,660 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2023-11-06 22:53:02,660 INFO L899 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2023-11-06 22:53:02,661 INFO L895 garLoopResultBuilder]: At program point update_fifo_q_returnLabel#1(lines 31 50) the Hoare annotation is: (let ((.cse19 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse1 (= ~c_dr_st~0 0)) (.cse15 (<= ~q_req_up~0 0)) (.cse12 (< |old(~q_write_ev~0)| 2)) (.cse13 (not (= |old(~q_req_up~0)| 1))) (.cse3 (not (= ~q_free~0 0))) (.cse4 (not .cse19)) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (< 0 |old(~q_req_up~0)|)) (.cse5 (= ~p_dw_st~0 0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (< 0 ~c_dr_pc~0)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~q_write_ev~0)| 0) .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse5 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse8 .cse11 .cse10) (or .cse1 (< |old(~q_read_ev~0)| 1) .cse12 .cse13 .cse2 .cse14 .cse5 .cse7 (and .cse15 .cse16) .cse8 .cse17 .cse18 .cse10) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse1 .cse12 .cse2 .cse4 .cse14 .cse5 .cse7 .cse8 .cse17 .cse18 .cse10) (or .cse1 .cse12 .cse2 .cse14 .cse19 .cse16 .cse5 .cse7 .cse8 .cse17 .cse18 .cse10) (or .cse1 (and .cse15 (= ~q_read_ev~0 2)) .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not .cse5) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_num_write~0 0)) .cse2 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6 .cse8 .cse17 .cse18 .cse11 .cse10)))) [2023-11-06 22:53:02,661 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2023-11-06 22:53:02,661 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 218 232) the Hoare annotation is: (let ((.cse5 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse3 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse4 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse26 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse27 (= ~q_read_ev~0 2))) (let ((.cse2 (not (= |old(~q_req_up~0)| 1))) (.cse22 (not (= ~p_num_write~0 0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse24 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse25 (< 0 ~c_dr_pc~0)) (.cse15 (and .cse3 .cse4 .cse26 .cse27)) (.cse16 (not (= ~q_free~0 0))) (.cse17 (not .cse20)) (.cse18 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse14 (< 0 |old(~q_req_up~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse19 (and .cse3 .cse4 .cse5 .cse26)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (< |old(~q_read_ev~0)| 1) .cse1 .cse2 (and (= ~q_req_up~0 1) .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse1 .cse15 .cse6 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse13) (or .cse0 .cse1 .cse19 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse19 .cse6 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse21 .cse13) (or .cse0 .cse19 .cse22 .cse6 .cse23 .cse20 .cse8 .cse24 .cse11 .cse12 .cse13) (or .cse0 .cse19 .cse6 .cse16 .cse8 .cse10 .cse25 .cse13) (or .cse14 (not .cse8) (and .cse3 (= ~q_write_ev~0 2) .cse26 .cse27) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse22 .cse6 .cse23 .cse24 .cse18 .cse10 .cse11 .cse12 .cse25 .cse13) (or .cse14 .cse0 .cse15 .cse6 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 (= |old(~q_write_ev~0)| 0) .cse21 .cse13) (or .cse14 .cse0 .cse1 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2023-11-06 22:53:02,661 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-06 22:53:02,661 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-11-06 22:53:02,661 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2023-11-06 22:53:02,662 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 289 306) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1)) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse22 (= ~q_read_ev~0 2))) (let ((.cse1 (< |old(~q_write_ev~0)| 2)) (.cse6 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (and .cse21 .cse22)) (.cse0 (= ~c_dr_st~0 0)) (.cse23 (< 0 ~c_dr_pc~0)) (.cse17 (< |old(~q_write_ev~0)| 1)) (.cse2 (< 0 ~q_req_up~0)) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (and .cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse18 (not (= ~q_free~0 0))) (.cse5 (not .cse13)) (.cse7 (= ~p_dw_st~0 0)) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse24 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse14 .cse3 .cse4 .cse15 .cse13 .cse7 .cse16 .cse10 .cse11 .cse12) (or .cse0 .cse17 .cse2 .cse3 .cse18 .cse5 .cse7 .cse19 .cse8 .cse9 .cse20 .cse12) (or .cse0 (and (= ~q_read_ev~0 1) .cse21) .cse1 .cse2 .cse3 .cse5 .cse6 (not (= |old(~q_read_ev~0)| 1)) .cse8 .cse9 .cse10 .cse11 .cse12) (or (not .cse7) .cse2 (and (= ~q_write_ev~0 2) .cse22) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse3 .cse15 .cse16 .cse19 .cse9 .cse10 .cse11 .cse23 .cse12) (or .cse0 .cse2 .cse3 .cse18 .cse5 .cse7 .cse19 .cse8 .cse9 (= |old(~q_write_ev~0)| 0) .cse24 .cse20 .cse12) (or .cse0 .cse3 .cse4 .cse18 .cse9 .cse23 .cse12) (or .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse19 .cse8 .cse9 .cse24 .cse12)))) [2023-11-06 22:53:02,662 INFO L899 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2023-11-06 22:53:02,662 INFO L899 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2023-11-06 22:53:02,662 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2023-11-06 22:53:02,662 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2023-11-06 22:53:02,663 INFO L895 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2023-11-06 22:53:02,663 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 1))) (let ((.cse8 (<= 1 ~q_write_ev~0)) (.cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (<= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~q_free~0 1)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse15 (not .cse7)) (.cse10 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse12 (= ~q_read_ev~0 1) .cse13 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse14) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse12 .cse2 .cse3 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse15 .cse14) (and .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse16 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse5 .cse15 .cse10 .cse14)))) [2023-11-06 22:53:02,663 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 465 476) the Hoare annotation is: (= 1 ~c_dr_i~0) [2023-11-06 22:53:02,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:53:02,663 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 124 163) the Hoare annotation is: (let ((.cse8 (<= ~c_dr_pc~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 ~q_read_ev~0) .cse7 (= ~p_num_write~0 1) .cse8) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse9 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 1) (= ~p_dw_pc~0 1) (= ~q_read_ev~0 2) .cse7))) [2023-11-06 22:53:02,664 INFO L895 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 405 447) the Hoare annotation is: (= 1 ~c_dr_i~0) [2023-11-06 22:53:02,664 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2023-11-06 22:53:02,664 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2023-11-06 22:53:02,664 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2023-11-06 22:53:02,664 INFO L895 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (= ~q_free~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse5 (not .cse11)) (.cse7 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_i~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse1 .cse3 .cse4 .cse14 .cse12 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse15 .cse12 .cse6)))) [2023-11-06 22:53:02,664 INFO L899 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2023-11-06 22:53:02,665 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2023-11-06 22:53:02,665 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 165 217) the Hoare annotation is: (let ((.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_st~0 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~q_req_up~0 1) (not .cse0) (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ~q_read_ev~0) .cse8 .cse9) (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~q_req_up~0 0) (not (= ~p_dw_pc~0 1)) .cse0 (= ~q_read_ev~0 2) .cse8 .cse9))) [2023-11-06 22:53:02,665 INFO L895 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (= ~q_free~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse5 (not .cse11)) (.cse7 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_i~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse1 .cse3 .cse4 .cse14 .cse12 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse15 .cse12 .cse6)))) [2023-11-06 22:53:02,666 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2023-11-06 22:53:02,666 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2023-11-06 22:53:02,666 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:53:02,666 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2023-11-06 22:53:02,666 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2023-11-06 22:53:02,666 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2023-11-06 22:53:02,666 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2023-11-06 22:53:02,667 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~q_req_up~0 1)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse7 (= ~q_free~0 0)) (.cse16 (<= ~q_req_up~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse15 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse13 (not .cse9)) (.cse11 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse12 .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 (<= 1 ~q_read_ev~0) .cse11 .cse14) (and .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 .cse16 .cse11 .cse14) (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse11 (<= ~c_dr_pc~0 0)) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11) (and .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 .cse13 .cse11 .cse14)))) [2023-11-06 22:53:02,667 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2023-11-06 22:53:02,667 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2023-11-06 22:53:02,667 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 419 441) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1)) (.cse12 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse19 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse20 (= ~q_free~0 0)) (.cse1 (not .cse12)) (.cse8 (not .cse18)) (.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse9 .cse15) (and .cse1 .cse16 .cse3 .cse4 .cse10 .cse5 .cse6 .cse17 .cse11 .cse18 .cse14 .cse9) (and .cse1 .cse3 .cse19 .cse10 .cse6 .cse20 .cse17 .cse11 .cse18 .cse13 .cse14) (and .cse3 .cse5 .cse6 .cse20 .cse14 .cse15) (and .cse1 .cse3 .cse10 .cse5 .cse6 .cse20 .cse17 .cse11 .cse18 .cse13 .cse14) (and .cse1 .cse3 .cse19 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse20 .cse17 .cse11 .cse18 .cse13 .cse14) (and .cse1 .cse16 .cse3 .cse4 .cse10 .cse5 .cse6 .cse17 .cse8 .cse14 .cse9) (and .cse16 .cse3 .cse4 .cse10 .cse5 .cse6 .cse17 .cse11 .cse18 .cse13 .cse14 .cse9)))) [2023-11-06 22:53:02,668 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2023-11-06 22:53:02,668 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 332 385) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~q_req_up~0 1)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse7 (= ~q_free~0 0)) (.cse16 (<= ~q_req_up~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse15 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse13 (not .cse9)) (.cse11 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse12 .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 (<= 1 ~q_read_ev~0) .cse11 .cse14) (and .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 .cse16 .cse11 .cse14) (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse11 (<= ~c_dr_pc~0 0)) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11) (and .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 .cse13 .cse11 .cse14)))) [2023-11-06 22:53:02,668 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-11-06 22:53:02,668 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2023-11-06 22:53:02,668 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 139 157) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_read_ev~0 2)) (.cse14 (= ~q_req_up~0 1)) (.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (= ~q_free~0 1)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~q_req_up~0 0)) (.cse16 (<= 1 ~q_read_ev~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse12 .cse13) (and .cse14 .cse1 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse3 .cse5 .cse7 .cse15 .cse8 .cse16 .cse12 (= ~p_num_write~0 1) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse16 .cse12 .cse13) (and .cse1 .cse3 .cse6 .cse7 .cse15 .cse8 .cse12 .cse13))) [2023-11-06 22:53:02,669 INFO L899 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2023-11-06 22:53:02,669 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2023-11-06 22:53:02,669 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 168 216) the Hoare annotation is: (and (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~q_write_ev~0) (not (= ~c_dr_st~0 0)) (= 1 ~c_dr_i~0) (= ~q_free~0 0) (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~c_dr_pc~0 1) (<= ~q_req_up~0 0) (= ~p_dw_pc~0 1) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1)) [2023-11-06 22:53:02,669 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:53:02,669 INFO L895 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2023-11-06 22:53:02,670 INFO L899 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2023-11-06 22:53:02,670 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2023-11-06 22:53:02,670 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2023-11-06 22:53:02,670 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2023-11-06 22:53:02,670 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:53:02,670 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2023-11-06 22:53:02,671 INFO L895 garLoopResultBuilder]: At program point L141(lines 141 149) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse8 (<= ~c_dr_pc~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 .cse9 .cse5 (= ~q_free~0 0) .cse6 .cse7 .cse8) (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse9 .cse5 .cse6 (= ~c_dr_pc~0 1) (= ~q_read_ev~0 2) .cse7))) [2023-11-06 22:53:02,671 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1)) (.cse23 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~q_req_up~0 1)) (.cse20 (<= 1 ~q_read_ev~0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse12 (= ~p_num_write~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse16 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse7 (= ~q_free~0 0)) (.cse1 (not .cse23)) (.cse19 (not .cse9)) (.cse21 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse22 (<= ~q_req_up~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~p_dw_i~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse2 .cse14 .cse5 .cse6 .cse15 .cse16 .cse11 .cse17 .cse18) (and .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse6 .cse15 .cse19 .cse17) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse7 .cse16 .cse20 .cse11 (= ~p_num_write~0 1) .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse20 .cse11 .cse17) (and .cse12 .cse13 .cse2 .cse14 .cse4 .cse6 .cse15 .cse22 .cse23 .cse10 .cse11 .cse17 .cse18) (and .cse1 .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse11 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11) (and .cse2 .cse5 .cse6 .cse7 .cse11 .cse18) (and .cse12 .cse13 .cse2 .cse14 .cse4 .cse5 .cse6 .cse16 .cse8 .cse22 .cse10 .cse11 .cse17) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11) (and .cse1 .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse19 .cse11 .cse17) (and .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse10 .cse11 .cse17)))) [2023-11-06 22:53:02,671 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2023-11-06 22:53:02,671 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 448 464) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2023-11-06 22:53:02,672 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2023-11-06 22:53:02,672 INFO L895 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2023-11-06 22:53:02,672 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1)) (.cse23 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~q_req_up~0 1)) (.cse20 (<= 1 ~q_read_ev~0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse12 (= ~p_num_write~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse16 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse7 (= ~q_free~0 0)) (.cse1 (not .cse23)) (.cse19 (not .cse9)) (.cse21 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse22 (<= ~q_req_up~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~p_dw_i~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse2 .cse14 .cse5 .cse6 .cse15 .cse16 .cse11 .cse17 .cse18) (and .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse6 .cse15 .cse19 .cse17) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse7 .cse16 .cse20 .cse11 (= ~p_num_write~0 1) .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse20 .cse11 .cse17) (and .cse12 .cse13 .cse2 .cse14 .cse4 .cse6 .cse15 .cse22 .cse23 .cse10 .cse11 .cse17 .cse18) (and .cse1 .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse11 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11) (and .cse2 .cse5 .cse6 .cse7 .cse11 .cse18) (and .cse12 .cse13 .cse2 .cse14 .cse4 .cse5 .cse6 .cse16 .cse8 .cse22 .cse10 .cse11 .cse17) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11) (and .cse1 .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse19 .cse11 .cse17) (and .cse21 .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse10 .cse11 .cse17)))) [2023-11-06 22:53:02,673 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 386 404) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (= ~q_free~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse5 (not .cse11)) (.cse7 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_i~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse1 .cse3 .cse4 .cse14 .cse12 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse14 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse15 .cse12 .cse6)))) [2023-11-06 22:53:02,673 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2023-11-06 22:53:02,673 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 180 211) the Hoare annotation is: (let ((.cse13 (= ~p_dw_st~0 0))) (let ((.cse2 (= ~c_num_read~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse13)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (<= 1 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_free~0 0) .cse7 .cse8 .cse9 (= ~p_num_write~0 1) .cse10) (and (= ~p_num_write~0 0) .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (<= ~q_req_up~0 0) (not .cse12) .cse13 (= ~q_read_ev~0 2) .cse9 .cse14 .cse10) (and (let ((.cse15 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse15 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1) .cse12 .cse9 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10))) .cse8)))) [2023-11-06 22:53:02,673 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 1))) (let ((.cse4 (= ~q_free~0 0)) (.cse6 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse11 (not .cse7)) (.cse9 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse10 .cse2 .cse3 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse10 .cse14 .cse2 .cse3 .cse5 .cse6 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse13 .cse1 .cse10 .cse14 .cse2 .cse3 .cse5 .cse11 .cse9 .cse12)))) [2023-11-06 22:53:02,674 INFO L895 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse12 (= ~q_free~0 0)) (.cse10 (<= ~q_req_up~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse7 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse5 (not .cse13)) (.cse11 (= ~p_dw_i~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse11 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse9 .cse10 .cse13 .cse14 .cse11) (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse12 .cse9 .cse10 .cse13 .cse14 .cse11) (and .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6)))) [2023-11-06 22:53:02,674 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2023-11-06 22:53:02,674 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2023-11-06 22:53:02,674 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 61 79) no Hoare annotation was computed. [2023-11-06 22:53:02,674 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2023-11-06 22:53:02,675 INFO L895 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse2 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_write_ev~0 2)) (.cse12 (< 0 ~q_req_up~0)) (.cse14 (not .cse3)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not (= ~p_num_write~0 0))) (.cse17 (not (= ~c_num_read~0 0))) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (= ~q_free~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~q_free~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse19 (< 0 ~c_dr_pc~0)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse8 .cse9 .cse15 .cse11) (or .cse0 .cse12 (= ~q_read_ev~0 1) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not .cse4) .cse12 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse16 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse15 .cse10 .cse19 .cse11) (or .cse0 .cse12 .cse1 .cse13 .cse14 .cse4 (= ~q_write_ev~0 0) .cse5 .cse6 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse8 .cse15 .cse11) (or .cse0 .cse1 .cse13 .cse4 .cse6 .cse8 .cse15 .cse19 .cse11) (or .cse0 .cse16 .cse1 .cse17 .cse3 .cse4 .cse18 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse8 .cse19 .cse11)))) [2023-11-06 22:53:02,675 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 61 79) the Hoare annotation is: true [2023-11-06 22:53:02,675 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2023-11-06 22:53:02,675 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-06 22:53:02,675 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-06 22:53:02,675 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-06 22:53:02,676 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2023-11-06 22:53:02,679 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] [2023-11-06 22:53:02,681 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:53:02,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:53:02 BoogieIcfgContainer [2023-11-06 22:53:02,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:53:02,783 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:53:02,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:53:02,783 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:53:02,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:52" (3/4) ... [2023-11-06 22:53:02,785 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:53:02,789 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-06 22:53:02,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-06 22:53:02,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-06 22:53:02,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-06 22:53:02,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-06 22:53:02,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-06 22:53:02,791 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-06 22:53:02,791 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-06 22:53:02,807 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-06 22:53:02,808 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:53:02,808 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:53:02,809 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:53:02,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || (\old(q_write_ev) == 0)) || !(((c_num_read + 1) == p_num_write))) || !((1 == c_dr_i))) && ((((((((c_dr_st == 0) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || (\old(q_read_ev) == q_read_ev)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || (\old(q_read_ev) < 1)) || (\old(q_write_ev) < 2)) || !((\old(q_req_up) == 1))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || ((q_req_up <= 0) && (q_write_ev == \old(q_write_ev)))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((1 == c_dr_i)))) && ((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && ((((((((((((c_dr_st == 0) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (q_write_ev == \old(q_write_ev))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || ((q_req_up <= 0) && (q_read_ev == 2))) || (\old(q_write_ev) < 2)) || !((\old(q_req_up) == 1))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((1 == c_dr_i)))) && (((((((((((((0 < \old(q_req_up)) || !((p_dw_st == 0))) || !((\old(q_read_ev) == \old(q_write_ev)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((\old(q_read_ev) == 2))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) [2023-11-06 22:53:02,893 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || (\old(q_write_ev) == 0)) || !(((c_num_read + 1) == p_num_write))) || !((1 == c_dr_i))) && ((((((((c_dr_st == 0) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || (\old(q_read_ev) == q_read_ev)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || (\old(q_read_ev) < 1)) || (\old(q_write_ev) < 2)) || !((\old(q_req_up) == 1))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || ((q_req_up <= 0) && (q_write_ev == \old(q_write_ev)))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((1 == c_dr_i)))) && ((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && ((((((((((((c_dr_st == 0) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (q_write_ev == \old(q_write_ev))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || ((q_req_up <= 0) && (q_read_ev == 2))) || (\old(q_write_ev) < 2)) || !((\old(q_req_up) == 1))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((1 == c_dr_i)))) && (((((((((((((0 < \old(q_req_up)) || !((p_dw_st == 0))) || !((\old(q_read_ev) == \old(q_write_ev)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((\old(q_read_ev) == 2))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) [2023-11-06 22:53:02,922 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:53:02,922 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:53:02,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:53:02,923 INFO L158 Benchmark]: Toolchain (without parser) took 71244.06ms. Allocated memory was 146.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 102.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-06 22:53:02,923 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 94.4MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:02,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.27ms. Allocated memory is still 146.8MB. Free memory was 101.7MB in the beginning and 88.4MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:53:02,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 146.8MB. Free memory was 88.4MB in the beginning and 86.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:02,924 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 146.8MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:02,925 INFO L158 Benchmark]: RCFGBuilder took 514.22ms. Allocated memory is still 146.8MB. Free memory was 84.9MB in the beginning and 108.2MB in the end (delta: -23.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2023-11-06 22:53:02,925 INFO L158 Benchmark]: TraceAbstraction took 70143.51ms. Allocated memory was 146.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 107.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-11-06 22:53:02,925 INFO L158 Benchmark]: Witness Printer took 139.90ms. Allocated memory is still 3.3GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:53:02,927 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.30ms. Allocated memory is still 94.4MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.27ms. Allocated memory is still 146.8MB. Free memory was 101.7MB in the beginning and 88.4MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 146.8MB. Free memory was 88.4MB in the beginning and 86.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 146.8MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.22ms. Allocated memory is still 146.8MB. Free memory was 84.9MB in the beginning and 108.2MB in the end (delta: -23.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 70143.51ms. Allocated memory was 146.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 107.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 139.90ms. Allocated memory is still 3.3GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: 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 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.0s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8988 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8799 mSDsluCounter, 8206 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6103 mSDsCounter, 2171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8151 IncrementalHoareTripleChecker+Invalid, 10322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2171 mSolverCounterUnsat, 2103 mSDtfsCounter, 8151 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 1986 SyntacticMatches, 5 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13027occurred in iteration=13, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 8264 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 11931 PreInvPairs, 12450 NumberOfFragments, 8478 HoareAnnotationTreeSize, 11931 FomulaSimplifications, 431008 FormulaSimplificationTreeSizeReduction, 10.0s HoareSimplificationTime, 41 FomulaSimplificationsInter, 64144 FormulaSimplificationTreeSizeReductionInter, 19.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3134 NumberOfCodeBlocks, 3134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3590 ConstructedInterpolants, 0 QuantifiedInterpolants, 6875 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2993 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 1916/1975 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 1 specifications checked. All of them hold - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0)) || (((((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (q_req_up <= 0)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0))) || (((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0))) && (1 <= q_read_ev))) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) || ((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || (((((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (1 == c_dr_i) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && (c_last_read == p_last_write)) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) || ((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0))) || ((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (1 <= tmp___1)) && (q_req_up <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || (((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0) || (__retres1 == 0)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((c_dr_pc == p_dw_pc))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i))) && (((((((((((((!((p_dw_st == 0)) || (0 < q_req_up)) || (__retres1 == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || !((q_read_ev == 1))) || (0 < q_req_up)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || ((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (__retres1 == 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (c_last_read == p_last_write))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && ((((((((((((c_dr_st == 0) || (0 < q_req_up)) || (__retres1 == 0)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || (0 < q_req_up)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || ((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (__retres1 == 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (c_last_read == p_last_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && ((((((((((((((c_dr_st == 0) || (0 < q_req_up)) || (__retres1 == 0)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (1 <= q_write_ev)) || (p_dw_st == 0)) || (q_write_ev == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((q_read_ev == 2))) || !((1 == c_dr_i)))) && ((((((((((((c_dr_st == 0) || (__retres1 == 0)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((c_dr_st == 0) || (__retres1 == 0)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && (c_last_read == p_last_write)) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0))) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (__retres1 == 0)) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((1 == c_dr_i))) && ((((((((((((c_dr_st == 0) || (0 < q_req_up)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || (__retres1 == 0)) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || (0 < q_req_up)) || (q_read_ev == 1)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (__retres1 == 0)) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((((!((p_dw_st == 0)) || (0 < q_req_up)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1))) || !((q_free == 1))) || (__retres1 == 0)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || (0 < q_req_up)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || (q_write_ev == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || (__retres1 == 0)) || !((q_read_ev == 2))) || !((1 == c_dr_i)))) && (((((((((c_dr_st == 0) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || !((p_dw_i == 1))) || (__retres1 == 0)) || !((q_read_ev == 2))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((c_dr_st == 0) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((c_dr_pc == p_dw_pc))) || !((q_free == 1))) || (__retres1 == 0)) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((c_dr_st == 0) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((p_dw_i == 1))) || (__retres1 == 0)) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1) || (c_dr_st == 0)) || !((p_dw_st == 0))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i))) && ((((((((((((((1 <= __retres1) || (c_dr_st == 0)) || !((p_dw_st == 0))) || (0 < q_req_up)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((((1 <= __retres1) || (0 < q_req_up)) || !((c_dr_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((1 == c_dr_i)))) && ((((((((1 <= __retres1) || (c_dr_st == 0)) || !((p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((((1 <= __retres1) || !((p_num_write == 1))) || !((q_req_up == 1))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_st == 0)) || (q_read_ev < 1)) || !((p_dw_i == 1))) || (q_write_ev < 2)) || (!((c_dr_st == 0)) && (q_read_ev == 2))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && ((((((((((((((1 <= __retres1) || (c_dr_st == 0)) || !((p_dw_st == 0))) || (0 < q_req_up)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && ((((((((((((((1 <= __retres1) || !((p_dw_st == 0))) || (0 < q_req_up)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (1 == c_dr_i) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) || (((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0))) || ((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0))) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (1 <= tmp___1)) && (q_req_up <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) || (((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || (((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || (((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && (c_last_read == p_last_write)) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0)) || (((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (p_dw_i == 1)) && (c_dr_pc <= 0))) || (((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || (\old(q_write_ev) == 0)) || !(((c_num_read + 1) == p_num_write))) || !((1 == c_dr_i))) && ((((((((c_dr_st == 0) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || (\old(q_read_ev) == q_read_ev)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || (\old(q_read_ev) < 1)) || (\old(q_write_ev) < 2)) || !((\old(q_req_up) == 1))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || ((q_req_up <= 0) && (q_write_ev == \old(q_write_ev)))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((1 == c_dr_i)))) && ((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && ((((((((((((c_dr_st == 0) || (\old(q_write_ev) < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (q_write_ev == \old(q_write_ev))) || (p_dw_st == 0)) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((1 == c_dr_i)))) && (((((((((((((c_dr_st == 0) || ((q_req_up <= 0) && (q_read_ev == 2))) || (\old(q_write_ev) < 2)) || !((\old(q_req_up) == 1))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((1 == c_dr_i)))) && (((((((((((((0 < \old(q_req_up)) || !((p_dw_st == 0))) || !((\old(q_read_ev) == \old(q_write_ev)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((\old(q_read_ev) == 2))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:53:02,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c903b96c-4ff5-4514-adb2-15bb8fdff26a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE