./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:04:59,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:04:59,621 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:04:59,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:04:59,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:04:59,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:04:59,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:04:59,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:04:59,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:04:59,689 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:04:59,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:04:59,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:04:59,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:04:59,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:04:59,693 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:04:59,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:04:59,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:04:59,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:04:59,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:04:59,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:04:59,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:04:59,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:04:59,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:04:59,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:04:59,697 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:04:59,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:04:59,698 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:04:59,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:04:59,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:04:59,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:04:59,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:04:59,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:59,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:04:59,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:04:59,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:04:59,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:04:59,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:04:59,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:04:59,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:04:59,704 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:04:59,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:04:59,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:04:59,705 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_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/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_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2023-11-26 12:04:59,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:05:00,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:05:00,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:05:00,005 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:05:00,005 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:05:00,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-26 12:05:03,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:05:03,550 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:05:03,551 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-26 12:05:03,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/data/bb5b6aac7/8b768f29387e4c889918a836b4580b82/FLAG00a4ef78d [2023-11-26 12:05:03,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/data/bb5b6aac7/8b768f29387e4c889918a836b4580b82 [2023-11-26 12:05:03,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:05:03,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:05:03,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:03,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:05:03,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:05:03,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:03" (1/1) ... [2023-11-26 12:05:03,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eea7086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:03, skipping insertion in model container [2023-11-26 12:05:03,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:03" (1/1) ... [2023-11-26 12:05:03,652 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:05:03,864 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_ddadd538-b594-4c5f-8b97-ec42aedccbe6/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2023-11-26 12:05:03,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:03,993 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:05:04,006 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_ddadd538-b594-4c5f-8b97-ec42aedccbe6/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2023-11-26 12:05:04,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:04,111 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:05:04,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04 WrapperNode [2023-11-26 12:05:04,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:04,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:04,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:05:04,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:05:04,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,200 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 847 [2023-11-26 12:05:04,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:04,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:05:04,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:05:04,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:05:04,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,240 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 12:05:04,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:05:04,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:05:04,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:05:04,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:05:04,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (1/1) ... [2023-11-26 12:05:04,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:04,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:04,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:05:04,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:05:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:05:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:05:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-26 12:05:04,415 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-26 12:05:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:05:04,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:05:04,513 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:05:04,516 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:05:05,482 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:05:05,594 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:05:05,595 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-26 12:05:05,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:05 BoogieIcfgContainer [2023-11-26 12:05:05,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:05:05,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:05:05,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:05:05,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:05:05,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:03" (1/3) ... [2023-11-26 12:05:05,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37763753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:05, skipping insertion in model container [2023-11-26 12:05:05,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:04" (2/3) ... [2023-11-26 12:05:05,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37763753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:05, skipping insertion in model container [2023-11-26 12:05:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:05" (3/3) ... [2023-11-26 12:05:05,613 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2023-11-26 12:05:05,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:05:05,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:05:05,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:05:05,709 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42af95d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:05:05,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:05:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 239 states have (on average 1.9372384937238494) internal successors, (463), 245 states have internal predecessors, (463), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-26 12:05:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 12:05:05,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:05,730 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] [2023-11-26 12:05:05,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:05,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1942219643, now seen corresponding path program 1 times [2023-11-26 12:05:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:05,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730997799] [2023-11-26 12:05:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:06,122 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-26 12:05:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730997799] [2023-11-26 12:05:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730997799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755331613] [2023-11-26 12:05:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:06,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:06,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:06,189 INFO L87 Difference]: Start difference. First operand has 247 states, 239 states have (on average 1.9372384937238494) internal successors, (463), 245 states have internal predecessors, (463), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:06,742 INFO L93 Difference]: Finished difference Result 650 states and 1243 transitions. [2023-11-26 12:05:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-26 12:05:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:06,761 INFO L225 Difference]: With dead ends: 650 [2023-11-26 12:05:06,761 INFO L226 Difference]: Without dead ends: 403 [2023-11-26 12:05:06,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:06,771 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 239 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:06,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 686 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 12:05:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-11-26 12:05:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 396. [2023-11-26 12:05:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 390 states have (on average 1.6333333333333333) internal successors, (637), 394 states have internal predecessors, (637), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 642 transitions. [2023-11-26 12:05:06,855 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 642 transitions. Word has length 26 [2023-11-26 12:05:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:06,856 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 642 transitions. [2023-11-26 12:05:06,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 642 transitions. [2023-11-26 12:05:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-26 12:05:06,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:06,861 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] [2023-11-26 12:05:06,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:05:06,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:06,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -849969164, now seen corresponding path program 1 times [2023-11-26 12:05:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133716167] [2023-11-26 12:05:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:06,930 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-26 12:05:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133716167] [2023-11-26 12:05:06,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133716167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:06,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:06,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314775179] [2023-11-26 12:05:06,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:06,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:06,936 INFO L87 Difference]: Start difference. First operand 396 states and 642 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:07,098 INFO L93 Difference]: Finished difference Result 1036 states and 1704 transitions. [2023-11-26 12:05:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-26 12:05:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:07,104 INFO L225 Difference]: With dead ends: 1036 [2023-11-26 12:05:07,105 INFO L226 Difference]: Without dead ends: 653 [2023-11-26 12:05:07,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:07,109 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 304 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:07,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 916 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-11-26 12:05:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 646. [2023-11-26 12:05:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 640 states have (on average 1.6640625) internal successors, (1065), 644 states have internal predecessors, (1065), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1070 transitions. [2023-11-26 12:05:07,161 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1070 transitions. Word has length 35 [2023-11-26 12:05:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:07,161 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 1070 transitions. [2023-11-26 12:05:07,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1070 transitions. [2023-11-26 12:05:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-26 12:05:07,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:07,166 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] [2023-11-26 12:05:07,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:05:07,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:07,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash 626917057, now seen corresponding path program 1 times [2023-11-26 12:05:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975978992] [2023-11-26 12:05:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:07,255 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-26 12:05:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975978992] [2023-11-26 12:05:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975978992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:07,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:07,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345982553] [2023-11-26 12:05:07,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:07,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:07,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:07,266 INFO L87 Difference]: Start difference. First operand 646 states and 1070 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:07,369 INFO L93 Difference]: Finished difference Result 1628 states and 2703 transitions. [2023-11-26 12:05:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-26 12:05:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:07,377 INFO L225 Difference]: With dead ends: 1628 [2023-11-26 12:05:07,377 INFO L226 Difference]: Without dead ends: 1006 [2023-11-26 12:05:07,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:07,380 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 328 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:07,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 730 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2023-11-26 12:05:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 995. [2023-11-26 12:05:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 989 states have (on average 1.6612740141557127) internal successors, (1643), 993 states have internal predecessors, (1643), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1648 transitions. [2023-11-26 12:05:07,432 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1648 transitions. Word has length 36 [2023-11-26 12:05:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:07,433 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1648 transitions. [2023-11-26 12:05:07,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1648 transitions. [2023-11-26 12:05:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-26 12:05:07,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:07,436 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:05:07,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:05:07,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:07,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1434445802, now seen corresponding path program 1 times [2023-11-26 12:05:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822116556] [2023-11-26 12:05:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822116556] [2023-11-26 12:05:07,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822116556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:07,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639004760] [2023-11-26 12:05:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:07,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:07,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:07,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:07,580 INFO L87 Difference]: Start difference. First operand 995 states and 1648 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:08,227 INFO L93 Difference]: Finished difference Result 3506 states and 5820 transitions. [2023-11-26 12:05:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:08,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-26 12:05:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:08,244 INFO L225 Difference]: With dead ends: 3506 [2023-11-26 12:05:08,244 INFO L226 Difference]: Without dead ends: 2535 [2023-11-26 12:05:08,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:08,248 INFO L413 NwaCegarLoop]: 576 mSDtfsCounter, 1085 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:08,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1407 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:05:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2023-11-26 12:05:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2053. [2023-11-26 12:05:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2047 states have (on average 1.65657059110894) internal successors, (3391), 2051 states have internal predecessors, (3391), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3396 transitions. [2023-11-26 12:05:08,345 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3396 transitions. Word has length 43 [2023-11-26 12:05:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:08,345 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 3396 transitions. [2023-11-26 12:05:08,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3396 transitions. [2023-11-26 12:05:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-26 12:05:08,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:08,348 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] [2023-11-26 12:05:08,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:05:08,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:08,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash -528401876, now seen corresponding path program 1 times [2023-11-26 12:05:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358084049] [2023-11-26 12:05:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:08,461 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-26 12:05:08,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358084049] [2023-11-26 12:05:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358084049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:08,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437121781] [2023-11-26 12:05:08,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:08,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:08,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:08,466 INFO L87 Difference]: Start difference. First operand 2053 states and 3396 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:09,094 INFO L93 Difference]: Finished difference Result 5998 states and 9795 transitions. [2023-11-26 12:05:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:05:09,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-26 12:05:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:09,120 INFO L225 Difference]: With dead ends: 5998 [2023-11-26 12:05:09,120 INFO L226 Difference]: Without dead ends: 3963 [2023-11-26 12:05:09,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:09,126 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 692 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:09,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 915 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:05:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2023-11-26 12:05:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3617. [2023-11-26 12:05:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3611 states have (on average 1.6194959844918304) internal successors, (5848), 3615 states have internal predecessors, (5848), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5853 transitions. [2023-11-26 12:05:09,346 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5853 transitions. Word has length 50 [2023-11-26 12:05:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:09,347 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5853 transitions. [2023-11-26 12:05:09,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5853 transitions. [2023-11-26 12:05:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-26 12:05:09,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:09,351 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] [2023-11-26 12:05:09,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:05:09,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:09,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1616382261, now seen corresponding path program 1 times [2023-11-26 12:05:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124427607] [2023-11-26 12:05:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:09,450 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-26 12:05:09,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:09,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124427607] [2023-11-26 12:05:09,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124427607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:09,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:09,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:09,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564914862] [2023-11-26 12:05:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:09,461 INFO L87 Difference]: Start difference. First operand 3617 states and 5853 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:09,726 INFO L93 Difference]: Finished difference Result 8582 states and 13842 transitions. [2023-11-26 12:05:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-26 12:05:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:09,759 INFO L225 Difference]: With dead ends: 8582 [2023-11-26 12:05:09,759 INFO L226 Difference]: Without dead ends: 4987 [2023-11-26 12:05:09,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:09,767 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 343 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:09,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 625 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2023-11-26 12:05:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4711. [2023-11-26 12:05:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4711 states, 4705 states have (on average 1.5982996811902233) internal successors, (7520), 4709 states have internal predecessors, (7520), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4711 states to 4711 states and 7525 transitions. [2023-11-26 12:05:10,058 INFO L78 Accepts]: Start accepts. Automaton has 4711 states and 7525 transitions. Word has length 50 [2023-11-26 12:05:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:10,059 INFO L495 AbstractCegarLoop]: Abstraction has 4711 states and 7525 transitions. [2023-11-26 12:05:10,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4711 states and 7525 transitions. [2023-11-26 12:05:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-26 12:05:10,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:10,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:10,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:05:10,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:10,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash 383831093, now seen corresponding path program 1 times [2023-11-26 12:05:10,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:10,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116145684] [2023-11-26 12:05:10,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:10,172 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-26 12:05:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116145684] [2023-11-26 12:05:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116145684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:10,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95341063] [2023-11-26 12:05:10,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:10,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:10,176 INFO L87 Difference]: Start difference. First operand 4711 states and 7525 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:10,715 INFO L93 Difference]: Finished difference Result 11379 states and 18257 transitions. [2023-11-26 12:05:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-26 12:05:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:10,757 INFO L225 Difference]: With dead ends: 11379 [2023-11-26 12:05:10,757 INFO L226 Difference]: Without dead ends: 6690 [2023-11-26 12:05:10,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:10,767 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 229 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:10,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 775 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:05:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6690 states. [2023-11-26 12:05:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6690 to 5447. [2023-11-26 12:05:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5447 states, 5441 states have (on average 1.5421797463701525) internal successors, (8391), 5445 states have internal predecessors, (8391), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 5447 states and 8396 transitions. [2023-11-26 12:05:11,099 INFO L78 Accepts]: Start accepts. Automaton has 5447 states and 8396 transitions. Word has length 54 [2023-11-26 12:05:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:11,100 INFO L495 AbstractCegarLoop]: Abstraction has 5447 states and 8396 transitions. [2023-11-26 12:05:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5447 states and 8396 transitions. [2023-11-26 12:05:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-26 12:05:11,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:11,103 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] [2023-11-26 12:05:11,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:05:11,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:11,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash 78251081, now seen corresponding path program 1 times [2023-11-26 12:05:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349138744] [2023-11-26 12:05:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:11,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:11,177 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-26 12:05:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349138744] [2023-11-26 12:05:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349138744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:11,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772223261] [2023-11-26 12:05:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:11,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:11,187 INFO L87 Difference]: Start difference. First operand 5447 states and 8396 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:11,480 INFO L93 Difference]: Finished difference Result 10738 states and 16570 transitions. [2023-11-26 12:05:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:11,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-11-26 12:05:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:11,527 INFO L225 Difference]: With dead ends: 10738 [2023-11-26 12:05:11,527 INFO L226 Difference]: Without dead ends: 5313 [2023-11-26 12:05:11,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:11,536 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 320 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:11,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 393 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2023-11-26 12:05:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5313. [2023-11-26 12:05:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5313 states, 5307 states have (on average 1.5213868475598267) internal successors, (8074), 5311 states have internal predecessors, (8074), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5313 states to 5313 states and 8079 transitions. [2023-11-26 12:05:11,897 INFO L78 Accepts]: Start accepts. Automaton has 5313 states and 8079 transitions. Word has length 56 [2023-11-26 12:05:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:11,898 INFO L495 AbstractCegarLoop]: Abstraction has 5313 states and 8079 transitions. [2023-11-26 12:05:11,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5313 states and 8079 transitions. [2023-11-26 12:05:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-26 12:05:11,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:11,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:11,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:05:11,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:11,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash 268995730, now seen corresponding path program 1 times [2023-11-26 12:05:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218358872] [2023-11-26 12:05:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:11,962 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-26 12:05:11,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218358872] [2023-11-26 12:05:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218358872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:11,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:11,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:11,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958634298] [2023-11-26 12:05:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:11,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:11,965 INFO L87 Difference]: Start difference. First operand 5313 states and 8079 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:12,265 INFO L93 Difference]: Finished difference Result 10275 states and 15754 transitions. [2023-11-26 12:05:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-11-26 12:05:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:12,279 INFO L225 Difference]: With dead ends: 10275 [2023-11-26 12:05:12,279 INFO L226 Difference]: Without dead ends: 4984 [2023-11-26 12:05:12,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:12,289 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 150 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:12,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 815 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2023-11-26 12:05:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4317. [2023-11-26 12:05:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 4311 states have (on average 1.5474367896079795) internal successors, (6671), 4315 states have internal predecessors, (6671), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6676 transitions. [2023-11-26 12:05:12,507 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6676 transitions. Word has length 57 [2023-11-26 12:05:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:12,507 INFO L495 AbstractCegarLoop]: Abstraction has 4317 states and 6676 transitions. [2023-11-26 12:05:12,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6676 transitions. [2023-11-26 12:05:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 12:05:12,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:12,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:12,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:05:12,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:12,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1992167834, now seen corresponding path program 1 times [2023-11-26 12:05:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:12,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713739365] [2023-11-26 12:05:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:12,619 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-26 12:05:12,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:12,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713739365] [2023-11-26 12:05:12,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713739365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:05:12,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204126202] [2023-11-26 12:05:12,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:12,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:12,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:12,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:12,622 INFO L87 Difference]: Start difference. First operand 4317 states and 6676 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:13,449 INFO L93 Difference]: Finished difference Result 12632 states and 19535 transitions. [2023-11-26 12:05:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 12:05:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-26 12:05:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:13,471 INFO L225 Difference]: With dead ends: 12632 [2023-11-26 12:05:13,471 INFO L226 Difference]: Without dead ends: 8517 [2023-11-26 12:05:13,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:05:13,480 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 902 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:13,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 2153 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 12:05:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8517 states. [2023-11-26 12:05:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8517 to 5861. [2023-11-26 12:05:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5861 states, 5855 states have (on average 1.55132365499573) internal successors, (9083), 5859 states have internal predecessors, (9083), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 9088 transitions. [2023-11-26 12:05:13,844 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 9088 transitions. Word has length 59 [2023-11-26 12:05:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:13,845 INFO L495 AbstractCegarLoop]: Abstraction has 5861 states and 9088 transitions. [2023-11-26 12:05:13,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 9088 transitions. [2023-11-26 12:05:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 12:05:13,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:13,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:13,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:05:13,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:13,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1616535386, now seen corresponding path program 1 times [2023-11-26 12:05:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446449472] [2023-11-26 12:05:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:13,986 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-26 12:05:13,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446449472] [2023-11-26 12:05:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446449472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:13,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:05:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190265711] [2023-11-26 12:05:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:13,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:05:13,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:05:13,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:05:13,990 INFO L87 Difference]: Start difference. First operand 5861 states and 9088 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:14,476 INFO L93 Difference]: Finished difference Result 8484 states and 12980 transitions. [2023-11-26 12:05:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 12:05:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-26 12:05:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:14,495 INFO L225 Difference]: With dead ends: 8484 [2023-11-26 12:05:14,495 INFO L226 Difference]: Without dead ends: 8481 [2023-11-26 12:05:14,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-26 12:05:14,500 INFO L413 NwaCegarLoop]: 492 mSDtfsCounter, 812 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:14,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2682 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8481 states. [2023-11-26 12:05:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8481 to 6201. [2023-11-26 12:05:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6201 states, 6195 states have (on average 1.5404358353510896) internal successors, (9543), 6199 states have internal predecessors, (9543), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 9548 transitions. [2023-11-26 12:05:14,836 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 9548 transitions. Word has length 60 [2023-11-26 12:05:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:14,837 INFO L495 AbstractCegarLoop]: Abstraction has 6201 states and 9548 transitions. [2023-11-26 12:05:14,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 9548 transitions. [2023-11-26 12:05:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-26 12:05:14,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:14,840 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:05:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:05:14,840 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:14,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1019410675, now seen corresponding path program 1 times [2023-11-26 12:05:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776504290] [2023-11-26 12:05:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:14,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776504290] [2023-11-26 12:05:14,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776504290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:14,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:14,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054086561] [2023-11-26 12:05:14,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:14,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:14,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:14,882 INFO L87 Difference]: Start difference. First operand 6201 states and 9548 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:15,233 INFO L93 Difference]: Finished difference Result 13133 states and 20166 transitions. [2023-11-26 12:05:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:15,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-11-26 12:05:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:15,249 INFO L225 Difference]: With dead ends: 13133 [2023-11-26 12:05:15,250 INFO L226 Difference]: Without dead ends: 6952 [2023-11-26 12:05:15,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:15,261 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 122 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:15,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 724 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2023-11-26 12:05:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 6866. [2023-11-26 12:05:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6866 states, 6860 states have (on average 1.5323615160349855) internal successors, (10512), 6864 states have internal predecessors, (10512), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6866 states to 6866 states and 10517 transitions. [2023-11-26 12:05:15,604 INFO L78 Accepts]: Start accepts. Automaton has 6866 states and 10517 transitions. Word has length 74 [2023-11-26 12:05:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:15,604 INFO L495 AbstractCegarLoop]: Abstraction has 6866 states and 10517 transitions. [2023-11-26 12:05:15,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6866 states and 10517 transitions. [2023-11-26 12:05:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-26 12:05:15,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:15,608 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-26 12:05:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:05:15,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:15,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2089129415, now seen corresponding path program 1 times [2023-11-26 12:05:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:15,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808202666] [2023-11-26 12:05:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808202666] [2023-11-26 12:05:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808202666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:15,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119979456] [2023-11-26 12:05:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:15,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:15,683 INFO L87 Difference]: Start difference. First operand 6866 states and 10517 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:16,608 INFO L93 Difference]: Finished difference Result 17795 states and 26970 transitions. [2023-11-26 12:05:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2023-11-26 12:05:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:16,639 INFO L225 Difference]: With dead ends: 17795 [2023-11-26 12:05:16,640 INFO L226 Difference]: Without dead ends: 10816 [2023-11-26 12:05:16,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:16,651 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 600 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:16,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1107 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:05:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2023-11-26 12:05:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 9583. [2023-11-26 12:05:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9583 states, 9577 states have (on average 1.496188785632244) internal successors, (14329), 9581 states have internal predecessors, (14329), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9583 states to 9583 states and 14334 transitions. [2023-11-26 12:05:17,287 INFO L78 Accepts]: Start accepts. Automaton has 9583 states and 14334 transitions. Word has length 85 [2023-11-26 12:05:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:17,288 INFO L495 AbstractCegarLoop]: Abstraction has 9583 states and 14334 transitions. [2023-11-26 12:05:17,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9583 states and 14334 transitions. [2023-11-26 12:05:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-26 12:05:17,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:17,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-26 12:05:17,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:05:17,293 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:17,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1030734086, now seen corresponding path program 1 times [2023-11-26 12:05:17,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:17,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579762592] [2023-11-26 12:05:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:17,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579762592] [2023-11-26 12:05:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579762592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:17,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347128972] [2023-11-26 12:05:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:17,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:17,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:17,407 INFO L87 Difference]: Start difference. First operand 9583 states and 14334 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:17,723 INFO L93 Difference]: Finished difference Result 13664 states and 20498 transitions. [2023-11-26 12:05:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:17,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-11-26 12:05:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:17,733 INFO L225 Difference]: With dead ends: 13664 [2023-11-26 12:05:17,733 INFO L226 Difference]: Without dead ends: 4091 [2023-11-26 12:05:17,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:17,746 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 315 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:17,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 457 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2023-11-26 12:05:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 4033. [2023-11-26 12:05:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 4027 states have (on average 1.3970697789918054) internal successors, (5626), 4031 states have internal predecessors, (5626), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5631 transitions. [2023-11-26 12:05:17,942 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 5631 transitions. Word has length 91 [2023-11-26 12:05:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:17,943 INFO L495 AbstractCegarLoop]: Abstraction has 4033 states and 5631 transitions. [2023-11-26 12:05:17,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5631 transitions. [2023-11-26 12:05:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-26 12:05:17,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:17,945 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-26 12:05:17,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:05:17,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:17,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2072875102, now seen corresponding path program 1 times [2023-11-26 12:05:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087655631] [2023-11-26 12:05:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:18,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:18,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087655631] [2023-11-26 12:05:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087655631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:18,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:05:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306144018] [2023-11-26 12:05:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:18,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:18,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:18,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:18,053 INFO L87 Difference]: Start difference. First operand 4033 states and 5631 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:18,515 INFO L93 Difference]: Finished difference Result 9518 states and 13272 transitions. [2023-11-26 12:05:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:05:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2023-11-26 12:05:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:18,528 INFO L225 Difference]: With dead ends: 9518 [2023-11-26 12:05:18,528 INFO L226 Difference]: Without dead ends: 5649 [2023-11-26 12:05:18,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:05:18,535 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 517 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:18,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2103 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2023-11-26 12:05:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 4035. [2023-11-26 12:05:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 4029 states have (on average 1.3938942665673864) internal successors, (5616), 4033 states have internal predecessors, (5616), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5621 transitions. [2023-11-26 12:05:18,749 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5621 transitions. Word has length 95 [2023-11-26 12:05:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:18,750 INFO L495 AbstractCegarLoop]: Abstraction has 4035 states and 5621 transitions. [2023-11-26 12:05:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5621 transitions. [2023-11-26 12:05:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-26 12:05:18,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:18,752 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-26 12:05:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:05:18,753 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:18,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1856205923, now seen corresponding path program 1 times [2023-11-26 12:05:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223868435] [2023-11-26 12:05:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:18,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223868435] [2023-11-26 12:05:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223868435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635159188] [2023-11-26 12:05:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:18,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:18,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:18,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 12:05:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:18,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:05:19,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 12:05:19,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635159188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:19,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 12:05:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-26 12:05:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866193232] [2023-11-26 12:05:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:19,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:19,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:19,208 INFO L87 Difference]: Start difference. First operand 4035 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:19,466 INFO L93 Difference]: Finished difference Result 5162 states and 7178 transitions. [2023-11-26 12:05:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-11-26 12:05:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:19,478 INFO L225 Difference]: With dead ends: 5162 [2023-11-26 12:05:19,478 INFO L226 Difference]: Without dead ends: 5158 [2023-11-26 12:05:19,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:19,481 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 211 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:19,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 711 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2023-11-26 12:05:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 5020. [2023-11-26 12:05:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 5014 states have (on average 1.3974870362983647) internal successors, (7007), 5018 states have internal predecessors, (7007), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 7012 transitions. [2023-11-26 12:05:19,754 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 7012 transitions. Word has length 97 [2023-11-26 12:05:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:19,755 INFO L495 AbstractCegarLoop]: Abstraction has 5020 states and 7012 transitions. [2023-11-26 12:05:19,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 7012 transitions. [2023-11-26 12:05:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 12:05:19,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:19,759 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:05:19,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:19,974 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:19,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 631875968, now seen corresponding path program 1 times [2023-11-26 12:05:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936498796] [2023-11-26 12:05:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:20,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936498796] [2023-11-26 12:05:20,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936498796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096939645] [2023-11-26 12:05:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:20,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:20,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:20,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:20,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 12:05:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:20,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:05:20,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 12:05:20,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:20,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096939645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:20,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 12:05:20,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-26 12:05:20,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391628329] [2023-11-26 12:05:20,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:20,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:20,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:20,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:20,394 INFO L87 Difference]: Start difference. First operand 5020 states and 7012 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:20,628 INFO L93 Difference]: Finished difference Result 8908 states and 12502 transitions. [2023-11-26 12:05:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:20,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2023-11-26 12:05:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:20,638 INFO L225 Difference]: With dead ends: 8908 [2023-11-26 12:05:20,638 INFO L226 Difference]: Without dead ends: 3899 [2023-11-26 12:05:20,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:20,645 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 241 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:20,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 376 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:05:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2023-11-26 12:05:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3564. [2023-11-26 12:05:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3558 states have (on average 1.372681281618887) internal successors, (4884), 3562 states have internal predecessors, (4884), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4889 transitions. [2023-11-26 12:05:20,824 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4889 transitions. Word has length 147 [2023-11-26 12:05:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:20,825 INFO L495 AbstractCegarLoop]: Abstraction has 3564 states and 4889 transitions. [2023-11-26 12:05:20,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4889 transitions. [2023-11-26 12:05:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-26 12:05:20,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:20,829 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:05:20,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-26 12:05:21,047 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:21,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 769921568, now seen corresponding path program 1 times [2023-11-26 12:05:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112092116] [2023-11-26 12:05:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 12:05:21,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112092116] [2023-11-26 12:05:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112092116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:21,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926112535] [2023-11-26 12:05:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:21,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:21,148 INFO L87 Difference]: Start difference. First operand 3564 states and 4889 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:21,405 INFO L93 Difference]: Finished difference Result 4120 states and 5588 transitions. [2023-11-26 12:05:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2023-11-26 12:05:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:21,408 INFO L225 Difference]: With dead ends: 4120 [2023-11-26 12:05:21,409 INFO L226 Difference]: Without dead ends: 615 [2023-11-26 12:05:21,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:21,414 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 125 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:21,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 342 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 12:05:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2023-11-26 12:05:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 607. [2023-11-26 12:05:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 603 states have (on average 1.0829187396351576) internal successors, (653), 605 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 656 transitions. [2023-11-26 12:05:21,465 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 656 transitions. Word has length 150 [2023-11-26 12:05:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:21,466 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 656 transitions. [2023-11-26 12:05:21,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 656 transitions. [2023-11-26 12:05:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-26 12:05:21,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:21,470 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:05:21,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 12:05:21,470 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:21,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash 80761447, now seen corresponding path program 1 times [2023-11-26 12:05:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:21,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873417428] [2023-11-26 12:05:21,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:21,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 12:05:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873417428] [2023-11-26 12:05:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873417428] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515147615] [2023-11-26 12:05:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:21,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:21,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:21,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:21,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 12:05:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:21,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:05:21,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 12:05:22,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515147615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:22,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 12:05:22,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-26 12:05:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697508151] [2023-11-26 12:05:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:22,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:22,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:05:22,078 INFO L87 Difference]: Start difference. First operand 607 states and 656 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:22,187 INFO L93 Difference]: Finished difference Result 886 states and 957 transitions. [2023-11-26 12:05:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:22,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-11-26 12:05:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:22,190 INFO L225 Difference]: With dead ends: 886 [2023-11-26 12:05:22,190 INFO L226 Difference]: Without dead ends: 516 [2023-11-26 12:05:22,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:05:22,191 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 218 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:22,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 388 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:05:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-11-26 12:05:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2023-11-26 12:05:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.080078125) internal successors, (553), 514 states have internal predecessors, (553), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 556 transitions. [2023-11-26 12:05:22,241 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 556 transitions. Word has length 153 [2023-11-26 12:05:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:22,241 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 556 transitions. [2023-11-26 12:05:22,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 556 transitions. [2023-11-26 12:05:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-26 12:05:22,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:22,245 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:05:22,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:22,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:22,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:22,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:22,452 INFO L85 PathProgramCache]: Analyzing trace with hash 820333015, now seen corresponding path program 1 times [2023-11-26 12:05:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085996472] [2023-11-26 12:05:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 12:05:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:22,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085996472] [2023-11-26 12:05:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085996472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:05:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841613875] [2023-11-26 12:05:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:22,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:05:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:05:22,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:05:22,649 INFO L87 Difference]: Start difference. First operand 516 states and 556 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:22,820 INFO L93 Difference]: Finished difference Result 527 states and 566 transitions. [2023-11-26 12:05:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:05:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2023-11-26 12:05:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:22,823 INFO L225 Difference]: With dead ends: 527 [2023-11-26 12:05:22,823 INFO L226 Difference]: Without dead ends: 524 [2023-11-26 12:05:22,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:05:22,824 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 202 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:22,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1133 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2023-11-26 12:05:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 515. [2023-11-26 12:05:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 512 states have (on average 1.076171875) internal successors, (551), 513 states have internal predecessors, (551), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 553 transitions. [2023-11-26 12:05:22,872 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 553 transitions. Word has length 155 [2023-11-26 12:05:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:22,873 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 553 transitions. [2023-11-26 12:05:22,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 553 transitions. [2023-11-26 12:05:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-26 12:05:22,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:22,876 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:05:22,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 12:05:22,877 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:22,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash -328354987, now seen corresponding path program 1 times [2023-11-26 12:05:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072317885] [2023-11-26 12:05:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 12:05:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072317885] [2023-11-26 12:05:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072317885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:23,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:05:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638347786] [2023-11-26 12:05:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:23,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:23,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:23,010 INFO L87 Difference]: Start difference. First operand 515 states and 553 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:23,123 INFO L93 Difference]: Finished difference Result 613 states and 654 transitions. [2023-11-26 12:05:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:05:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2023-11-26 12:05:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:23,126 INFO L225 Difference]: With dead ends: 613 [2023-11-26 12:05:23,126 INFO L226 Difference]: Without dead ends: 511 [2023-11-26 12:05:23,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:05:23,128 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 149 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:23,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 713 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:05:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-26 12:05:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 508. [2023-11-26 12:05:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 506 states have (on average 1.065217391304348) internal successors, (539), 506 states have internal predecessors, (539), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 540 transitions. [2023-11-26 12:05:23,174 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 540 transitions. Word has length 156 [2023-11-26 12:05:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:23,174 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 540 transitions. [2023-11-26 12:05:23,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 540 transitions. [2023-11-26 12:05:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-26 12:05:23,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:05:23,179 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:05:23,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 12:05:23,180 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:05:23,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1134668779, now seen corresponding path program 1 times [2023-11-26 12:05:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462384561] [2023-11-26 12:05:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:24,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:24,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462384561] [2023-11-26 12:05:24,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462384561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900612183] [2023-11-26 12:05:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:24,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:24,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:24,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 12:05:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:24,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-26 12:05:24,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:25,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:05:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900612183] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:05:25,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:05:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 28 [2023-11-26 12:05:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660653536] [2023-11-26 12:05:25,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:05:25,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-26 12:05:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-26 12:05:25,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2023-11-26 12:05:25,502 INFO L87 Difference]: Start difference. First operand 508 states and 540 transitions. Second operand has 28 states, 28 states have (on average 12.428571428571429) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:05:26,280 INFO L93 Difference]: Finished difference Result 517 states and 549 transitions. [2023-11-26 12:05:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-26 12:05:26,281 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.428571428571429) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2023-11-26 12:05:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:05:26,282 INFO L225 Difference]: With dead ends: 517 [2023-11-26 12:05:26,282 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 12:05:26,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2023-11-26 12:05:26,286 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 504 mSDsluCounter, 4970 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 5258 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:05:26,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 5258 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 12:05:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 12:05:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 12:05:26,287 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-26 12:05:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 12:05:26,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2023-11-26 12:05:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:05:26,288 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 12:05:26,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.428571428571429) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 12:05:26,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 12:05:26,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 12:05:26,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:26,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-26 12:05:26,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 12:05:45,718 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 764 808) no Hoare annotation was computed. [2023-11-26 12:05:45,718 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2023-11-26 12:05:45,719 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2023-11-26 12:05:45,719 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 772 807) no Hoare annotation was computed. [2023-11-26 12:05:45,719 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 835) no Hoare annotation was computed. [2023-11-26 12:05:45,719 INFO L899 garLoopResultBuilder]: For program point L829-1(lines 829 835) no Hoare annotation was computed. [2023-11-26 12:05:45,719 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 780 806) no Hoare annotation was computed. [2023-11-26 12:05:45,720 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2023-11-26 12:05:45,721 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 788 805) no Hoare annotation was computed. [2023-11-26 12:05:45,721 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 851 1112) no Hoare annotation was computed. [2023-11-26 12:05:45,721 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 796 804) no Hoare annotation was computed. [2023-11-26 12:05:45,721 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2023-11-26 12:05:45,722 INFO L895 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: false [2023-11-26 12:05:45,722 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2023-11-26 12:05:45,722 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2023-11-26 12:05:45,722 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2023-11-26 12:05:45,722 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2023-11-26 12:05:45,723 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 364 372) no Hoare annotation was computed. [2023-11-26 12:05:45,728 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 818 826) no Hoare annotation was computed. [2023-11-26 12:05:45,729 INFO L899 garLoopResultBuilder]: For program point $Ultimate##600(lines 1271 1315) no Hoare annotation was computed. [2023-11-26 12:05:45,730 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1279 1314) no Hoare annotation was computed. [2023-11-26 12:05:45,730 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1287 1313) no Hoare annotation was computed. [2023-11-26 12:05:45,730 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1295 1312) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1303 1311) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 85 844) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L174(lines 144 175) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point $Ultimate##636(lines 1325 1333) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2023-11-26 12:05:45,731 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2023-11-26 12:05:45,732 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse5 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse6 (= ~req_tt_a~0 0)) (.cse7 (= ~s_memory0~0 50)) (.cse9 (<= 0 ~a_t~0)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 6)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse12 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_rsp_d~0 50) .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse14) (and .cse1 .cse12 .cse8 .cse13 .cse10 .cse11 .cse14) (and .cse1 .cse4 .cse12 .cse8 .cse10 .cse11))) [2023-11-26 12:05:45,732 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2023-11-26 12:05:45,732 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-11-26 12:05:45,732 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2023-11-26 12:05:45,732 INFO L899 garLoopResultBuilder]: For program point L904(lines 878 905) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L895 garLoopResultBuilder]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse2 (= ~s_run_pc~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse0 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse12 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse13 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse14 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse0 .cse2 .cse12 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse0 .cse1 .cse12 (= 2 ~s_run_pc~0) .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2023-11-26 12:05:45,733 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L974(lines 974 978) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2023-11-26 12:05:45,734 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L317(lines 287 318) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-11-26 12:05:45,735 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 572 616) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 935 961) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 446 454) no Hoare annotation was computed. [2023-11-26 12:05:45,736 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2023-11-26 12:05:45,737 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2023-11-26 12:05:45,737 INFO L899 garLoopResultBuilder]: For program point L524(lines 494 525) no Hoare annotation was computed. [2023-11-26 12:05:45,737 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 468 476) no Hoare annotation was computed. [2023-11-26 12:05:45,740 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2023-11-26 12:05:45,742 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2023-11-26 12:05:45,743 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2023-11-26 12:05:45,743 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-11-26 12:05:45,743 INFO L899 garLoopResultBuilder]: For program point L131(lines 101 843) no Hoare annotation was computed. [2023-11-26 12:05:45,743 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 386 394) no Hoare annotation was computed. [2023-11-26 12:05:45,743 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (not (= ~s_run_st~0 0)) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~s_memory0~0 50) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)) [2023-11-26 12:05:45,744 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2023-11-26 12:05:45,744 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 414 458) no Hoare annotation was computed. [2023-11-26 12:05:45,744 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2023-11-26 12:05:45,744 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2023-11-26 12:05:45,744 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2023-11-26 12:05:45,744 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 422 457) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 430 456) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2023-11-26 12:05:45,745 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 919 963) no Hoare annotation was computed. [2023-11-26 12:05:45,746 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse12 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (= ~s_memory0~0 50) .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_run_pc~0 3) (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~c_req_d~0 50)))) [2023-11-26 12:05:45,746 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 927 962) no Hoare annotation was computed. [2023-11-26 12:05:45,746 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 438 455) no Hoare annotation was computed. [2023-11-26 12:05:45,746 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2023-11-26 12:05:45,747 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2023-11-26 12:05:45,747 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2023-11-26 12:05:45,747 INFO L895 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: false [2023-11-26 12:05:45,747 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-11-26 12:05:45,747 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2023-11-26 12:05:45,747 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: false [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 580 615) no Hoare annotation was computed. [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 801) no Hoare annotation was computed. [2023-11-26 12:05:45,748 INFO L899 garLoopResultBuilder]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2023-11-26 12:05:45,749 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2023-11-26 12:05:45,749 INFO L899 garLoopResultBuilder]: For program point $Ultimate##550(lines 1041 1085) no Hoare annotation was computed. [2023-11-26 12:05:45,749 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 588 614) no Hoare annotation was computed. [2023-11-26 12:05:45,749 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 596 613) no Hoare annotation was computed. [2023-11-26 12:05:45,749 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2023-11-26 12:05:45,749 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1049 1084) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1057 1083) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 604 612) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point L667(lines 637 668) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2023-11-26 12:05:45,750 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2023-11-26 12:05:45,751 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 943 960) no Hoare annotation was computed. [2023-11-26 12:05:45,751 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2023-11-26 12:05:45,751 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 951 959) no Hoare annotation was computed. [2023-11-26 12:05:45,751 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2023-11-26 12:05:45,751 INFO L899 garLoopResultBuilder]: For program point L207(lines 177 208) no Hoare annotation was computed. [2023-11-26 12:05:45,751 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2023-11-26 12:05:45,752 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2023-11-26 12:05:45,752 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2023-11-26 12:05:45,752 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 973 981) no Hoare annotation was computed. [2023-11-26 12:05:45,752 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2023-11-26 12:05:45,752 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2023-11-26 12:05:45,752 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2023-11-26 12:05:45,753 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 0 ~a_t~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse8 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (= ~c_req_d~0 50))) (or (and (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse2 .cse3 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse2 .cse4 .cse5 .cse8 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse9 .cse10))) [2023-11-26 12:05:45,753 INFO L899 garLoopResultBuilder]: For program point L737(lines 737 741) no Hoare annotation was computed. [2023-11-26 12:05:45,753 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2023-11-26 12:05:45,753 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2023-11-26 12:05:45,753 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2023-11-26 12:05:45,754 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2023-11-26 12:05:45,754 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2023-11-26 12:05:45,754 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-11-26 12:05:45,754 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2023-11-26 12:05:45,754 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2023-11-26 12:05:45,755 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse8 (<= 0 ~a_t~0)) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_run_pc~0 0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 (= 2 ~s_run_pc~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse3 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse14 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-26 12:05:45,755 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: false [2023-11-26 12:05:45,755 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 74 82) no Hoare annotation was computed. [2023-11-26 12:05:45,755 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2023-11-26 12:05:45,755 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2023-11-26 12:05:45,755 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2023-11-26 12:05:45,756 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2023-11-26 12:05:45,756 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2023-11-26 12:05:45,756 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2023-11-26 12:05:45,756 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) the Hoare annotation is: (let ((.cse2 (= ~s_run_pc~0 0)) (.cse12 (= ~m_run_pc~0 6)) (.cse14 (= ~c_req_type~0 0)) (.cse0 (= ~c_req_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse7 (= ~m_run_pc~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse16 (= ~s_memory0~0 50)) (.cse15 (<= 0 ~a_t~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse10 (= ~m_run_st~0 0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse10 .cse11 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse10 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse5 .cse6 .cse13 (not .cse14)) (and .cse11 .cse4 .cse5 .cse6 .cse13) (and .cse14 .cse8 .cse0 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7) (and .cse14 .cse8 .cse0 .cse9 (= ~c_rsp_d~0 50) .cse1 (= ~req_tt_a~0 0) .cse10 .cse16 .cse11 .cse15 .cse4 .cse5 .cse12) (and .cse14 .cse8 .cse0 .cse1 .cse3 .cse10 .cse11 .cse15 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse10 .cse16 .cse11 .cse15 .cse4 .cse5 .cse13 (= ~c_req_d~0 50)) (and .cse8 .cse1 .cse10 .cse11 .cse5 .cse6 .cse13))) [2023-11-26 12:05:45,757 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2023-11-26 12:05:45,757 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2023-11-26 12:05:45,757 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2023-11-26 12:05:45,757 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) the Hoare annotation is: (let ((.cse4 (= ~s_memory0~0 50)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= ~c_req_d~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse10 (not (= ~s_run_st~0 0))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse4 (= 2 ~s_run_pc~0) (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse1 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 (= ~c_req_type~0 1) .cse10 (= ~s_run_pc~0 0) .cse5 .cse7 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 (not (= ~c_m_lock~0 1)) .cse5 .cse6 .cse7 .cse11 (= ~m_run_pc~0 0)))) [2023-11-26 12:05:45,757 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2023-11-26 12:05:45,758 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-11-26 12:05:45,758 INFO L899 garLoopResultBuilder]: For program point L481(lines 133 482) no Hoare annotation was computed. [2023-11-26 12:05:45,758 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-11-26 12:05:45,758 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2023-11-26 12:05:45,758 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2023-11-26 12:05:45,758 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1167 1350) no Hoare annotation was computed. [2023-11-26 12:05:45,759 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) the Hoare annotation is: (let ((.cse10 (= ~req_tt_a~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory0~0 50)) (.cse6 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (= ~c_req_a~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse15 (= ~c_req_type~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse12 (<= 0 ~a_t~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse14 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse1 .cse12 .cse3 .cse4 .cse13) (and .cse6 .cse7 .cse8 .cse9 (= ~c_rsp_d~0 50) .cse10 (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse11 .cse1 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse12 .cse2 .cse3 .cse13 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse7 .cse9 .cse11 .cse12 .cse2 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse3 .cse5 .cse14) (and .cse7 .cse8 .cse9 .cse15 .cse0 (= ~s_run_pc~0 0) .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse6 .cse7 .cse8 .cse0 (not (= ~c_m_lock~0 1)) .cse12 .cse2 .cse3 .cse4 (= ~m_run_pc~0 0)) (and .cse7 .cse8 .cse9 .cse15 .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse14))) [2023-11-26 12:05:45,759 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2023-11-26 12:05:45,759 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2023-11-26 12:05:45,759 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2023-11-26 12:05:45,760 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse11 (= ~c_req_type~0 1)) (.cse9 (= ~c_req_d~0 50)) (.cse15 (not (= ~c_m_lock~0 1))) (.cse16 (= ~m_run_pc~0 0)) (.cse17 (= ~req_tt_a~0 0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse18 (= ~m_run_pc~0 6)) (.cse10 (= ~c_req_a~0 0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse12 (= ~s_run_pc~0 0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse14 (= ~c_req_type~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse12 .cse5 .cse7 .cse13 .cse8 .cse9) (and .cse14 .cse0 .cse10 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse13 .cse16) (and .cse10 .cse2 .cse12 .cse15 .cse6 .cse7 .cse13 .cse16) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5 .cse7 .cse13 .cse8 .cse9) (and .cse14 .cse0 .cse10 .cse1 .cse17 .cse3 .cse4 .cse5 .cse7 .cse13 .cse18) (and .cse4 .cse6 .cse7 .cse13 .cse8) (and .cse14 .cse0 .cse10 .cse12 .cse15 .cse5 .cse6 .cse7 .cse13 .cse16) (and .cse14 .cse0 .cse10 .cse1 (= ~c_rsp_d~0 50) .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18) (and .cse0 .cse2 .cse4 .cse7 .cse13 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse13 .cse18) (and .cse10 .cse2 .cse12 .cse7 .cse13 .cse8 (not .cse14)))) [2023-11-26 12:05:45,760 INFO L895 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: false [2023-11-26 12:05:45,760 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2023-11-26 12:05:45,761 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 0 ~a_t~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (and .cse0 .cse1 .cse2 (= ~s_memory0~0 50) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-26 12:05:45,761 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 332 376) no Hoare annotation was computed. [2023-11-26 12:05:45,761 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2023-11-26 12:05:45,761 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse4 (= ~c_req_type~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ~a_t~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~m_run_pc~0 3)) (.cse9 (= ~c_req_d~0 50)) (.cse1 (= ~c_req_a~0 0)) (.cse11 (not (= ~s_run_st~0 0))) (.cse10 (= ~s_run_pc~0 0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse11 .cse5 .cse7 .cse8) (and .cse5 .cse12 .cse7 .cse8 .cse13) (and .cse0 .cse2 .cse3 .cse11 (= ~s_memory0~0 50) .cse5 .cse6 .cse12 .cse7 .cse13 .cse9) (and .cse1 .cse11 .cse10 .cse7 .cse8 (not (= ~c_req_type~0 0))))) [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 340 375) no Hoare annotation was computed. [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 348 374) no Hoare annotation was computed. [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-11-26 12:05:45,762 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1244 1252) no Hoare annotation was computed. [2023-11-26 12:05:45,763 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2023-11-26 12:05:45,763 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 356 373) no Hoare annotation was computed. [2023-11-26 12:05:45,763 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2023-11-26 12:05:45,763 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2023-11-26 12:05:45,763 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2023-11-26 12:05:45,763 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2023-11-26 12:05:45,764 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-26 12:05:45,764 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-11-26 12:05:45,764 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 956) no Hoare annotation was computed. [2023-11-26 12:05:45,764 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1222 1230) no Hoare annotation was computed. [2023-11-26 12:05:45,764 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1214 1231) no Hoare annotation was computed. [2023-11-26 12:05:45,764 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 238 264) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 706 723) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 714 722) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 246 263) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1206 1232) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point L557(lines 527 558) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 254 262) no Hoare annotation was computed. [2023-11-26 12:05:45,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1198 1233) no Hoare annotation was computed. [2023-11-26 12:05:45,766 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2023-11-26 12:05:45,766 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 736 744) no Hoare annotation was computed. [2023-11-26 12:05:45,766 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 12:05:45,766 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1190 1234) no Hoare annotation was computed. [2023-11-26 12:05:45,766 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 276 284) no Hoare annotation was computed. [2023-11-26 12:05:45,766 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1065 1082) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1113 1166) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 626 634) no Hoare annotation was computed. [2023-11-26 12:05:45,767 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1073 1081) no Hoare annotation was computed. [2023-11-26 12:05:45,768 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 631) no Hoare annotation was computed. [2023-11-26 12:05:45,768 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (not (= ~s_run_st~0 0)) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (not (= ~c_m_lock~0 1)) (= ~s_memory0~0 50) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)) [2023-11-26 12:05:45,768 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2023-11-26 12:05:45,768 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2023-11-26 12:05:45,768 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2023-11-26 12:05:45,769 INFO L899 garLoopResultBuilder]: For program point $Ultimate##586(lines 1095 1103) no Hoare annotation was computed. [2023-11-26 12:05:45,769 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2023-11-26 12:05:45,769 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2023-11-26 12:05:45,769 INFO L899 garLoopResultBuilder]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2023-11-26 12:05:45,769 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 682 726) no Hoare annotation was computed. [2023-11-26 12:05:45,769 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 222 266) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 690 725) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 230 265) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 698 724) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1000 1027) no Hoare annotation was computed. [2023-11-26 12:05:45,770 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-26 12:05:45,771 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-26 12:05:45,771 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-26 12:05:45,775 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:45,777 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:05:45,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:05:45 BoogieIcfgContainer [2023-11-26 12:05:45,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:05:45,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:05:45,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:05:45,849 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:05:45,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:05" (3/4) ... [2023-11-26 12:05:45,852 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 12:05:45,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-26 12:05:45,883 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-26 12:05:45,885 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-26 12:05:45,887 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 12:05:45,889 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 12:05:46,179 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:05:46,183 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 12:05:46,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:05:46,184 INFO L158 Benchmark]: Toolchain (without parser) took 42596.39ms. Allocated memory was 130.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 98.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,189 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory was 77.8MB in the beginning and 77.7MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:05:46,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.84ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 77.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.24ms. Allocated memory is still 130.0MB. Free memory was 77.1MB in the beginning and 73.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,190 INFO L158 Benchmark]: Boogie Preprocessor took 103.05ms. Allocated memory is still 130.0MB. Free memory was 73.7MB in the beginning and 69.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,190 INFO L158 Benchmark]: RCFGBuilder took 1290.41ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 69.1MB in the beginning and 107.2MB in the end (delta: -38.1MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,191 INFO L158 Benchmark]: TraceAbstraction took 40244.55ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 106.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-26 12:05:46,191 INFO L158 Benchmark]: Witness Printer took 334.85ms. Allocated memory is still 1.8GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,195 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.31ms. Allocated memory is still 130.0MB. Free memory was 77.8MB in the beginning and 77.7MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.84ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 77.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.24ms. Allocated memory is still 130.0MB. Free memory was 77.1MB in the beginning and 73.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.05ms. Allocated memory is still 130.0MB. Free memory was 73.7MB in the beginning and 69.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1290.41ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 69.1MB in the beginning and 107.2MB in the end (delta: -38.1MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40244.55ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 106.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 334.85ms. Allocated memory is still 1.8GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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 2 procedures, 247 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8608 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8608 mSDsluCounter, 25409 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16621 mSDsCounter, 443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3867 IncrementalHoareTripleChecker+Invalid, 4310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 443 mSolverCounterUnsat, 8788 mSDtfsCounter, 3867 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9583occurred in iteration=13, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 11459 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 108 PreInvPairs, 224 NumberOfFragments, 2042 HoareAnnotationTreeSize, 108 FomulaSimplifications, 270193 FormulaSimplificationTreeSizeReduction, 12.7s HoareSimplificationTime, 19 FomulaSimplificationsInter, 47718 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2552 NumberOfCodeBlocks, 2552 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2738 ConstructedInterpolants, 0 QuantifiedInterpolants, 7042 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2003 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 334/516 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: 485]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50))) || (((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && !((c_req_type == 0)))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: (((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (c_req_d == 50))) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) RESULT: Ultimate proved your program to be correct! [2023-11-26 12:05:46,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddadd538-b594-4c5f-8b97-ec42aedccbe6/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE