./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.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_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:38:25,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:38:26,030 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:38:26,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:38:26,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:38:26,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:38:26,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:38:26,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:38:26,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:38:26,065 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:38:26,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:38:26,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:38:26,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:38:26,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:38:26,068 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:38:26,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:38:26,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:38:26,069 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:38:26,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:38:26,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:38:26,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:38:26,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:38:26,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:38:26,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:38:26,073 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:38:26,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:38:26,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:38:26,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:38:26,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:38:26,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:38:26,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:38:26,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:38:26,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:38:26,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:38:26,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:38:26,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:38:26,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:38:26,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:38:26,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:38:26,078 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:38:26,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:38:26,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:38:26,078 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_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 [2023-11-29 05:38:26,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:38:26,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:38:26,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:38:26,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:38:26,315 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:38:26,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2023-11-29 05:38:29,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:38:29,288 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:38:29,288 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2023-11-29 05:38:29,305 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/data/9867b2861/c2d95301a4bc4f66a06317f66fedf8d0/FLAG0d743abdc [2023-11-29 05:38:29,319 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/data/9867b2861/c2d95301a4bc4f66a06317f66fedf8d0 [2023-11-29 05:38:29,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:38:29,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:38:29,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:38:29,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:38:29,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:38:29,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13832233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29, skipping insertion in model container [2023-11-29 05:38:29,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,386 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:38:29,514 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_33e8c99f-918a-427c-9d0a-5ea221c60551/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[646,659] [2023-11-29 05:38:29,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:38:29,625 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:38:29,634 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_33e8c99f-918a-427c-9d0a-5ea221c60551/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[646,659] [2023-11-29 05:38:29,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:38:29,711 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:38:29,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29 WrapperNode [2023-11-29 05:38:29,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:38:29,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:38:29,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:38:29,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:38:29,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,766 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 852 [2023-11-29 05:38:29,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:38:29,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:38:29,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:38:29,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:38:29,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:38:29,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:38:29,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:38:29,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:38:29,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:38:29,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (1/1) ... [2023-11-29 05:38:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:38:29,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:29,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:38:29,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:38:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:38:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:38:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-29 05:38:29,907 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-29 05:38:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:38:29,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:38:30,001 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:38:30,003 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:38:30,629 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:38:30,684 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:38:30,684 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-29 05:38:30,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:38:30 BoogieIcfgContainer [2023-11-29 05:38:30,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:38:30,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:38:30,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:38:30,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:38:30,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:38:29" (1/3) ... [2023-11-29 05:38:30,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de205c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:38:30, skipping insertion in model container [2023-11-29 05:38:30,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:38:29" (2/3) ... [2023-11-29 05:38:30,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de205c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:38:30, skipping insertion in model container [2023-11-29 05:38:30,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:38:30" (3/3) ... [2023-11-29 05:38:30,693 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2023-11-29 05:38:30,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:38:30,707 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:38:30,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:38:30,761 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;@446c9a5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:38:30,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:38:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 241 states have (on average 1.937759336099585) internal successors, (467), 247 states have internal predecessors, (467), 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-29 05:38:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:38:30,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:30,777 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-29 05:38:30,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:30,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1846885785, now seen corresponding path program 1 times [2023-11-29 05:38:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862091033] [2023-11-29 05:38:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862091033] [2023-11-29 05:38:31,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862091033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:31,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:31,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:38:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039451021] [2023-11-29 05:38:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:31,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:31,036 INFO L87 Difference]: Start difference. First operand has 249 states, 241 states have (on average 1.937759336099585) internal successors, (467), 247 states have internal predecessors, (467), 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-29 05:38:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:31,407 INFO L93 Difference]: Finished difference Result 656 states and 1255 transitions. [2023-11-29 05:38:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:31,409 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-29 05:38:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:31,422 INFO L225 Difference]: With dead ends: 656 [2023-11-29 05:38:31,423 INFO L226 Difference]: Without dead ends: 407 [2023-11-29 05:38:31,427 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-29 05:38:31,430 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 243 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 694 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.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:31,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 694 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:38:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-29 05:38:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 400. [2023-11-29 05:38:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 394 states have (on average 1.6370558375634519) internal successors, (645), 398 states have internal predecessors, (645), 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-29 05:38:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 650 transitions. [2023-11-29 05:38:31,497 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 650 transitions. Word has length 26 [2023-11-29 05:38:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:31,498 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 650 transitions. [2023-11-29 05:38:31,498 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-29 05:38:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 650 transitions. [2023-11-29 05:38:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:38:31,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:31,502 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-29 05:38:31,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:38:31,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:31,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 242253487, now seen corresponding path program 1 times [2023-11-29 05:38:31,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:31,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821194245] [2023-11-29 05:38:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821194245] [2023-11-29 05:38:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821194245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273597391] [2023-11-29 05:38:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:31,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:31,575 INFO L87 Difference]: Start difference. First operand 400 states and 650 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-29 05:38:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:31,756 INFO L93 Difference]: Finished difference Result 1048 states and 1728 transitions. [2023-11-29 05:38:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-29 05:38:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:31,762 INFO L225 Difference]: With dead ends: 1048 [2023-11-29 05:38:31,762 INFO L226 Difference]: Without dead ends: 661 [2023-11-29 05:38:31,764 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-29 05:38:31,765 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 308 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 924 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-29 05:38:31,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 924 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-29 05:38:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 654. [2023-11-29 05:38:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 648 states have (on average 1.6682098765432098) internal successors, (1081), 652 states have internal predecessors, (1081), 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-29 05:38:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1086 transitions. [2023-11-29 05:38:31,808 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1086 transitions. Word has length 36 [2023-11-29 05:38:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:31,808 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 1086 transitions. [2023-11-29 05:38:31,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-29 05:38:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1086 transitions. [2023-11-29 05:38:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 05:38:31,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:31,812 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] [2023-11-29 05:38:31,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:38:31,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:31,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1958989152, now seen corresponding path program 1 times [2023-11-29 05:38:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3747492] [2023-11-29 05:38:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:31,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3747492] [2023-11-29 05:38:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3747492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:31,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:38:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191221055] [2023-11-29 05:38:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:31,879 INFO L87 Difference]: Start difference. First operand 654 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-29 05:38:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:31,971 INFO L93 Difference]: Finished difference Result 1644 states and 2735 transitions. [2023-11-29 05:38:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 37 [2023-11-29 05:38:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:31,979 INFO L225 Difference]: With dead ends: 1644 [2023-11-29 05:38:31,979 INFO L226 Difference]: Without dead ends: 1014 [2023-11-29 05:38:31,980 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-29 05:38:31,982 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 332 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 734 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-29 05:38:31,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 734 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2023-11-29 05:38:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1003. [2023-11-29 05:38:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 997 states have (on average 1.6639919759277833) internal successors, (1659), 1001 states have internal predecessors, (1659), 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-29 05:38:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1664 transitions. [2023-11-29 05:38:32,027 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1664 transitions. Word has length 37 [2023-11-29 05:38:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:32,027 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1664 transitions. [2023-11-29 05:38:32,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-29 05:38:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1664 transitions. [2023-11-29 05:38:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 05:38:32,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:32,030 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-29 05:38:32,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:38:32,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:32,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1906881250, now seen corresponding path program 1 times [2023-11-29 05:38:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850132863] [2023-11-29 05:38:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:32,122 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-29 05:38:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850132863] [2023-11-29 05:38:32,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850132863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:32,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:32,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488024118] [2023-11-29 05:38:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:32,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:38:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:38:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:38:32,125 INFO L87 Difference]: Start difference. First operand 1003 states and 1664 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-29 05:38:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:32,687 INFO L93 Difference]: Finished difference Result 3542 states and 5892 transitions. [2023-11-29 05:38:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:38:32,688 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-29 05:38:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:32,703 INFO L225 Difference]: With dead ends: 3542 [2023-11-29 05:38:32,703 INFO L226 Difference]: Without dead ends: 2563 [2023-11-29 05:38:32,705 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-29 05:38:32,707 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 1097 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1435 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:32,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1435 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:38:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2023-11-29 05:38:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2077. [2023-11-29 05:38:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 2071 states have (on average 1.6605504587155964) internal successors, (3439), 2075 states have internal predecessors, (3439), 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-29 05:38:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3444 transitions. [2023-11-29 05:38:32,805 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3444 transitions. Word has length 43 [2023-11-29 05:38:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:32,805 INFO L495 AbstractCegarLoop]: Abstraction has 2077 states and 3444 transitions. [2023-11-29 05:38:32,805 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-29 05:38:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3444 transitions. [2023-11-29 05:38:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:38:32,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:32,807 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-29 05:38:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:38:32,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:32,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1797812072, now seen corresponding path program 1 times [2023-11-29 05:38:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:32,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202085828] [2023-11-29 05:38:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:32,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:32,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202085828] [2023-11-29 05:38:32,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202085828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:32,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:32,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:32,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300963344] [2023-11-29 05:38:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:38:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:38:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:38:32,882 INFO L87 Difference]: Start difference. First operand 2077 states and 3444 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-29 05:38:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:33,425 INFO L93 Difference]: Finished difference Result 6074 states and 9947 transitions. [2023-11-29 05:38:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:38:33,425 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-29 05:38:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:33,449 INFO L225 Difference]: With dead ends: 6074 [2023-11-29 05:38:33,449 INFO L226 Difference]: Without dead ends: 4015 [2023-11-29 05:38:33,452 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-29 05:38:33,454 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 700 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 931 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:33,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 931 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:38:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2023-11-29 05:38:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 3665. [2023-11-29 05:38:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 3659 states have (on average 1.624487564908445) internal successors, (5944), 3663 states have internal predecessors, (5944), 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-29 05:38:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5949 transitions. [2023-11-29 05:38:33,640 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5949 transitions. Word has length 50 [2023-11-29 05:38:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:33,640 INFO L495 AbstractCegarLoop]: Abstraction has 3665 states and 5949 transitions. [2023-11-29 05:38:33,641 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-29 05:38:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5949 transitions. [2023-11-29 05:38:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:38:33,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:33,642 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-29 05:38:33,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:38:33,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:33,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash 346972065, now seen corresponding path program 1 times [2023-11-29 05:38:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260657806] [2023-11-29 05:38:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:33,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260657806] [2023-11-29 05:38:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260657806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:33,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:38:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448077453] [2023-11-29 05:38:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:33,704 INFO L87 Difference]: Start difference. First operand 3665 states and 5949 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-29 05:38:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:33,940 INFO L93 Difference]: Finished difference Result 8702 states and 14082 transitions. [2023-11-29 05:38:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:33,941 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-29 05:38:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:33,969 INFO L225 Difference]: With dead ends: 8702 [2023-11-29 05:38:33,969 INFO L226 Difference]: Without dead ends: 5059 [2023-11-29 05:38:33,975 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-29 05:38:33,976 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 347 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 633 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:33,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 633 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:38:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2023-11-29 05:38:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4783. [2023-11-29 05:38:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4777 states have (on average 1.6043541971948923) internal successors, (7664), 4781 states have internal predecessors, (7664), 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-29 05:38:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 7669 transitions. [2023-11-29 05:38:34,261 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 7669 transitions. Word has length 50 [2023-11-29 05:38:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:34,262 INFO L495 AbstractCegarLoop]: Abstraction has 4783 states and 7669 transitions. [2023-11-29 05:38:34,262 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-29 05:38:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 7669 transitions. [2023-11-29 05:38:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 05:38:34,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:34,265 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] [2023-11-29 05:38:34,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:38:34,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:34,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash 524791694, now seen corresponding path program 1 times [2023-11-29 05:38:34,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:34,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891794419] [2023-11-29 05:38:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:34,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:34,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:34,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891794419] [2023-11-29 05:38:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891794419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:34,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:34,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:34,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590160145] [2023-11-29 05:38:34,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:34,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:34,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:34,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:34,334 INFO L87 Difference]: Start difference. First operand 4783 states and 7669 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-29 05:38:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:34,796 INFO L93 Difference]: Finished difference Result 11559 states and 18617 transitions. [2023-11-29 05:38:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 55 [2023-11-29 05:38:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:34,834 INFO L225 Difference]: With dead ends: 11559 [2023-11-29 05:38:34,834 INFO L226 Difference]: Without dead ends: 6798 [2023-11-29 05:38:34,840 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-29 05:38:34,841 INFO L413 NwaCegarLoop]: 522 mSDtfsCounter, 233 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 783 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.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:34,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 783 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:38:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2023-11-29 05:38:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 5531. [2023-11-29 05:38:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5525 states have (on average 1.5491402714932128) internal successors, (8559), 5529 states have internal predecessors, (8559), 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-29 05:38:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8564 transitions. [2023-11-29 05:38:35,075 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 8564 transitions. Word has length 55 [2023-11-29 05:38:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:35,076 INFO L495 AbstractCegarLoop]: Abstraction has 5531 states and 8564 transitions. [2023-11-29 05:38:35,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-29 05:38:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 8564 transitions. [2023-11-29 05:38:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:38:35,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:35,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:38:35,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:38:35,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:35,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1311066694, now seen corresponding path program 1 times [2023-11-29 05:38:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977837630] [2023-11-29 05:38:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:35,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977837630] [2023-11-29 05:38:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977837630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:35,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:38:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707115331] [2023-11-29 05:38:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:35,147 INFO L87 Difference]: Start difference. First operand 5531 states and 8564 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 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-29 05:38:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:35,370 INFO L93 Difference]: Finished difference Result 10906 states and 16906 transitions. [2023-11-29 05:38:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 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-29 05:38:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:35,400 INFO L225 Difference]: With dead ends: 10906 [2023-11-29 05:38:35,400 INFO L226 Difference]: Without dead ends: 5397 [2023-11-29 05:38:35,408 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-29 05:38:35,409 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 324 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 397 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-29 05:38:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 397 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2023-11-29 05:38:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 5397. [2023-11-29 05:38:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5397 states, 5391 states have (on average 1.5288443702467074) internal successors, (8242), 5395 states have internal predecessors, (8242), 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-29 05:38:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 8247 transitions. [2023-11-29 05:38:35,635 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 8247 transitions. Word has length 57 [2023-11-29 05:38:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:35,636 INFO L495 AbstractCegarLoop]: Abstraction has 5397 states and 8247 transitions. [2023-11-29 05:38:35,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 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-29 05:38:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 8247 transitions. [2023-11-29 05:38:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:38:35,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:35,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:38:35,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:38:35,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:35,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1296691314, now seen corresponding path program 1 times [2023-11-29 05:38:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474995071] [2023-11-29 05:38:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:35,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:35,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474995071] [2023-11-29 05:38:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474995071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:35,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:35,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974403111] [2023-11-29 05:38:35,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:35,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:35,693 INFO L87 Difference]: Start difference. First operand 5397 states and 8247 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-29 05:38:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:35,886 INFO L93 Difference]: Finished difference Result 10419 states and 16042 transitions. [2023-11-29 05:38:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:35,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 58 [2023-11-29 05:38:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:35,901 INFO L225 Difference]: With dead ends: 10419 [2023-11-29 05:38:35,901 INFO L226 Difference]: Without dead ends: 5044 [2023-11-29 05:38:35,908 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-29 05:38:35,908 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 150 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 824 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:35,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 824 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:38:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2023-11-29 05:38:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4377. [2023-11-29 05:38:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4377 states, 4371 states have (on average 1.5536490505605125) internal successors, (6791), 4375 states have internal predecessors, (6791), 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-29 05:38:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6796 transitions. [2023-11-29 05:38:36,096 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6796 transitions. Word has length 58 [2023-11-29 05:38:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:36,096 INFO L495 AbstractCegarLoop]: Abstraction has 4377 states and 6796 transitions. [2023-11-29 05:38:36,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-29 05:38:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6796 transitions. [2023-11-29 05:38:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 05:38:36,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:36,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:38:36,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:38:36,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:36,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1299520037, now seen corresponding path program 1 times [2023-11-29 05:38:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265509040] [2023-11-29 05:38:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265509040] [2023-11-29 05:38:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265509040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:38:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064143533] [2023-11-29 05:38:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:36,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:38:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:38:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:36,187 INFO L87 Difference]: Start difference. First operand 4377 states and 6796 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-29 05:38:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:36,835 INFO L93 Difference]: Finished difference Result 12782 states and 19835 transitions. [2023-11-29 05:38:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:38:36,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-29 05:38:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:36,857 INFO L225 Difference]: With dead ends: 12782 [2023-11-29 05:38:36,857 INFO L226 Difference]: Without dead ends: 8607 [2023-11-29 05:38:36,865 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-29 05:38:36,865 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 908 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2171 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-29 05:38:36,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2171 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:38:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2023-11-29 05:38:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 5921. [2023-11-29 05:38:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5921 states, 5915 states have (on average 1.555874894336433) internal successors, (9203), 5919 states have internal predecessors, (9203), 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-29 05:38:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 9208 transitions. [2023-11-29 05:38:37,122 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 9208 transitions. Word has length 60 [2023-11-29 05:38:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:37,122 INFO L495 AbstractCegarLoop]: Abstraction has 5921 states and 9208 transitions. [2023-11-29 05:38:37,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-29 05:38:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 9208 transitions. [2023-11-29 05:38:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:38:37,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:37,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:38:37,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:38:37,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:37,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1129675064, now seen corresponding path program 1 times [2023-11-29 05:38:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553135572] [2023-11-29 05:38:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:38:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:37,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553135572] [2023-11-29 05:38:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553135572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:37,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:37,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:38:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105334710] [2023-11-29 05:38:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:38:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:37,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:38:37,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:38:37,216 INFO L87 Difference]: Start difference. First operand 5921 states and 9208 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-29 05:38:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:37,697 INFO L93 Difference]: Finished difference Result 14290 states and 22055 transitions. [2023-11-29 05:38:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:38:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 61 [2023-11-29 05:38:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:37,717 INFO L225 Difference]: With dead ends: 14290 [2023-11-29 05:38:37,717 INFO L226 Difference]: Without dead ends: 8571 [2023-11-29 05:38:37,724 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-29 05:38:37,725 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 812 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:37,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2704 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2023-11-29 05:38:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 6261. [2023-11-29 05:38:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6261 states, 6255 states have (on average 1.5448441247002398) internal successors, (9663), 6259 states have internal predecessors, (9663), 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-29 05:38:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6261 states to 6261 states and 9668 transitions. [2023-11-29 05:38:38,064 INFO L78 Accepts]: Start accepts. Automaton has 6261 states and 9668 transitions. Word has length 61 [2023-11-29 05:38:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:38,065 INFO L495 AbstractCegarLoop]: Abstraction has 6261 states and 9668 transitions. [2023-11-29 05:38:38,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-29 05:38:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6261 states and 9668 transitions. [2023-11-29 05:38:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 05:38:38,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:38,068 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-29 05:38:38,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:38:38,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:38,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 60038850, now seen corresponding path program 1 times [2023-11-29 05:38:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118790863] [2023-11-29 05:38:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:38,110 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-29 05:38:38,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:38,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118790863] [2023-11-29 05:38:38,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118790863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:38,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:38,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:38:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507615462] [2023-11-29 05:38:38,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:38,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:38,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:38,112 INFO L87 Difference]: Start difference. First operand 6261 states and 9668 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-29 05:38:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:38,423 INFO L93 Difference]: Finished difference Result 13273 states and 20446 transitions. [2023-11-29 05:38:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:38,423 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-29 05:38:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:38,437 INFO L225 Difference]: With dead ends: 13273 [2023-11-29 05:38:38,437 INFO L226 Difference]: Without dead ends: 7032 [2023-11-29 05:38:38,444 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-29 05:38:38,445 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 126 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 732 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-29 05:38:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 732 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2023-11-29 05:38:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 6946. [2023-11-29 05:38:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6946 states, 6940 states have (on average 1.5377521613832854) internal successors, (10672), 6944 states have internal predecessors, (10672), 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-29 05:38:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6946 states to 6946 states and 10677 transitions. [2023-11-29 05:38:38,684 INFO L78 Accepts]: Start accepts. Automaton has 6946 states and 10677 transitions. Word has length 74 [2023-11-29 05:38:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:38,684 INFO L495 AbstractCegarLoop]: Abstraction has 6946 states and 10677 transitions. [2023-11-29 05:38:38,684 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-29 05:38:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6946 states and 10677 transitions. [2023-11-29 05:38:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 05:38:38,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:38,687 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-29 05:38:38,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:38:38,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:38,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash -891791990, now seen corresponding path program 1 times [2023-11-29 05:38:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305202388] [2023-11-29 05:38:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:38,749 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-29 05:38:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305202388] [2023-11-29 05:38:38,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305202388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:38,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:38,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:38:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268689378] [2023-11-29 05:38:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:38,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:38:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:38,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:38:38,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:38:38,751 INFO L87 Difference]: Start difference. First operand 6946 states and 10677 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-29 05:38:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:39,347 INFO L93 Difference]: Finished difference Result 18015 states and 27410 transitions. [2023-11-29 05:38:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:38:39,348 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-29 05:38:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:39,363 INFO L225 Difference]: With dead ends: 18015 [2023-11-29 05:38:39,363 INFO L226 Difference]: Without dead ends: 10956 [2023-11-29 05:38:39,371 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-29 05:38:39,372 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 604 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1119 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-29 05:38:39,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1119 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:38:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2023-11-29 05:38:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 9663. [2023-11-29 05:38:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9663 states, 9657 states have (on average 1.5003624313969142) internal successors, (14489), 9661 states have internal predecessors, (14489), 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-29 05:38:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 14494 transitions. [2023-11-29 05:38:39,663 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 14494 transitions. Word has length 85 [2023-11-29 05:38:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:39,663 INFO L495 AbstractCegarLoop]: Abstraction has 9663 states and 14494 transitions. [2023-11-29 05:38:39,664 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-29 05:38:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 14494 transitions. [2023-11-29 05:38:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 05:38:39,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:39,666 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-29 05:38:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:38:39,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:39,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1043685481, now seen corresponding path program 1 times [2023-11-29 05:38:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:39,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685532707] [2023-11-29 05:38:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:39,710 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-29 05:38:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:39,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685532707] [2023-11-29 05:38:39,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685532707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:39,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:39,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753054854] [2023-11-29 05:38:39,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:39,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:39,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:39,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:39,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:39,712 INFO L87 Difference]: Start difference. First operand 9663 states and 14494 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-29 05:38:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:39,974 INFO L93 Difference]: Finished difference Result 13764 states and 20698 transitions. [2023-11-29 05:38:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:39,975 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-29 05:38:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:39,984 INFO L225 Difference]: With dead ends: 13764 [2023-11-29 05:38:39,984 INFO L226 Difference]: Without dead ends: 4111 [2023-11-29 05:38:39,991 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-29 05:38:39,992 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 319 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 461 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-29 05:38:39,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 461 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2023-11-29 05:38:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4053. [2023-11-29 05:38:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 4047 states have (on average 1.4000494193229553) internal successors, (5666), 4051 states have internal predecessors, (5666), 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-29 05:38:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5671 transitions. [2023-11-29 05:38:40,154 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5671 transitions. Word has length 91 [2023-11-29 05:38:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:40,155 INFO L495 AbstractCegarLoop]: Abstraction has 4053 states and 5671 transitions. [2023-11-29 05:38:40,155 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-29 05:38:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5671 transitions. [2023-11-29 05:38:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 05:38:40,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:40,157 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-29 05:38:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:38:40,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:40,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -907817551, now seen corresponding path program 1 times [2023-11-29 05:38:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449409984] [2023-11-29 05:38:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:40,223 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-29 05:38:40,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:40,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449409984] [2023-11-29 05:38:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449409984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:40,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:38:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100255818] [2023-11-29 05:38:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:40,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:38:40,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:40,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:38:40,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:38:40,225 INFO L87 Difference]: Start difference. First operand 4053 states and 5671 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-29 05:38:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:40,595 INFO L93 Difference]: Finished difference Result 9560 states and 13356 transitions. [2023-11-29 05:38:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:38:40,595 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-29 05:38:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:40,604 INFO L225 Difference]: With dead ends: 9560 [2023-11-29 05:38:40,605 INFO L226 Difference]: Without dead ends: 5671 [2023-11-29 05:38:40,609 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-29 05:38:40,609 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 521 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2121 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-29 05:38:40,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2121 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2023-11-29 05:38:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 4055. [2023-11-29 05:38:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 4049 states have (on average 1.3968881205235861) internal successors, (5656), 4053 states have internal predecessors, (5656), 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-29 05:38:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5661 transitions. [2023-11-29 05:38:40,764 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5661 transitions. Word has length 95 [2023-11-29 05:38:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:40,765 INFO L495 AbstractCegarLoop]: Abstraction has 4055 states and 5661 transitions. [2023-11-29 05:38:40,765 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-29 05:38:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5661 transitions. [2023-11-29 05:38:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-29 05:38:40,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:40,766 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-29 05:38:40,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:38:40,767 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:40,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -886618612, now seen corresponding path program 1 times [2023-11-29 05:38:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175344048] [2023-11-29 05:38:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:40,829 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-29 05:38:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175344048] [2023-11-29 05:38:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175344048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608753861] [2023-11-29 05:38:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:40,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:40,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:40,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:38:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:40,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:38:40,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:41,053 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-29 05:38:41,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:38:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608753861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-29 05:38:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273610081] [2023-11-29 05:38:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:41,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:41,055 INFO L87 Difference]: Start difference. First operand 4055 states and 5661 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-29 05:38:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:41,325 INFO L93 Difference]: Finished difference Result 5190 states and 7234 transitions. [2023-11-29 05:38:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:41,326 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-29 05:38:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:41,336 INFO L225 Difference]: With dead ends: 5190 [2023-11-29 05:38:41,337 INFO L226 Difference]: Without dead ends: 5186 [2023-11-29 05:38:41,339 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-29 05:38:41,339 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 215 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 719 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-29 05:38:41,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 719 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2023-11-29 05:38:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5048. [2023-11-29 05:38:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5048 states, 5042 states have (on average 1.400833002776676) internal successors, (7063), 5046 states have internal predecessors, (7063), 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-29 05:38:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 7068 transitions. [2023-11-29 05:38:41,552 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 7068 transitions. Word has length 97 [2023-11-29 05:38:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:41,553 INFO L495 AbstractCegarLoop]: Abstraction has 5048 states and 7068 transitions. [2023-11-29 05:38:41,553 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-29 05:38:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 7068 transitions. [2023-11-29 05:38:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 05:38:41,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:41,556 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, 1] [2023-11-29 05:38:41,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:38:41,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:41,757 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:41,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1357555119, now seen corresponding path program 1 times [2023-11-29 05:38:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91380461] [2023-11-29 05:38:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:41,859 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-29 05:38:41,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91380461] [2023-11-29 05:38:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91380461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587132210] [2023-11-29 05:38:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:41,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:41,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:38:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:41,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:38:41,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:42,079 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-29 05:38:42,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:38:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587132210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:42,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:42,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-29 05:38:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880396899] [2023-11-29 05:38:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:42,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:42,082 INFO L87 Difference]: Start difference. First operand 5048 states and 7068 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-29 05:38:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:42,238 INFO L93 Difference]: Finished difference Result 8964 states and 12614 transitions. [2023-11-29 05:38:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 148 [2023-11-29 05:38:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:42,246 INFO L225 Difference]: With dead ends: 8964 [2023-11-29 05:38:42,246 INFO L226 Difference]: Without dead ends: 3927 [2023-11-29 05:38:42,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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-29 05:38:42,250 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 245 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 380 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-29 05:38:42,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 380 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:38:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2023-11-29 05:38:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3592. [2023-11-29 05:38:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3586 states have (on average 1.377579475738985) internal successors, (4940), 3590 states have internal predecessors, (4940), 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-29 05:38:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4945 transitions. [2023-11-29 05:38:42,398 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4945 transitions. Word has length 148 [2023-11-29 05:38:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:42,399 INFO L495 AbstractCegarLoop]: Abstraction has 3592 states and 4945 transitions. [2023-11-29 05:38:42,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-29 05:38:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4945 transitions. [2023-11-29 05:38:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:38:42,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:42,401 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, 1] [2023-11-29 05:38:42,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:38:42,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:42,602 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:42,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2041407437, now seen corresponding path program 1 times [2023-11-29 05:38:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228768434] [2023-11-29 05:38:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:38:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228768434] [2023-11-29 05:38:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228768434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911435731] [2023-11-29 05:38:42,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:42,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:42,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:38:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:42,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:38:42,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:38:42,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:38:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911435731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 05:38:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654442882] [2023-11-29 05:38:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:42,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:42,911 INFO L87 Difference]: Start difference. First operand 3592 states and 4945 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-29 05:38:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:43,071 INFO L93 Difference]: Finished difference Result 7021 states and 9712 transitions. [2023-11-29 05:38:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:43,071 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 151 [2023-11-29 05:38:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:43,075 INFO L225 Difference]: With dead ends: 7021 [2023-11-29 05:38:43,075 INFO L226 Difference]: Without dead ends: 3592 [2023-11-29 05:38:43,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:43,078 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 255 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:43,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 352 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2023-11-29 05:38:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3592. [2023-11-29 05:38:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3586 states have (on average 1.3385387618516453) internal successors, (4800), 3590 states have internal predecessors, (4800), 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-29 05:38:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4805 transitions. [2023-11-29 05:38:43,186 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4805 transitions. Word has length 151 [2023-11-29 05:38:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:43,187 INFO L495 AbstractCegarLoop]: Abstraction has 3592 states and 4805 transitions. [2023-11-29 05:38:43,187 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-29 05:38:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4805 transitions. [2023-11-29 05:38:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:38:43,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:43,189 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:38:43,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:38:43,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:43,396 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:43,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -293733516, now seen corresponding path program 1 times [2023-11-29 05:38:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769267347] [2023-11-29 05:38:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:38:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769267347] [2023-11-29 05:38:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769267347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819354460] [2023-11-29 05:38:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:43,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:43,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:43,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:38:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:43,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:38:43,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:38:43,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:38:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819354460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:43,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 05:38:43,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438397290] [2023-11-29 05:38:43,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:43,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:43,670 INFO L87 Difference]: Start difference. First operand 3592 states and 4805 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-29 05:38:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:44,082 INFO L93 Difference]: Finished difference Result 8294 states and 11265 transitions. [2023-11-29 05:38:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:44,082 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 152 [2023-11-29 05:38:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:44,086 INFO L225 Difference]: With dead ends: 8294 [2023-11-29 05:38:44,086 INFO L226 Difference]: Without dead ends: 4865 [2023-11-29 05:38:44,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:38:44,089 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 190 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:44,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 578 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:38:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2023-11-29 05:38:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4541. [2023-11-29 05:38:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4541 states, 4535 states have (on average 1.3016538037486218) internal successors, (5903), 4539 states have internal predecessors, (5903), 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-29 05:38:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 5908 transitions. [2023-11-29 05:38:44,215 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 5908 transitions. Word has length 152 [2023-11-29 05:38:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:44,215 INFO L495 AbstractCegarLoop]: Abstraction has 4541 states and 5908 transitions. [2023-11-29 05:38:44,216 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-29 05:38:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 5908 transitions. [2023-11-29 05:38:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 05:38:44,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:44,217 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, 1] [2023-11-29 05:38:44,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 05:38:44,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:44,418 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:44,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash -132077224, now seen corresponding path program 1 times [2023-11-29 05:38:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:44,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464915481] [2023-11-29 05:38:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:38:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464915481] [2023-11-29 05:38:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464915481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152285824] [2023-11-29 05:38:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:44,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:44,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:44,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:38:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:44,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:38:44,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:38:44,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:38:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152285824] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:38:45,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:38:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2023-11-29 05:38:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079116959] [2023-11-29 05:38:45,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:38:45,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:38:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:45,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:38:45,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:38:45,122 INFO L87 Difference]: Start difference. First operand 4541 states and 5908 transitions. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 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-29 05:38:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:45,755 INFO L93 Difference]: Finished difference Result 12750 states and 16603 transitions. [2023-11-29 05:38:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:38:45,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 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 154 [2023-11-29 05:38:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:45,764 INFO L225 Difference]: With dead ends: 12750 [2023-11-29 05:38:45,764 INFO L226 Difference]: Without dead ends: 8372 [2023-11-29 05:38:45,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:38:45,768 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 892 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:45,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 4027 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:38:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2023-11-29 05:38:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 7057. [2023-11-29 05:38:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7057 states, 7051 states have (on average 1.3149907814494397) internal successors, (9272), 7055 states have internal predecessors, (9272), 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-29 05:38:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 9277 transitions. [2023-11-29 05:38:46,112 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 9277 transitions. Word has length 154 [2023-11-29 05:38:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:46,113 INFO L495 AbstractCegarLoop]: Abstraction has 7057 states and 9277 transitions. [2023-11-29 05:38:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 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-29 05:38:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 9277 transitions. [2023-11-29 05:38:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-11-29 05:38:46,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:46,116 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:38:46,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:38:46,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:46,316 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:46,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 308126803, now seen corresponding path program 1 times [2023-11-29 05:38:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962093441] [2023-11-29 05:38:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 98 proven. 99 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:38:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962093441] [2023-11-29 05:38:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962093441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567857715] [2023-11-29 05:38:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:46,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:46,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:38:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:46,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:38:46,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:38:47,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:38:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567857715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:47,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-11-29 05:38:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913299977] [2023-11-29 05:38:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:47,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:38:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:38:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:38:47,007 INFO L87 Difference]: Start difference. First operand 7057 states and 9277 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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-29 05:38:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:47,424 INFO L93 Difference]: Finished difference Result 14750 states and 19332 transitions. [2023-11-29 05:38:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:38:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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 249 [2023-11-29 05:38:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:47,430 INFO L225 Difference]: With dead ends: 14750 [2023-11-29 05:38:47,430 INFO L226 Difference]: Without dead ends: 7853 [2023-11-29 05:38:47,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:38:47,434 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 968 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:47,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2091 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2023-11-29 05:38:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 6941. [2023-11-29 05:38:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6941 states, 6935 states have (on average 1.313914924297044) internal successors, (9112), 6939 states have internal predecessors, (9112), 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-29 05:38:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 9117 transitions. [2023-11-29 05:38:47,647 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 9117 transitions. Word has length 249 [2023-11-29 05:38:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:47,648 INFO L495 AbstractCegarLoop]: Abstraction has 6941 states and 9117 transitions. [2023-11-29 05:38:47,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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-29 05:38:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 9117 transitions. [2023-11-29 05:38:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2023-11-29 05:38:47,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:47,650 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:38:47,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 05:38:47,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:47,850 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:47,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1590507305, now seen corresponding path program 1 times [2023-11-29 05:38:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:47,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912635866] [2023-11-29 05:38:47,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 05:38:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912635866] [2023-11-29 05:38:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912635866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:47,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:38:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146880254] [2023-11-29 05:38:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:47,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:38:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:38:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:38:47,911 INFO L87 Difference]: Start difference. First operand 6941 states and 9117 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-29 05:38:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:48,075 INFO L93 Difference]: Finished difference Result 7759 states and 10041 transitions. [2023-11-29 05:38:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:38:48,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 250 [2023-11-29 05:38:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:48,078 INFO L225 Difference]: With dead ends: 7759 [2023-11-29 05:38:48,078 INFO L226 Difference]: Without dead ends: 874 [2023-11-29 05:38:48,082 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-29 05:38:48,082 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 124 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:48,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 344 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2023-11-29 05:38:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2023-11-29 05:38:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 868 states have (on average 1.087557603686636) internal successors, (944), 870 states have internal predecessors, (944), 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-29 05:38:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 947 transitions. [2023-11-29 05:38:48,114 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 947 transitions. Word has length 250 [2023-11-29 05:38:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:48,115 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 947 transitions. [2023-11-29 05:38:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-29 05:38:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 947 transitions. [2023-11-29 05:38:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-11-29 05:38:48,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:48,117 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:38:48,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:38:48,117 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:48,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash -985731691, now seen corresponding path program 1 times [2023-11-29 05:38:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185503212] [2023-11-29 05:38:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 05:38:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185503212] [2023-11-29 05:38:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185503212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:48,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:38:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830223942] [2023-11-29 05:38:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:38:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:38:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:38:48,260 INFO L87 Difference]: Start difference. First operand 872 states and 947 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-29 05:38:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:48,415 INFO L93 Difference]: Finished difference Result 1169 states and 1268 transitions. [2023-11-29 05:38:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:38:48,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 251 [2023-11-29 05:38:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:48,417 INFO L225 Difference]: With dead ends: 1169 [2023-11-29 05:38:48,417 INFO L226 Difference]: Without dead ends: 885 [2023-11-29 05:38:48,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:38:48,418 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 215 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:48,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1344 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2023-11-29 05:38:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 870. [2023-11-29 05:38:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 866 states have (on average 1.0831408775981524) internal successors, (938), 868 states have internal predecessors, (938), 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-29 05:38:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 941 transitions. [2023-11-29 05:38:48,450 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 941 transitions. Word has length 251 [2023-11-29 05:38:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:48,450 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 941 transitions. [2023-11-29 05:38:48,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-29 05:38:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 941 transitions. [2023-11-29 05:38:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-11-29 05:38:48,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:48,452 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:38:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:38:48,453 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:48,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 7829070, now seen corresponding path program 1 times [2023-11-29 05:38:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:48,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559152972] [2023-11-29 05:38:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 05:38:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559152972] [2023-11-29 05:38:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559152972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:38:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:38:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:38:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217304095] [2023-11-29 05:38:48,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:48,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:38:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:38:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:38:48,547 INFO L87 Difference]: Start difference. First operand 870 states and 941 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-29 05:38:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:48,647 INFO L93 Difference]: Finished difference Result 1147 states and 1237 transitions. [2023-11-29 05:38:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:38:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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 252 [2023-11-29 05:38:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:48,649 INFO L225 Difference]: With dead ends: 1147 [2023-11-29 05:38:48,649 INFO L226 Difference]: Without dead ends: 859 [2023-11-29 05:38:48,650 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-29 05:38:48,650 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 170 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:48,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 768 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:38:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-11-29 05:38:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 853. [2023-11-29 05:38:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 850 states have (on average 1.0658823529411765) internal successors, (906), 851 states have internal predecessors, (906), 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-29 05:38:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 908 transitions. [2023-11-29 05:38:48,684 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 908 transitions. Word has length 252 [2023-11-29 05:38:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:48,684 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 908 transitions. [2023-11-29 05:38:48,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-29 05:38:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 908 transitions. [2023-11-29 05:38:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-11-29 05:38:48,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:48,687 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:38:48,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:38:48,687 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:48,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1534330045, now seen corresponding path program 1 times [2023-11-29 05:38:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050716339] [2023-11-29 05:38:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 37 proven. 137 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 05:38:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050716339] [2023-11-29 05:38:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050716339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637116304] [2023-11-29 05:38:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:49,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:49,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:49,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:38:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:49,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 05:38:49,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 05:38:50,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 15 proven. 143 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 05:38:50,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637116304] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:38:50,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:38:50,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 28 [2023-11-29 05:38:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210629911] [2023-11-29 05:38:50,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:38:50,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 05:38:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 05:38:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2023-11-29 05:38:50,619 INFO L87 Difference]: Start difference. First operand 853 states and 908 transitions. Second operand has 28 states, 28 states have (on average 13.928571428571429) internal successors, (390), 28 states have internal predecessors, (390), 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-29 05:38:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:51,191 INFO L93 Difference]: Finished difference Result 867 states and 921 transitions. [2023-11-29 05:38:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:38:51,192 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.928571428571429) internal successors, (390), 28 states have internal predecessors, (390), 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 308 [2023-11-29 05:38:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:51,193 INFO L225 Difference]: With dead ends: 867 [2023-11-29 05:38:51,193 INFO L226 Difference]: Without dead ends: 864 [2023-11-29 05:38:51,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1603, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 05:38:51,195 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 722 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 6000 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:51,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 6000 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:38:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-11-29 05:38:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 853. [2023-11-29 05:38:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 850 states have (on average 1.0647058823529412) internal successors, (905), 851 states have internal predecessors, (905), 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-29 05:38:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 907 transitions. [2023-11-29 05:38:51,242 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 907 transitions. Word has length 308 [2023-11-29 05:38:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:51,243 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 907 transitions. [2023-11-29 05:38:51,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.928571428571429) internal successors, (390), 28 states have internal predecessors, (390), 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-29 05:38:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 907 transitions. [2023-11-29 05:38:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2023-11-29 05:38:51,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:51,245 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 05:38:51,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:38:51,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:51,446 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:51,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1966940543, now seen corresponding path program 1 times [2023-11-29 05:38:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207929156] [2023-11-29 05:38:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 05:38:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207929156] [2023-11-29 05:38:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207929156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589565989] [2023-11-29 05:38:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:51,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:51,911 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:51,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:38:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:52,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:38:52,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 05:38:52,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 05:38:52,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589565989] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:38:52,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:38:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2023-11-29 05:38:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690905630] [2023-11-29 05:38:52,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:38:52,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:38:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:52,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:38:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:38:52,468 INFO L87 Difference]: Start difference. First operand 853 states and 907 transitions. Second operand has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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-29 05:38:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:52,704 INFO L93 Difference]: Finished difference Result 958 states and 1015 transitions. [2023-11-29 05:38:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:38:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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 352 [2023-11-29 05:38:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:52,706 INFO L225 Difference]: With dead ends: 958 [2023-11-29 05:38:52,707 INFO L226 Difference]: Without dead ends: 860 [2023-11-29 05:38:52,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:38:52,708 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:52,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 2173 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:38:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-29 05:38:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 852. [2023-11-29 05:38:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 850 states have (on average 1.06) internal successors, (901), 850 states have internal predecessors, (901), 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-29 05:38:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 902 transitions. [2023-11-29 05:38:52,762 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 902 transitions. Word has length 352 [2023-11-29 05:38:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:52,762 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 902 transitions. [2023-11-29 05:38:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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-29 05:38:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 902 transitions. [2023-11-29 05:38:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2023-11-29 05:38:52,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:52,766 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:38:52,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 05:38:52,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:52,967 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:52,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash -711226123, now seen corresponding path program 1 times [2023-11-29 05:38:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:38:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342420394] [2023-11-29 05:38:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:38:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 72 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:38:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:38:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342420394] [2023-11-29 05:38:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342420394] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508621551] [2023-11-29 05:38:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:38:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:38:54,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:38:54,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:38:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:54,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 05:38:54,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 89 proven. 325 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:38:55,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 20 proven. 394 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:38:55,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508621551] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:38:55,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:38:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 33 [2023-11-29 05:38:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998941017] [2023-11-29 05:38:55,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:38:55,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:38:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:38:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:38:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 05:38:55,745 INFO L87 Difference]: Start difference. First operand 852 states and 902 transitions. Second operand has 33 states, 33 states have (on average 18.96969696969697) internal successors, (626), 33 states have internal predecessors, (626), 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-29 05:38:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:56,644 INFO L93 Difference]: Finished difference Result 860 states and 910 transitions. [2023-11-29 05:38:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 05:38:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 18.96969696969697) internal successors, (626), 33 states have internal predecessors, (626), 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 410 [2023-11-29 05:38:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:56,645 INFO L225 Difference]: With dead ends: 860 [2023-11-29 05:38:56,645 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:38:56,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 05:38:56,647 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 833 mSDsluCounter, 10472 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 10956 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:56,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 10956 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:38:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:38:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:38:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:38:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:38:56,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 410 [2023-11-29 05:38:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:56,648 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:38:56,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 18.96969696969697) internal successors, (626), 33 states have internal predecessors, (626), 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-29 05:38:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:38:56,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:38:56,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:38:56,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:38:56,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 05:38:56,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:39:02,541 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 214 DAG size of output: 235 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:39:10,954 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 260 DAG size of output: 377 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:39:58,005 WARN L293 SmtUtils]: Spent 46.07s on a formula simplification. DAG size of input: 199 DAG size of output: 287 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:40:04,012 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 210 DAG size of output: 297 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 769 813) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point L696(lines 696 700) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 777 812) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 785 811) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point L631(lines 623 640) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 793 810) no Hoare annotation was computed. [2023-11-29 05:40:12,978 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L895 garLoopResultBuilder]: At program point L500-2(lines 500 528) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 856 1117) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point L1227(lines 1175 1354) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 801 809) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point L501(lines 500 528) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point L369(lines 139 485) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1232) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 369 377) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 823 831) no Hoare annotation was computed. [2023-11-29 05:40:12,979 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1276 1320) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L1031(lines 1005 1032) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1284 1319) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1292 1318) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 622) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 135) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 840) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L834-1(lines 834 840) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1300 1317) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 90 849) no Hoare annotation was computed. [2023-11-29 05:40:12,980 INFO L899 garLoopResultBuilder]: For program point $Ultimate##630(lines 1308 1316) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L1100(lines 1092 1109) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L895 garLoopResultBuilder]: At program point L836(line 836) the Hoare annotation is: false [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point $Ultimate##642(lines 1330 1338) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 708) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 134) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1105) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L971(lines 971 975) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L179(lines 149 180) no Hoare annotation was computed. [2023-11-29 05:40:12,981 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 133) no Hoare annotation was computed. [2023-11-29 05:40:12,982 INFO L899 garLoopResultBuilder]: For program point L1038(lines 1038 1091) no Hoare annotation was computed. [2023-11-29 05:40:12,982 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-11-29 05:40:12,982 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-11-29 05:40:12,982 INFO L895 garLoopResultBuilder]: At program point L643-2(lines 643 671) the Hoare annotation is: (let ((.cse12 (= ~c_req_a~0 1)) (.cse20 (= ~req_tt_a~0 1)) (.cse21 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse16 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (.cse10 (= ~c_req_type~0 0)) (.cse17 (= ~c_req_a~0 0)) (.cse18 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse13 (= ~s_memory0~0 50)) (.cse5 (= ~c_empty_req~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse14 (= ~a_t~0 0)) (.cse19 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~s_memory1~0 51)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse11 .cse12 .cse13 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse3 .cse6 .cse7 .cse8 .cse14 .cse9 .cse15 .cse16) (and .cse10 .cse0 .cse17 .cse11 .cse18 .cse13 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse15) (and .cse10 .cse0 .cse11 .cse12 .cse20 .cse13 .cse3 .cse4 .cse6 .cse7 .cse8 .cse21 .cse9 .cse15 .cse16) (and .cse10 .cse0 .cse11 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) .cse12 .cse2 .cse20 .cse13 .cse3 .cse5 .cse6 .cse8 .cse21 .cse9 .cse15 .cse16) (and .cse10 .cse0 .cse17 .cse11 (= ~c_rsp_d~0 50) .cse2 .cse18 (= ~req_tt_a~0 0) .cse13 .cse3 .cse5 .cse6 .cse8 .cse14 .cse19 .cse9 .cse15) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9))) [2023-11-29 05:40:12,982 INFO L899 garLoopResultBuilder]: For program point L644(lines 643 671) no Hoare annotation was computed. [2023-11-29 05:40:12,982 INFO L899 garLoopResultBuilder]: For program point L578(lines 578 582) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 132) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L909(lines 883 910) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L895 garLoopResultBuilder]: At program point L183-2(lines 183 211) the Hoare annotation is: (let ((.cse2 (= ~s_run_pc~0 0)) (.cse14 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~c_req_a~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse0 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse16 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (<= 2 ~c_m_ev~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 .cse1 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse10 .cse11 .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse12 .cse13 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)) (and .cse14 .cse8 .cse15 .cse9 .cse0 .cse2 .cse16 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7) (and .cse14 .cse8 .cse15 .cse9 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7))) [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 782) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L184(lines 183 211) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L1308(lines 1260 1349) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2023-11-29 05:40:12,983 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 131) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L978(lines 970 987) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 388) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L1177(lines 1177 1181) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L1177-2(lines 1175 1354) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 983) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L451(lines 139 485) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 577 621) no Hoare annotation was computed. [2023-11-29 05:40:12,984 INFO L899 garLoopResultBuilder]: For program point L916(lines 916 969) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L322(lines 292 323) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L719(lines 490 842) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L1182-1(lines 1175 1354) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 129) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L786(lines 786 790) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L720(lines 720 724) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L391(lines 383 400) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 940 966) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 451 459) no Hoare annotation was computed. [2023-11-29 05:40:12,985 INFO L899 garLoopResultBuilder]: For program point L259(lines 139 485) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1254) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 396) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 473 481) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L329(lines 329 382) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 391 399) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L990(lines 990 1004) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 419 463) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2023-11-29 05:40:12,986 INFO L899 garLoopResultBuilder]: For program point L529(lines 499 530) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 427 462) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 435 461) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 924 968) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1124 1165) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 932 967) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 443 460) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point L136(lines 106 848) no Hoare annotation was computed. [2023-11-29 05:40:12,987 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 585 620) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L895 garLoopResultBuilder]: At program point L533-2(lines 533 561) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 (<= 1 ~a_t~0) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 593 619) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 601 618) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1046 1090) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point L534(lines 533 561) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 408) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point L402-1(lines 402 408) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point L1129(lines 1129 1133) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1054 1089) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L899 garLoopResultBuilder]: For program point L1129-1(lines 1124 1165) no Hoare annotation was computed. [2023-11-29 05:40:12,988 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 67 72) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 609 617) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L895 garLoopResultBuilder]: At program point L139-2(lines 139 485) the Hoare annotation is: (let ((.cse3 (= ~s_memory0~0 50)) (.cse8 (= ~m_run_pc~0 3)) (.cse13 (= ~s_run_pc~0 0)) (.cse11 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~a_t~0 0)) (.cse14 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~c_req_d~0 50)) (and .cse11 .cse0 .cse12 .cse13 .cse2 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10 .cse15) (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 (<= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~s_memory1~0 51)) (and .cse1 .cse13 .cse2 .cse5 .cse6 .cse7 .cse14 .cse15) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10 .cse15))) [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 878) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 738) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L895 garLoopResultBuilder]: At program point L404(line 404) the Hoare annotation is: false [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 485) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L933(lines 933 937) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 948 965) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L801(lines 490 842) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 956 964) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L1330(lines 1260 1349) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 806) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 978 986) no Hoare annotation was computed. [2023-11-29 05:40:12,989 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1335) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 877) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L473(lines 465 482) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L672(lines 642 673) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L1135(lines 1124 1165) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L1268(lines 1268 1321) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 84) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 876) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L212(lines 182 213) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L741(lines 733 750) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L609(lines 490 842) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 464) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2023-11-29 05:40:12,990 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 84) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L895 garLoopResultBuilder]: At program point L1006-1(lines 1006 1030) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse9 (= ~a_t~0 0)) (.cse15 (= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse16 (<= 1 ~a_t~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse4 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 (= ~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) .cse3 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and (= 51 ~c_req_d~0) .cse1 .cse2 .cse16 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse16 (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))) [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 746) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 614) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 416) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1006 1030) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L941(lines 941 945) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L281(lines 273 290) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2023-11-29 05:40:12,991 INFO L895 garLoopResultBuilder]: At program point L150-2(lines 150 178) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_m_lock~0 1))) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse16 .cse5 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse1 .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse5 (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 .cse14 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-11-29 05:40:12,992 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 77 87) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L679(lines 679 732) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L151(lines 150 178) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 684) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1172 1355) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L219(lines 219 272) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L1078(lines 881 1111) no Hoare annotation was computed. [2023-11-29 05:40:12,992 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1347) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L895 garLoopResultBuilder]: At program point L1343-1(lines 1260 1349) the Hoare annotation is: (let ((.cse2 (<= 1 ~a_t~0)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse17 (= ~m_run_pc~0 0)) (.cse18 (= ~s_run_pc~0 0)) (.cse12 (= ~c_req_type~0 0)) (.cse13 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_memory0~0 50)) (.cse16 (= ~a_t~0 0)) (.cse11 (= ~s_memory1~0 51)) (.cse19 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~m_run_st~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse15 .cse16 .cse10 .cse17) (and .cse13 .cse3 .cse18 .cse14 .cse7 .cse8 .cse15 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 (= ~c_req_d~0 50)) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse19 .cse8 .cse15 .cse20 .cse10) (and .cse12 .cse0 .cse1 .cse2 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse18 .cse14 .cse7 .cse8 .cse15 .cse16 .cse10 .cse17) (and .cse13 .cse3 .cse18 .cse4 .cse8 .cse15 .cse9 (not .cse12)) (and .cse6 .cse7 .cse8 .cse15 .cse9) (and .cse12 .cse0 .cse13 .cse1 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse16 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse15 .cse20 .cse10) (and .cse0 .cse3 .cse4 .cse6 .cse8 .cse15 .cse9))) [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L895 garLoopResultBuilder]: At program point L881-1(lines 881 1111) the Hoare annotation is: (let ((.cse3 (<= 1 ~a_t~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (= ~c_empty_rsp~0 1)) (.cse12 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_d~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse13 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse16 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= 51 ~c_req_d~0) .cse1 .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse4 .cse6 .cse7 .cse12 .cse10 .cse11) (and .cse0 .cse1 .cse13 .cse14 (not (= ~c_m_lock~0 1)) .cse6 .cse7 .cse15 .cse16 .cse10 (= ~m_run_pc~0 0)) (and .cse1 .cse2 .cse4 .cse6 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse7 .cse12 .cse16 .cse10 .cse17) (and .cse1 .cse13 .cse2 (= ~c_req_type~0 1) .cse14 (= ~s_run_pc~0 0) .cse7 .cse15 .cse12 .cse16 .cse10 .cse17) (and .cse0 .cse1 .cse13 .cse2 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse4 .cse5 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11))) [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 820) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 337 381) no Hoare annotation was computed. [2023-11-29 05:40:12,993 INFO L899 garLoopResultBuilder]: For program point L486(lines 138 487) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 953) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 345 380) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 353 379) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1249 1257) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L895 garLoopResultBuilder]: At program point L884-1(lines 884 908) the Hoare annotation is: (let ((.cse17 (= 51 ~c_req_d~0)) (.cse3 (<= 1 ~a_t~0)) (.cse4 (= ~c_req_a~0 1)) (.cse5 (= ~req_tt_a~0 1)) (.cse21 (= ~c_req_type~0 1)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse22 (= ~c_req_d~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse18 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse19 (= ~req_tt_a~0 0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse20 (= ~a_t~0 0)) (.cse11 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse4 (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) .cse5 (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse7 .cse8 .cse9 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse8 .cse9 .cse16 .cse12 .cse13) (and .cse0 .cse1 .cse18 .cse2 .cse14 .cse19 .cse6 .cse7 .cse9 .cse15 .cse10 .cse20 .cse12 .cse13) (and .cse17 .cse1 .cse2 .cse21 .cse3 .cse4 .cse14 .cse6 .cse7 .cse9 .cse15 .cse16 .cse12) (and .cse1 .cse18 .cse2 .cse21 .cse14 .cse7 .cse9 .cse15 .cse16 .cse20 .cse12 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse18 .cse14 (not (= ~c_m_lock~0 1)) .cse8 .cse9 .cse15 .cse20 .cse12 (= ~m_run_pc~0 0)) (and .cse1 .cse2 .cse6 .cse8 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse9 .cse16 .cse20 .cse12 .cse22) (and .cse1 .cse18 .cse2 .cse21 .cse14 (= ~s_run_pc~0 0) .cse9 .cse15 .cse16 .cse20 .cse12 .cse22) (and .cse0 .cse1 .cse18 .cse2 (= ~c_rsp_d~0 50) .cse19 (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse6 .cse7 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13))) [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 758) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 752 758) no Hoare annotation was computed. [2023-11-29 05:40:12,994 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 361 378) no Hoare annotation was computed. [2023-11-29 05:40:12,995 INFO L899 garLoopResultBuilder]: For program point L885(lines 884 908) no Hoare annotation was computed. [2023-11-29 05:40:12,995 INFO L895 garLoopResultBuilder]: At program point L1150(lines 1124 1165) the Hoare annotation is: (let ((.cse19 (<= 0 ~a_t~0)) (.cse25 (= 51 ~c_req_d~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse3 (<= 1 ~a_t~0)) (.cse4 (= ~c_req_a~0 1)) (.cse6 (= ~req_tt_a~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory1~0 51)) (.cse15 (= ~s_run_pc~0 0)) (.cse7 (= ~s_memory0~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse16 (not (= ~c_m_lock~0 1))) (.cse9 (= ~c_empty_req~0 1)) (.cse18 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse14 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse20 (= ~c_req_type~0 1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse23 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse5 .cse15 .cse16 .cse9 .cse10 .cse17 .cse18) (and .cse1 .cse5 .cse8 .cse19 .cse9 .cse10 .cse17 .cse11 .cse12) (and .cse1 .cse14 .cse2 .cse20 .cse15 .cse10 .cse17 .cse21 .cse22 .cse12 .cse23) (and .cse0 .cse1 .cse14 .cse2 .cse24 .cse7 .cse8 .cse10 .cse17 .cse11 .cse22 .cse12 .cse13) (and .cse1 .cse2 .cse5 .cse8 .cse19 .cse10 .cse17 .cse11 .cse12) (and .cse25 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse9 .cse10 .cse17 .cse22 .cse12 .cse18) (and .cse25 .cse1 .cse2 .cse20 .cse3 .cse4 .cse7 .cse8 .cse10 .cse17 .cse21 .cse12) (and .cse0 .cse1 .cse14 .cse2 (= ~c_rsp_d~0 50) .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13) (and .cse8 .cse9 .cse10 .cse17 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse1 .cse5 .cse8 .cse10 .cse17 .cse21) (and .cse14 .cse5 .cse15 .cse10 .cse17 .cse21 (not .cse0)) (and .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse21 .cse22 .cse12 .cse23) (and .cse0 .cse1 .cse14 .cse5 .cse16 .cse8 .cse9 .cse10 .cse17 .cse22 .cse12 .cse18) (and .cse1 .cse14 .cse2 .cse20 .cse8 .cse10 .cse17 .cse21 .cse22 .cse12 .cse23))) [2023-11-29 05:40:12,995 INFO L895 garLoopResultBuilder]: At program point L754(line 754) the Hoare annotation is: false [2023-11-29 05:40:12,995 INFO L899 garLoopResultBuilder]: For program point L688(lines 688 692) no Hoare annotation was computed. [2023-11-29 05:40:12,995 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1227 1235) no Hoare annotation was computed. [2023-11-29 05:40:12,995 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1219 1236) no Hoare annotation was computed. [2023-11-29 05:40:12,995 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 243 269) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L895 garLoopResultBuilder]: At program point L490-2(lines 490 842) the Hoare annotation is: (let ((.cse4 (= ~s_memory0~0 50)) (.cse6 (= ~c_empty_req~0 1)) (.cse13 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory1~0 51)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~a_t~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse12 (<= 2 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10) (and (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse13 (= ~a_t~0 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10))) [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 711 728) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 719 727) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 251 268) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1211 1237) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point L491(lines 490 842) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 259 267) no Hoare annotation was computed. [2023-11-29 05:40:12,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1203 1238) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L895 garLoopResultBuilder]: At program point L293-2(lines 293 321) the Hoare annotation is: (let ((.cse11 (= 51 ~c_req_d~0)) (.cse13 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse14 (not (= ~s_run_st~0 0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse17 (= ~s_run_pc~0 0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 (= ~c_req_a~0 1) .cse12 .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse13 .cse9) (and .cse0 .cse14 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse2 (<= 1 ~a_t~0) .cse14 .cse12 .cse4 .cse15 .cse5 .cse16 .cse13 .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse2 .cse14 .cse12 .cse4 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10) (and .cse4 .cse15 .cse5 .cse6 .cse16) (and .cse1 .cse14 .cse17 .cse5 .cse6 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 628) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 741 749) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point L294(lines 293 321) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1195 1239) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2023-11-29 05:40:12,998 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 232) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 281 289) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L823(lines 815 832) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 1161) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1062 1088) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1118 1171) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L956(lines 881 1111) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 631 639) no Hoare annotation was computed. [2023-11-29 05:40:12,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1070 1087) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point L957(lines 957 961) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##580(lines 1078 1086) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point L562(lines 532 563) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##592(lines 1100 1108) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 687 731) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point L761(lines 761 814) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 227 271) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 695 730) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 235 270) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 703 729) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-29 05:40:13,000 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-29 05:40:13,001 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-29 05:40:13,004 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, 1, 1, 1, 1, 1] [2023-11-29 05:40:13,005 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:40:13,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:40:13 BoogieIcfgContainer [2023-11-29 05:40:13,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:40:13,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:40:13,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:40:13,064 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:40:13,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:38:30" (3/4) ... [2023-11-29 05:40:13,067 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:40:13,071 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-29 05:40:13,088 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-29 05:40:13,090 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 05:40:13,091 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:40:13,093 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:40:13,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:40:13,303 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:40:13,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:40:13,304 INFO L158 Benchmark]: Toolchain (without parser) took 103980.70ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 103.9MB in the beginning and 669.2MB in the end (delta: -565.2MB). Peak memory consumption was 625.4MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,304 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:40:13,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.16ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 83.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.20ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 79.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,305 INFO L158 Benchmark]: Boogie Preprocessor took 67.55ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 75.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,305 INFO L158 Benchmark]: RCFGBuilder took 850.42ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 84.0MB in the end (delta: -8.9MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,305 INFO L158 Benchmark]: TraceAbstraction took 102375.91ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 83.1MB in the beginning and 683.8MB in the end (delta: -600.7MB). Peak memory consumption was 841.0MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,306 INFO L158 Benchmark]: Witness Printer took 239.03ms. Allocated memory is still 1.3GB. Free memory was 683.8MB in the beginning and 669.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:40:13,308 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.16ms. Allocated memory is still 107.0MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.16ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 83.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.20ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 79.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.55ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 75.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 850.42ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 84.0MB in the end (delta: -8.9MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * TraceAbstraction took 102375.91ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 83.1MB in the beginning and 683.8MB in the end (delta: -600.7MB). Peak memory consumption was 841.0MB. Max. memory is 16.1GB. * Witness Printer took 239.03ms. Allocated memory is still 1.3GB. Free memory was 683.8MB in the beginning and 669.2MB 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, 249 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 102.3s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 76.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12274 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12274 mSDsluCounter, 46395 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34920 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6072 IncrementalHoareTripleChecker+Invalid, 6614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 11475 mSDtfsCounter, 6072 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3486 GetRequests, 3269 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9663occurred in iteration=13, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 14186 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 135 PreInvPairs, 288 NumberOfFragments, 3385 HoareAnnotationTreeSize, 135 FomulaSimplifications, 3290160 FormulaSimplificationTreeSizeReduction, 68.2s HoareSimplificationTime, 19 FomulaSimplificationsInter, 113764 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 5673 NumberOfCodeBlocks, 5673 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6857 ConstructedInterpolants, 0 QuantifiedInterpolants, 18537 SizeOfPredicates, 48 NumberOfNonLiveVariables, 6224 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2283/4127 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: 293]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))) || (((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((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)))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((!((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))) || (((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 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)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 183]: 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)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (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) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((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)) && (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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (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 == 6)) && (2 <= c_m_ev))) || (((((((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: 884]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((!((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))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((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)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((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)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (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)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (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)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((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) && !((s_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 == 6)) && (2 <= c_m_ev))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (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)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((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)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((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))) || (((((((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)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (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)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (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))) || ((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (51 == req_d)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev) && (0 <= a)) && !((s_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 == 6)) && (2 <= c_m_ev)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 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)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((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_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) - InvariantResult [Line: 1006]: 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)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((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)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-29 05:40:13,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e8c99f-918a-427c-9d0a-5ea221c60551/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE