./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/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_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/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_61df6d9e-31f5-4356-967b-e718172f8969/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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:41:34,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:41:35,053 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:41:35,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:41:35,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:41:35,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:41:35,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:41:35,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:41:35,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:41:35,086 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:41:35,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:41:35,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:41:35,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:41:35,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:41:35,088 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:41:35,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:41:35,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:41:35,090 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:41:35,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:41:35,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:41:35,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:41:35,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:41:35,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:41:35,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:41:35,093 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:41:35,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:41:35,094 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:41:35,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:41:35,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:41:35,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:41:35,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:41:35,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:41:35,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:41:35,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:41:35,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:41:35,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:41:35,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:41:35,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:41:35,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:41:35,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:41:35,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:41:35,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:41:35,099 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_61df6d9e-31f5-4356-967b-e718172f8969/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_61df6d9e-31f5-4356-967b-e718172f8969/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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2023-11-29 03:41:35,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:41:35,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:41:35,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:41:35,326 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:41:35,327 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:41:35,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-11-29 03:41:38,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:41:38,260 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:41:38,260 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-11-29 03:41:38,268 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/data/e1717822c/6e5dd1bc1bb04f6ba5f3708f8f47eedb/FLAG88c834e6c [2023-11-29 03:41:38,278 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/data/e1717822c/6e5dd1bc1bb04f6ba5f3708f8f47eedb [2023-11-29 03:41:38,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:41:38,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:41:38,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:41:38,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:41:38,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:41:38,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b66264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38, skipping insertion in model container [2023-11-29 03:41:38,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,322 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:41:38,487 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_61df6d9e-31f5-4356-967b-e718172f8969/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2023-11-29 03:41:38,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:41:38,502 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:41:38,543 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2023-11-29 03:41:38,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:41:38,557 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:41:38,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38 WrapperNode [2023-11-29 03:41:38,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:41:38,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:41:38,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:41:38,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:41:38,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,600 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2023-11-29 03:41:38,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:41:38,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:41:38,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:41:38,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:41:38,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,631 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 03:41:38,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:41:38,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:41:38,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:41:38,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:41:38,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (1/1) ... [2023-11-29 03:41:38,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:41:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:41:38,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:41:38,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:41:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:41:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:41:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:41:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:41:38,785 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:41:38,787 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:41:39,071 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:41:39,107 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:41:39,107 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:41:39,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:41:39 BoogieIcfgContainer [2023-11-29 03:41:39,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:41:39,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:41:39,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:41:39,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:41:39,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:41:38" (1/3) ... [2023-11-29 03:41:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2f4c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:41:39, skipping insertion in model container [2023-11-29 03:41:39,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:41:38" (2/3) ... [2023-11-29 03:41:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2f4c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:41:39, skipping insertion in model container [2023-11-29 03:41:39,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:41:39" (3/3) ... [2023-11-29 03:41:39,118 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-11-29 03:41:39,138 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:41:39,138 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:41:39,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:41:39,186 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;@2ef13236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:41:39,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:41:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 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 03:41:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:41:39,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:39,196 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] [2023-11-29 03:41:39,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:39,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1331125770, now seen corresponding path program 1 times [2023-11-29 03:41:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254727757] [2023-11-29 03:41:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254727757] [2023-11-29 03:41:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254727757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:41:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388303144] [2023-11-29 03:41:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:41:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:39,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:41:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:41:39,544 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 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) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 03:41:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:39,622 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2023-11-29 03:41:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:41:39,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 22 [2023-11-29 03:41:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:39,633 INFO L225 Difference]: With dead ends: 142 [2023-11-29 03:41:39,634 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 03:41:39,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:41:39,639 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:39,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 264 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 03:41:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 59. [2023-11-29 03:41:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 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 03:41:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2023-11-29 03:41:39,672 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 22 [2023-11-29 03:41:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:39,672 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-11-29 03:41:39,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 03:41:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2023-11-29 03:41:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:41:39,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:39,674 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] [2023-11-29 03:41:39,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:41:39,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:39,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 855144128, now seen corresponding path program 1 times [2023-11-29 03:41:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743966525] [2023-11-29 03:41:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:39,770 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 03:41:39,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743966525] [2023-11-29 03:41:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743966525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:39,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007225503] [2023-11-29 03:41:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:39,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:39,774 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 03:41:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:39,801 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2023-11-29 03:41:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2023-11-29 03:41:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:39,803 INFO L225 Difference]: With dead ends: 127 [2023-11-29 03:41:39,804 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:41:39,804 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 03:41:39,806 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:39,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:41:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-11-29 03:41:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 86 states have internal predecessors, (127), 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 03:41:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2023-11-29 03:41:39,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 38 [2023-11-29 03:41:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:39,818 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2023-11-29 03:41:39,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 03:41:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2023-11-29 03:41:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:41:39,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:39,819 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] [2023-11-29 03:41:39,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:41:39,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:39,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1766348127, now seen corresponding path program 1 times [2023-11-29 03:41:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312495015] [2023-11-29 03:41:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:39,895 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 03:41:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:39,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312495015] [2023-11-29 03:41:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312495015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:39,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795279544] [2023-11-29 03:41:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:39,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:39,898 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 03:41:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:39,928 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2023-11-29 03:41:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2023-11-29 03:41:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:39,930 INFO L225 Difference]: With dead ends: 203 [2023-11-29 03:41:39,930 INFO L226 Difference]: Without dead ends: 137 [2023-11-29 03:41:39,931 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 03:41:39,932 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:39,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-29 03:41:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-11-29 03:41:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.507462686567164) internal successors, (202), 134 states have internal predecessors, (202), 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 03:41:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2023-11-29 03:41:39,945 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 38 [2023-11-29 03:41:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:39,945 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2023-11-29 03:41:39,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 03:41:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2023-11-29 03:41:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:41:39,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:39,947 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] [2023-11-29 03:41:39,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:41:39,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:39,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2141824130, now seen corresponding path program 1 times [2023-11-29 03:41:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875175029] [2023-11-29 03:41:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:40,060 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 03:41:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875175029] [2023-11-29 03:41:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875175029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:41:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777815059] [2023-11-29 03:41:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:40,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:41:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:40,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:41:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:41:40,063 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 03:41:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:40,167 INFO L93 Difference]: Finished difference Result 591 states and 926 transitions. [2023-11-29 03:41:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:41:40,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2023-11-29 03:41:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:40,172 INFO L225 Difference]: With dead ends: 591 [2023-11-29 03:41:40,172 INFO L226 Difference]: Without dead ends: 477 [2023-11-29 03:41:40,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:41:40,175 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 308 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:40,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 409 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:41:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2023-11-29 03:41:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 247. [2023-11-29 03:41:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 246 states have internal predecessors, (374), 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 03:41:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2023-11-29 03:41:40,222 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 38 [2023-11-29 03:41:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:40,223 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2023-11-29 03:41:40,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 03:41:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2023-11-29 03:41:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 03:41:40,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:40,225 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] [2023-11-29 03:41:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:41:40,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:40,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1985069537, now seen corresponding path program 1 times [2023-11-29 03:41:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517398421] [2023-11-29 03:41:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:40,437 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 03:41:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517398421] [2023-11-29 03:41:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517398421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:41:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274370057] [2023-11-29 03:41:40,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:40,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:41:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:40,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:41:40,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:41:40,440 INFO L87 Difference]: Start difference. First operand 247 states and 374 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:41:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:40,470 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-11-29 03:41:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:41:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) Word has length 39 [2023-11-29 03:41:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:40,472 INFO L225 Difference]: With dead ends: 273 [2023-11-29 03:41:40,472 INFO L226 Difference]: Without dead ends: 271 [2023-11-29 03:41:40,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:41:40,474 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:40,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-29 03:41:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2023-11-29 03:41:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 262 states have internal predecessors, (390), 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 03:41:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2023-11-29 03:41:40,493 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 39 [2023-11-29 03:41:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:40,493 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2023-11-29 03:41:40,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:41:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2023-11-29 03:41:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 03:41:40,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:40,495 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] [2023-11-29 03:41:40,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:41:40,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:40,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1406583098, now seen corresponding path program 1 times [2023-11-29 03:41:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:40,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916822041] [2023-11-29 03:41:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:40,552 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 03:41:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916822041] [2023-11-29 03:41:40,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916822041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:40,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:40,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509103223] [2023-11-29 03:41:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:40,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:40,554 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 03:41:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:40,580 INFO L93 Difference]: Finished difference Result 691 states and 1032 transitions. [2023-11-29 03:41:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2023-11-29 03:41:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:40,584 INFO L225 Difference]: With dead ends: 691 [2023-11-29 03:41:40,584 INFO L226 Difference]: Without dead ends: 449 [2023-11-29 03:41:40,585 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 03:41:40,586 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:40,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-29 03:41:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2023-11-29 03:41:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.4663677130044843) internal successors, (654), 446 states have internal predecessors, (654), 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 03:41:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 654 transitions. [2023-11-29 03:41:40,608 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 654 transitions. Word has length 40 [2023-11-29 03:41:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:40,608 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 654 transitions. [2023-11-29 03:41:40,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 03:41:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 654 transitions. [2023-11-29 03:41:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 03:41:40,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:40,610 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] [2023-11-29 03:41:40,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:41:40,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:40,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1835898686, now seen corresponding path program 1 times [2023-11-29 03:41:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635922919] [2023-11-29 03:41:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:40,657 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 03:41:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635922919] [2023-11-29 03:41:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635922919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:40,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314396102] [2023-11-29 03:41:40,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:40,659 INFO L87 Difference]: Start difference. First operand 447 states and 654 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 03:41:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:40,694 INFO L93 Difference]: Finished difference Result 877 states and 1299 transitions. [2023-11-29 03:41:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2023-11-29 03:41:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:40,699 INFO L225 Difference]: With dead ends: 877 [2023-11-29 03:41:40,699 INFO L226 Difference]: Without dead ends: 635 [2023-11-29 03:41:40,700 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 03:41:40,701 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:40,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-29 03:41:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2023-11-29 03:41:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4556962025316456) internal successors, (920), 632 states have internal predecessors, (920), 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 03:41:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 920 transitions. [2023-11-29 03:41:40,732 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 920 transitions. Word has length 40 [2023-11-29 03:41:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:40,732 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 920 transitions. [2023-11-29 03:41:40,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 03:41:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 920 transitions. [2023-11-29 03:41:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:41:40,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:40,736 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:41:40,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:41:40,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:40,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1126850639, now seen corresponding path program 1 times [2023-11-29 03:41:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87613510] [2023-11-29 03:41:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:41:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87613510] [2023-11-29 03:41:40,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87613510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:41:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166481704] [2023-11-29 03:41:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:40,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:41:40,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:41:40,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:41:40,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:41:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:41,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 03:41:41,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:41:41,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:41:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166481704] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:41,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:41:41,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2023-11-29 03:41:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488964313] [2023-11-29 03:41:41,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:41,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:41:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:41:41,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:41:41,549 INFO L87 Difference]: Start difference. First operand 633 states and 920 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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 03:41:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:41,638 INFO L93 Difference]: Finished difference Result 1833 states and 2708 transitions. [2023-11-29 03:41:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:41:41,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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) Word has length 58 [2023-11-29 03:41:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:41,647 INFO L225 Difference]: With dead ends: 1833 [2023-11-29 03:41:41,647 INFO L226 Difference]: Without dead ends: 1407 [2023-11-29 03:41:41,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:41:41,649 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 251 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:41,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 530 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2023-11-29 03:41:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1401. [2023-11-29 03:41:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.457142857142857) internal successors, (2040), 1400 states have internal predecessors, (2040), 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 03:41:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2040 transitions. [2023-11-29 03:41:41,708 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2040 transitions. Word has length 58 [2023-11-29 03:41:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:41,709 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 2040 transitions. [2023-11-29 03:41:41,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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 03:41:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2040 transitions. [2023-11-29 03:41:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:41:41,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:41,710 INFO L195 NwaCegarLoop]: trace histogram [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 03:41:41,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:41:41,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:41:41,915 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:41,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1200740092, now seen corresponding path program 1 times [2023-11-29 03:41:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894231559] [2023-11-29 03:41:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:41:42,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894231559] [2023-11-29 03:41:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894231559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:41:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934131410] [2023-11-29 03:41:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:42,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:41:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:41:42,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:41:42,037 INFO L87 Difference]: Start difference. First operand 1401 states and 2040 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 03:41:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:42,168 INFO L93 Difference]: Finished difference Result 3405 states and 5004 transitions. [2023-11-29 03:41:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:41:42,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 59 [2023-11-29 03:41:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:42,184 INFO L225 Difference]: With dead ends: 3405 [2023-11-29 03:41:42,184 INFO L226 Difference]: Without dead ends: 2687 [2023-11-29 03:41:42,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:41:42,186 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:42,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 366 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2023-11-29 03:41:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2077. [2023-11-29 03:41:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 2076 states have (on average 1.4527938342967244) internal successors, (3016), 2076 states have internal predecessors, (3016), 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 03:41:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3016 transitions. [2023-11-29 03:41:42,300 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3016 transitions. Word has length 59 [2023-11-29 03:41:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:42,301 INFO L495 AbstractCegarLoop]: Abstraction has 2077 states and 3016 transitions. [2023-11-29 03:41:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 03:41:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3016 transitions. [2023-11-29 03:41:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:41:42,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:42,302 INFO L195 NwaCegarLoop]: trace histogram [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 03:41:42,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:41:42,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:42,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash 576240378, now seen corresponding path program 1 times [2023-11-29 03:41:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:42,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495712987] [2023-11-29 03:41:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:42,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:41:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495712987] [2023-11-29 03:41:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495712987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:41:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650877973] [2023-11-29 03:41:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:42,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:41:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:42,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:41:42,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:41:42,415 INFO L87 Difference]: Start difference. First operand 2077 states and 3016 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 03:41:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:42,554 INFO L93 Difference]: Finished difference Result 4081 states and 5980 transitions. [2023-11-29 03:41:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:41:42,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) Word has length 59 [2023-11-29 03:41:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:42,574 INFO L225 Difference]: With dead ends: 4081 [2023-11-29 03:41:42,574 INFO L226 Difference]: Without dead ends: 3363 [2023-11-29 03:41:42,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:41:42,577 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 215 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:42,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 357 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2023-11-29 03:41:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 2753. [2023-11-29 03:41:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 1.4505813953488371) internal successors, (3992), 2752 states have internal predecessors, (3992), 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 03:41:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3992 transitions. [2023-11-29 03:41:42,699 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3992 transitions. Word has length 59 [2023-11-29 03:41:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:42,699 INFO L495 AbstractCegarLoop]: Abstraction has 2753 states and 3992 transitions. [2023-11-29 03:41:42,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 03:41:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3992 transitions. [2023-11-29 03:41:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:41:42,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:42,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:42,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:41:42,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:42,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash 741118013, now seen corresponding path program 1 times [2023-11-29 03:41:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582139419] [2023-11-29 03:41:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:41:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582139419] [2023-11-29 03:41:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582139419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:41:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860024891] [2023-11-29 03:41:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:41:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:41:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:41:42,837 INFO L87 Difference]: Start difference. First operand 2753 states and 3992 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 03:41:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:43,006 INFO L93 Difference]: Finished difference Result 4469 states and 6520 transitions. [2023-11-29 03:41:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:41:43,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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) Word has length 59 [2023-11-29 03:41:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:43,027 INFO L225 Difference]: With dead ends: 4469 [2023-11-29 03:41:43,028 INFO L226 Difference]: Without dead ends: 3935 [2023-11-29 03:41:43,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:41:43,030 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 206 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:43,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 382 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2023-11-29 03:41:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3325. [2023-11-29 03:41:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3324 states have (on average 1.447653429602888) internal successors, (4812), 3324 states have internal predecessors, (4812), 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 03:41:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4812 transitions. [2023-11-29 03:41:43,170 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4812 transitions. Word has length 59 [2023-11-29 03:41:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:43,170 INFO L495 AbstractCegarLoop]: Abstraction has 3325 states and 4812 transitions. [2023-11-29 03:41:43,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 03:41:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4812 transitions. [2023-11-29 03:41:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:43,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:43,171 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:41:43,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:41:43,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:43,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1560695639, now seen corresponding path program 1 times [2023-11-29 03:41:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71582156] [2023-11-29 03:41:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71582156] [2023-11-29 03:41:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71582156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:43,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:43,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732141426] [2023-11-29 03:41:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:43,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:43,262 INFO L87 Difference]: Start difference. First operand 3325 states and 4812 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:43,369 INFO L93 Difference]: Finished difference Result 5962 states and 8606 transitions. [2023-11-29 03:41:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2023-11-29 03:41:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:43,384 INFO L225 Difference]: With dead ends: 5962 [2023-11-29 03:41:43,385 INFO L226 Difference]: Without dead ends: 2660 [2023-11-29 03:41:43,388 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 03:41:43,389 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:43,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2023-11-29 03:41:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2558. [2023-11-29 03:41:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2557 states have (on average 1.4278451310129057) internal successors, (3651), 2557 states have internal predecessors, (3651), 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 03:41:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3651 transitions. [2023-11-29 03:41:43,494 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3651 transitions. Word has length 62 [2023-11-29 03:41:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:43,494 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3651 transitions. [2023-11-29 03:41:43,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3651 transitions. [2023-11-29 03:41:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:43,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:43,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:43,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:41:43,496 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:43,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1181811766, now seen corresponding path program 1 times [2023-11-29 03:41:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177279390] [2023-11-29 03:41:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177279390] [2023-11-29 03:41:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177279390] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:41:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744374916] [2023-11-29 03:41:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:41:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:41:43,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:41:43,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:41:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:43,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:41:43,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:44,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:46,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744374916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:46,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:41:46,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 30 [2023-11-29 03:41:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448847175] [2023-11-29 03:41:46,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:46,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 03:41:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 03:41:46,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2023-11-29 03:41:46,207 INFO L87 Difference]: Start difference. First operand 2558 states and 3651 transitions. Second operand has 31 states, 31 states have (on average 5.483870967741935) internal successors, (170), 30 states have internal predecessors, (170), 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 03:41:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:47,518 INFO L93 Difference]: Finished difference Result 11339 states and 16022 transitions. [2023-11-29 03:41:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 03:41:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.483870967741935) internal successors, (170), 30 states have internal predecessors, (170), 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) Word has length 62 [2023-11-29 03:41:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:47,554 INFO L225 Difference]: With dead ends: 11339 [2023-11-29 03:41:47,554 INFO L226 Difference]: Without dead ends: 8810 [2023-11-29 03:41:47,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=715, Invalid=2365, Unknown=0, NotChecked=0, Total=3080 [2023-11-29 03:41:47,561 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 939 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:47,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 525 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:41:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8810 states. [2023-11-29 03:41:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8810 to 5847. [2023-11-29 03:41:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5847 states, 5846 states have (on average 1.4091686623332194) internal successors, (8238), 5846 states have internal predecessors, (8238), 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 03:41:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 8238 transitions. [2023-11-29 03:41:47,785 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 8238 transitions. Word has length 62 [2023-11-29 03:41:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:47,785 INFO L495 AbstractCegarLoop]: Abstraction has 5847 states and 8238 transitions. [2023-11-29 03:41:47,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.483870967741935) internal successors, (170), 30 states have internal predecessors, (170), 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 03:41:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 8238 transitions. [2023-11-29 03:41:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:47,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:47,786 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:41:47,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:41:47,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 03:41:47,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:47,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -795016727, now seen corresponding path program 1 times [2023-11-29 03:41:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874796433] [2023-11-29 03:41:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874796433] [2023-11-29 03:41:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874796433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:48,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:48,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158253742] [2023-11-29 03:41:48,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:48,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:48,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:48,076 INFO L87 Difference]: Start difference. First operand 5847 states and 8238 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:48,163 INFO L93 Difference]: Finished difference Result 8216 states and 11597 transitions. [2023-11-29 03:41:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:48,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2023-11-29 03:41:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:48,172 INFO L225 Difference]: With dead ends: 8216 [2023-11-29 03:41:48,172 INFO L226 Difference]: Without dead ends: 3055 [2023-11-29 03:41:48,178 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 03:41:48,178 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:48,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2023-11-29 03:41:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2981. [2023-11-29 03:41:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2980 states have (on average 1.3781879194630873) internal successors, (4107), 2980 states have internal predecessors, (4107), 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 03:41:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4107 transitions. [2023-11-29 03:41:48,306 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4107 transitions. Word has length 62 [2023-11-29 03:41:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:48,307 INFO L495 AbstractCegarLoop]: Abstraction has 2981 states and 4107 transitions. [2023-11-29 03:41:48,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4107 transitions. [2023-11-29 03:41:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:48,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:48,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:48,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:41:48,308 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:48,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1806311480, now seen corresponding path program 1 times [2023-11-29 03:41:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270907707] [2023-11-29 03:41:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270907707] [2023-11-29 03:41:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270907707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:41:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477109803] [2023-11-29 03:41:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:48,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:41:48,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:41:48,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:41:48,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:41:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:48,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:41:48,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:49,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:50,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477109803] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:50,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:41:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2023-11-29 03:41:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404568445] [2023-11-29 03:41:50,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:50,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 03:41:50,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:50,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 03:41:50,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:41:50,384 INFO L87 Difference]: Start difference. First operand 2981 states and 4107 transitions. Second operand has 27 states, 27 states have (on average 5.777777777777778) internal successors, (156), 26 states have internal predecessors, (156), 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 03:41:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:51,247 INFO L93 Difference]: Finished difference Result 11429 states and 15598 transitions. [2023-11-29 03:41:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:41:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.777777777777778) internal successors, (156), 26 states have internal predecessors, (156), 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) Word has length 62 [2023-11-29 03:41:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:51,259 INFO L225 Difference]: With dead ends: 11429 [2023-11-29 03:41:51,259 INFO L226 Difference]: Without dead ends: 9195 [2023-11-29 03:41:51,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=428, Invalid=1464, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 03:41:51,263 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 906 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:51,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 819 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:41:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9195 states. [2023-11-29 03:41:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9195 to 6842. [2023-11-29 03:41:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6842 states, 6841 states have (on average 1.3718754568045608) internal successors, (9385), 6841 states have internal predecessors, (9385), 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 03:41:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 9385 transitions. [2023-11-29 03:41:51,517 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 9385 transitions. Word has length 62 [2023-11-29 03:41:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:51,517 INFO L495 AbstractCegarLoop]: Abstraction has 6842 states and 9385 transitions. [2023-11-29 03:41:51,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.777777777777778) internal successors, (156), 26 states have internal predecessors, (156), 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 03:41:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 9385 transitions. [2023-11-29 03:41:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:51,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:51,519 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:41:51,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 03:41:51,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 03:41:51,720 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:51,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -321287991, now seen corresponding path program 1 times [2023-11-29 03:41:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222700642] [2023-11-29 03:41:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222700642] [2023-11-29 03:41:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222700642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433148524] [2023-11-29 03:41:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:51,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:51,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:51,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:51,795 INFO L87 Difference]: Start difference. First operand 6842 states and 9385 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:51,867 INFO L93 Difference]: Finished difference Result 10260 states and 14069 transitions. [2023-11-29 03:41:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2023-11-29 03:41:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:51,873 INFO L225 Difference]: With dead ends: 10260 [2023-11-29 03:41:51,873 INFO L226 Difference]: Without dead ends: 4439 [2023-11-29 03:41:51,878 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 03:41:51,878 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:51,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2023-11-29 03:41:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 4437. [2023-11-29 03:41:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4436 states have (on average 1.333633904418395) internal successors, (5916), 4436 states have internal predecessors, (5916), 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 03:41:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5916 transitions. [2023-11-29 03:41:51,968 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5916 transitions. Word has length 62 [2023-11-29 03:41:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:51,968 INFO L495 AbstractCegarLoop]: Abstraction has 4437 states and 5916 transitions. [2023-11-29 03:41:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5916 transitions. [2023-11-29 03:41:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:51,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:51,970 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:51,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:41:51,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:51,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2089121957, now seen corresponding path program 1 times [2023-11-29 03:41:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580201419] [2023-11-29 03:41:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580201419] [2023-11-29 03:41:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580201419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:41:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857461963] [2023-11-29 03:41:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:52,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:41:52,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:41:52,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:41:52,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:41:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:52,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:41:52,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:52,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857461963] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:53,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:41:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 25 [2023-11-29 03:41:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404897572] [2023-11-29 03:41:53,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:53,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:41:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:53,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:41:53,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:41:53,915 INFO L87 Difference]: Start difference. First operand 4437 states and 5916 transitions. Second operand has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 25 states have internal predecessors, (160), 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 03:41:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:54,930 INFO L93 Difference]: Finished difference Result 19413 states and 25442 transitions. [2023-11-29 03:41:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:41:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 25 states have internal predecessors, (160), 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) Word has length 62 [2023-11-29 03:41:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:54,956 INFO L225 Difference]: With dead ends: 19413 [2023-11-29 03:41:54,956 INFO L226 Difference]: Without dead ends: 15030 [2023-11-29 03:41:54,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 03:41:54,963 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 597 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:54,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 660 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:41:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15030 states. [2023-11-29 03:41:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15030 to 13473. [2023-11-29 03:41:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13473 states, 13472 states have (on average 1.2999554631828978) internal successors, (17513), 13472 states have internal predecessors, (17513), 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 03:41:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13473 states to 13473 states and 17513 transitions. [2023-11-29 03:41:55,313 INFO L78 Accepts]: Start accepts. Automaton has 13473 states and 17513 transitions. Word has length 62 [2023-11-29 03:41:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:55,314 INFO L495 AbstractCegarLoop]: Abstraction has 13473 states and 17513 transitions. [2023-11-29 03:41:55,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 25 states have internal predecessors, (160), 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 03:41:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13473 states and 17513 transitions. [2023-11-29 03:41:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:41:55,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:55,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:55,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 03:41:55,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 03:41:55,521 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:55,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash 643288650, now seen corresponding path program 1 times [2023-11-29 03:41:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922461936] [2023-11-29 03:41:55,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:55,564 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 03:41:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922461936] [2023-11-29 03:41:55,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922461936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:55,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:55,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834671795] [2023-11-29 03:41:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:55,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:55,567 INFO L87 Difference]: Start difference. First operand 13473 states and 17513 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:55,956 INFO L93 Difference]: Finished difference Result 33118 states and 43047 transitions. [2023-11-29 03:41:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2023-11-29 03:41:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:55,982 INFO L225 Difference]: With dead ends: 33118 [2023-11-29 03:41:55,982 INFO L226 Difference]: Without dead ends: 19811 [2023-11-29 03:41:55,994 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 03:41:55,994 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:55,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 189 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19811 states. [2023-11-29 03:41:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19811 to 15293. [2023-11-29 03:41:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15293 states, 15292 states have (on average 1.2862280931205858) internal successors, (19669), 15292 states have internal predecessors, (19669), 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 03:41:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15293 states to 15293 states and 19669 transitions. [2023-11-29 03:41:56,479 INFO L78 Accepts]: Start accepts. Automaton has 15293 states and 19669 transitions. Word has length 62 [2023-11-29 03:41:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:56,479 INFO L495 AbstractCegarLoop]: Abstraction has 15293 states and 19669 transitions. [2023-11-29 03:41:56,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 03:41:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15293 states and 19669 transitions. [2023-11-29 03:41:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:41:56,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:56,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:56,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 03:41:56,481 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:56,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1207652568, now seen corresponding path program 1 times [2023-11-29 03:41:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719789746] [2023-11-29 03:41:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:56,525 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 03:41:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719789746] [2023-11-29 03:41:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719789746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539876073] [2023-11-29 03:41:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:56,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:56,527 INFO L87 Difference]: Start difference. First operand 15293 states and 19669 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:41:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:56,985 INFO L93 Difference]: Finished difference Result 37582 states and 48311 transitions. [2023-11-29 03:41:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2023-11-29 03:41:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:57,051 INFO L225 Difference]: With dead ends: 37582 [2023-11-29 03:41:57,051 INFO L226 Difference]: Without dead ends: 22603 [2023-11-29 03:41:57,062 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 03:41:57,063 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:57,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 182 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22603 states. [2023-11-29 03:41:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22603 to 20052. [2023-11-29 03:41:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20052 states, 20051 states have (on average 1.2662211361029374) internal successors, (25389), 20051 states have internal predecessors, (25389), 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 03:41:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20052 states to 20052 states and 25389 transitions. [2023-11-29 03:41:57,623 INFO L78 Accepts]: Start accepts. Automaton has 20052 states and 25389 transitions. Word has length 63 [2023-11-29 03:41:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:57,624 INFO L495 AbstractCegarLoop]: Abstraction has 20052 states and 25389 transitions. [2023-11-29 03:41:57,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:41:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20052 states and 25389 transitions. [2023-11-29 03:41:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:41:57,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:57,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:41:57,626 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:57,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 933777477, now seen corresponding path program 1 times [2023-11-29 03:41:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30888750] [2023-11-29 03:41:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:57,656 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 03:41:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30888750] [2023-11-29 03:41:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30888750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237012811] [2023-11-29 03:41:57,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:57,658 INFO L87 Difference]: Start difference. First operand 20052 states and 25389 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:41:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:58,215 INFO L93 Difference]: Finished difference Result 24940 states and 31457 transitions. [2023-11-29 03:41:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2023-11-29 03:41:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:58,230 INFO L225 Difference]: With dead ends: 24940 [2023-11-29 03:41:58,230 INFO L226 Difference]: Without dead ends: 18684 [2023-11-29 03:41:58,238 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 03:41:58,238 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:58,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18684 states. [2023-11-29 03:41:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18684 to 18682. [2023-11-29 03:41:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18682 states, 18681 states have (on average 1.2477918740966758) internal successors, (23310), 18681 states have internal predecessors, (23310), 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 03:41:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18682 states to 18682 states and 23310 transitions. [2023-11-29 03:41:58,775 INFO L78 Accepts]: Start accepts. Automaton has 18682 states and 23310 transitions. Word has length 63 [2023-11-29 03:41:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:58,775 INFO L495 AbstractCegarLoop]: Abstraction has 18682 states and 23310 transitions. [2023-11-29 03:41:58,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:41:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18682 states and 23310 transitions. [2023-11-29 03:41:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:41:58,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:58,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:58,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 03:41:58,778 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:41:58,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash 210667089, now seen corresponding path program 1 times [2023-11-29 03:41:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:41:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013993078] [2023-11-29 03:41:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:41:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:58,808 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 03:41:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:41:58,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013993078] [2023-11-29 03:41:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013993078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:41:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958557269] [2023-11-29 03:41:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:58,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:41:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:41:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:41:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:41:58,810 INFO L87 Difference]: Start difference. First operand 18682 states and 23310 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:41:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:59,327 INFO L93 Difference]: Finished difference Result 39942 states and 49724 transitions. [2023-11-29 03:41:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:41:59,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2023-11-29 03:41:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:59,344 INFO L225 Difference]: With dead ends: 39942 [2023-11-29 03:41:59,344 INFO L226 Difference]: Without dead ends: 23379 [2023-11-29 03:41:59,351 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 03:41:59,352 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:59,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 156 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:41:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23379 states. [2023-11-29 03:41:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23379 to 23377. [2023-11-29 03:41:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23377 states, 23376 states have (on average 1.2159479808350444) internal successors, (28424), 23376 states have internal predecessors, (28424), 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 03:42:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23377 states to 23377 states and 28424 transitions. [2023-11-29 03:42:00,009 INFO L78 Accepts]: Start accepts. Automaton has 23377 states and 28424 transitions. Word has length 63 [2023-11-29 03:42:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:42:00,009 INFO L495 AbstractCegarLoop]: Abstraction has 23377 states and 28424 transitions. [2023-11-29 03:42:00,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:42:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23377 states and 28424 transitions. [2023-11-29 03:42:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:42:00,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:42:00,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:42:00,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 03:42:00,011 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:42:00,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:42:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1674834651, now seen corresponding path program 1 times [2023-11-29 03:42:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:42:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966521501] [2023-11-29 03:42:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:00,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:42:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:00,043 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 03:42:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:42:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966521501] [2023-11-29 03:42:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966521501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:42:00,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:42:00,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:42:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113270727] [2023-11-29 03:42:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:42:00,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:42:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:42:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:42:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:42:00,044 INFO L87 Difference]: Start difference. First operand 23377 states and 28424 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:42:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:42:00,689 INFO L93 Difference]: Finished difference Result 31593 states and 38191 transitions. [2023-11-29 03:42:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:42:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2023-11-29 03:42:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:42:00,705 INFO L225 Difference]: With dead ends: 31593 [2023-11-29 03:42:00,705 INFO L226 Difference]: Without dead ends: 19052 [2023-11-29 03:42:00,713 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 03:42:00,714 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:42:00,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 178 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:42:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19052 states. [2023-11-29 03:42:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19052 to 19050. [2023-11-29 03:42:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19050 states, 19049 states have (on average 1.1921360701349153) internal successors, (22709), 19049 states have internal predecessors, (22709), 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 03:42:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19050 states to 19050 states and 22709 transitions. [2023-11-29 03:42:01,454 INFO L78 Accepts]: Start accepts. Automaton has 19050 states and 22709 transitions. Word has length 63 [2023-11-29 03:42:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:42:01,455 INFO L495 AbstractCegarLoop]: Abstraction has 19050 states and 22709 transitions. [2023-11-29 03:42:01,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:42:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19050 states and 22709 transitions. [2023-11-29 03:42:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:42:01,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:42:01,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:42:01,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:42:01,458 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:42:01,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:42:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1806922653, now seen corresponding path program 1 times [2023-11-29 03:42:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:42:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768496056] [2023-11-29 03:42:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:42:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:01,495 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 03:42:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:42:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768496056] [2023-11-29 03:42:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768496056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:42:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:42:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:42:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123655573] [2023-11-29 03:42:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:42:01,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:42:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:42:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:42:01,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:42:01,497 INFO L87 Difference]: Start difference. First operand 19050 states and 22709 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:42:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:42:01,964 INFO L93 Difference]: Finished difference Result 28344 states and 33682 transitions. [2023-11-29 03:42:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:42:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2023-11-29 03:42:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:42:01,976 INFO L225 Difference]: With dead ends: 28344 [2023-11-29 03:42:01,976 INFO L226 Difference]: Without dead ends: 16283 [2023-11-29 03:42:01,980 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 03:42:01,980 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:42:01,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 199 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:42:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2023-11-29 03:42:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 15368. [2023-11-29 03:42:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15368 states, 15367 states have (on average 1.1755059543176938) internal successors, (18064), 15367 states have internal predecessors, (18064), 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 03:42:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15368 states to 15368 states and 18064 transitions. [2023-11-29 03:42:02,392 INFO L78 Accepts]: Start accepts. Automaton has 15368 states and 18064 transitions. Word has length 63 [2023-11-29 03:42:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:42:02,392 INFO L495 AbstractCegarLoop]: Abstraction has 15368 states and 18064 transitions. [2023-11-29 03:42:02,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 03:42:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15368 states and 18064 transitions. [2023-11-29 03:42:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:42:02,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:42:02,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:42:02,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 03:42:02,395 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:42:02,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:42:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -438029821, now seen corresponding path program 1 times [2023-11-29 03:42:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:42:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239449979] [2023-11-29 03:42:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:42:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:02,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:42:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239449979] [2023-11-29 03:42:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239449979] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:42:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549833886] [2023-11-29 03:42:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:02,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:42:02,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:42:02,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:42:02,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:42:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:02,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:42:02,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:42:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:02,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:42:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549833886] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:42:02,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:42:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-29 03:42:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949345365] [2023-11-29 03:42:02,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:42:02,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:42:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:42:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:42:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:42:02,800 INFO L87 Difference]: Start difference. First operand 15368 states and 18064 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 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 03:42:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:42:03,314 INFO L93 Difference]: Finished difference Result 15534 states and 18228 transitions. [2023-11-29 03:42:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:42:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 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) Word has length 63 [2023-11-29 03:42:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:42:03,328 INFO L225 Difference]: With dead ends: 15534 [2023-11-29 03:42:03,328 INFO L226 Difference]: Without dead ends: 13799 [2023-11-29 03:42:03,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:42:03,333 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 298 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:42:03,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 187 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:42:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2023-11-29 03:42:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 13635. [2023-11-29 03:42:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13635 states, 13634 states have (on average 1.1744168989291477) internal successors, (16012), 13634 states have internal predecessors, (16012), 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 03:42:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 16012 transitions. [2023-11-29 03:42:03,761 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 16012 transitions. Word has length 63 [2023-11-29 03:42:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:42:03,761 INFO L495 AbstractCegarLoop]: Abstraction has 13635 states and 16012 transitions. [2023-11-29 03:42:03,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 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 03:42:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 16012 transitions. [2023-11-29 03:42:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 03:42:03,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:42:03,763 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:42:03,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:42:03,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 03:42:03,964 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:42:03,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:42:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1064385362, now seen corresponding path program 1 times [2023-11-29 03:42:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:42:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9260719] [2023-11-29 03:42:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:42:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:42:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9260719] [2023-11-29 03:42:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9260719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:42:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569634835] [2023-11-29 03:42:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:42:04,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:42:04,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:42:04,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:42:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:04,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:42:04,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:42:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:04,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:42:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569634835] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:42:04,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:42:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-29 03:42:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631115803] [2023-11-29 03:42:04,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:42:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:42:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:42:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:42:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:42:04,368 INFO L87 Difference]: Start difference. First operand 13635 states and 16012 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 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 03:42:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:42:04,802 INFO L93 Difference]: Finished difference Result 16422 states and 19343 transitions. [2023-11-29 03:42:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:42:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 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) Word has length 64 [2023-11-29 03:42:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:42:04,813 INFO L225 Difference]: With dead ends: 16422 [2023-11-29 03:42:04,813 INFO L226 Difference]: Without dead ends: 12901 [2023-11-29 03:42:04,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:42:04,817 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 341 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:42:04,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 192 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:42:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12901 states. [2023-11-29 03:42:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12901 to 12664. [2023-11-29 03:42:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12664 states, 12663 states have (on average 1.1746031746031746) internal successors, (14874), 12663 states have internal predecessors, (14874), 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 03:42:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12664 states to 12664 states and 14874 transitions. [2023-11-29 03:42:05,193 INFO L78 Accepts]: Start accepts. Automaton has 12664 states and 14874 transitions. Word has length 64 [2023-11-29 03:42:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:42:05,193 INFO L495 AbstractCegarLoop]: Abstraction has 12664 states and 14874 transitions. [2023-11-29 03:42:05,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 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 03:42:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12664 states and 14874 transitions. [2023-11-29 03:42:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 03:42:05,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:42:05,195 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:42:05,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:42:05,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 03:42:05,396 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:42:05,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:42:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1979108011, now seen corresponding path program 1 times [2023-11-29 03:42:05,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:42:05,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693178367] [2023-11-29 03:42:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:42:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:42:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693178367] [2023-11-29 03:42:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693178367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:42:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318460572] [2023-11-29 03:42:06,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:42:06,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:42:06,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:42:06,829 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:42:06,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:42:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:42:06,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 03:42:06,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:42:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:09,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:42:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318460572] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:42:14,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:42:14,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 22] total 62 [2023-11-29 03:42:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310880577] [2023-11-29 03:42:14,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:42:14,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-29 03:42:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:42:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 03:42:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=3395, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 03:42:14,187 INFO L87 Difference]: Start difference. First operand 12664 states and 14874 transitions. Second operand has 62 states, 62 states have (on average 2.8870967741935485) internal successors, (179), 62 states have internal predecessors, (179), 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 03:46:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:29,451 INFO L93 Difference]: Finished difference Result 33051 states and 38449 transitions. [2023-11-29 03:46:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 681 states. [2023-11-29 03:46:29,452 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.8870967741935485) internal successors, (179), 62 states have internal predecessors, (179), 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) Word has length 64 [2023-11-29 03:46:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:29,476 INFO L225 Difference]: With dead ends: 33051 [2023-11-29 03:46:29,476 INFO L226 Difference]: Without dead ends: 30117 [2023-11-29 03:46:29,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 739 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256161 ImplicationChecksByTransitivity, 247.2s TimeCoverageRelationStatistics Valid=58900, Invalid=489440, Unknown=0, NotChecked=0, Total=548340 [2023-11-29 03:46:29,527 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 9424 mSDsluCounter, 5157 mSDsCounter, 0 mSdLazyCounter, 5347 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9424 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 5950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 5347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:29,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9424 Valid, 5269 Invalid, 5950 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [603 Valid, 5347 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 03:46:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30117 states. [2023-11-29 03:46:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30117 to 13569. [2023-11-29 03:46:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13569 states, 13568 states have (on average 1.1797612028301887) internal successors, (16007), 13568 states have internal predecessors, (16007), 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 03:46:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13569 states to 13569 states and 16007 transitions. [2023-11-29 03:46:30,304 INFO L78 Accepts]: Start accepts. Automaton has 13569 states and 16007 transitions. Word has length 64 [2023-11-29 03:46:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:30,305 INFO L495 AbstractCegarLoop]: Abstraction has 13569 states and 16007 transitions. [2023-11-29 03:46:30,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.8870967741935485) internal successors, (179), 62 states have internal predecessors, (179), 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 03:46:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13569 states and 16007 transitions. [2023-11-29 03:46:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 03:46:30,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:30,306 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:46:30,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:46:30,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 03:46:30,507 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:30,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1627846434, now seen corresponding path program 1 times [2023-11-29 03:46:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897411354] [2023-11-29 03:46:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897411354] [2023-11-29 03:46:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897411354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:46:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820060910] [2023-11-29 03:46:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:46:30,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:46:30,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:46:30,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:46:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:30,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:46:30,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:30,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820060910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:31,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:46:31,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-29 03:46:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580520152] [2023-11-29 03:46:31,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:31,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:46:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:46:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:46:31,011 INFO L87 Difference]: Start difference. First operand 13569 states and 16007 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 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 03:46:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:32,067 INFO L93 Difference]: Finished difference Result 16388 states and 19341 transitions. [2023-11-29 03:46:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:46:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 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) Word has length 64 [2023-11-29 03:46:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:32,078 INFO L225 Difference]: With dead ends: 16388 [2023-11-29 03:46:32,078 INFO L226 Difference]: Without dead ends: 14077 [2023-11-29 03:46:32,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:46:32,081 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 315 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:32,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 232 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:46:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14077 states. [2023-11-29 03:46:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14077 to 13491. [2023-11-29 03:46:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13490 states have (on average 1.1758339510748703) internal successors, (15862), 13490 states have internal predecessors, (15862), 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 03:46:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 15862 transitions. [2023-11-29 03:46:32,949 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 15862 transitions. Word has length 64 [2023-11-29 03:46:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:32,949 INFO L495 AbstractCegarLoop]: Abstraction has 13491 states and 15862 transitions. [2023-11-29 03:46:32,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 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 03:46:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 15862 transitions. [2023-11-29 03:46:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:46:32,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:32,955 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:32,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:46:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 03:46:33,155 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:33,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 693943433, now seen corresponding path program 1 times [2023-11-29 03:46:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606319107] [2023-11-29 03:46:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:34,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:34,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606319107] [2023-11-29 03:46:34,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606319107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:46:34,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967969649] [2023-11-29 03:46:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:46:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:46:34,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:46:34,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:46:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:34,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:46:34,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:35,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967969649] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:38,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:46:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 41 [2023-11-29 03:46:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266157026] [2023-11-29 03:46:38,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:38,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 03:46:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 03:46:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 03:46:38,478 INFO L87 Difference]: Start difference. First operand 13491 states and 15862 transitions. Second operand has 41 states, 41 states have (on average 7.024390243902439) internal successors, (288), 41 states have internal predecessors, (288), 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 03:46:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:55,531 INFO L93 Difference]: Finished difference Result 25714 states and 30212 transitions. [2023-11-29 03:46:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-11-29 03:46:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.024390243902439) internal successors, (288), 41 states have internal predecessors, (288), 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) Word has length 103 [2023-11-29 03:46:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:55,547 INFO L225 Difference]: With dead ends: 25714 [2023-11-29 03:46:55,547 INFO L226 Difference]: Without dead ends: 22360 [2023-11-29 03:46:55,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6509 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2966, Invalid=17056, Unknown=0, NotChecked=0, Total=20022 [2023-11-29 03:46:55,552 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 2383 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:55,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 2796 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 03:46:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22360 states. [2023-11-29 03:46:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22360 to 14299. [2023-11-29 03:46:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14299 states, 14298 states have (on average 1.1748496293187858) internal successors, (16798), 14298 states have internal predecessors, (16798), 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 03:46:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 16798 transitions. [2023-11-29 03:46:56,582 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 16798 transitions. Word has length 103 [2023-11-29 03:46:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:56,582 INFO L495 AbstractCegarLoop]: Abstraction has 14299 states and 16798 transitions. [2023-11-29 03:46:56,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.024390243902439) internal successors, (288), 41 states have internal predecessors, (288), 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 03:46:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 16798 transitions. [2023-11-29 03:46:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:46:56,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:56,586 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:56,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:46:56,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:46:56,786 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:56,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash 990578661, now seen corresponding path program 1 times [2023-11-29 03:46:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845807555] [2023-11-29 03:46:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845807555] [2023-11-29 03:46:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845807555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:46:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380113755] [2023-11-29 03:46:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:57,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:46:57,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:46:57,756 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:46:57,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:46:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:57,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:46:57,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:58,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:47:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 34 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380113755] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:47:01,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:47:01,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 37 [2023-11-29 03:47:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254600888] [2023-11-29 03:47:01,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:47:01,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 03:47:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:47:01,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 03:47:01,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 03:47:01,788 INFO L87 Difference]: Start difference. First operand 14299 states and 16798 transitions. Second operand has 37 states, 37 states have (on average 7.756756756756757) internal successors, (287), 37 states have internal predecessors, (287), 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 03:47:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:47:23,197 INFO L93 Difference]: Finished difference Result 30005 states and 35172 transitions. [2023-11-29 03:47:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2023-11-29 03:47:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.756756756756757) internal successors, (287), 37 states have internal predecessors, (287), 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) Word has length 103 [2023-11-29 03:47:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:47:23,217 INFO L225 Difference]: With dead ends: 30005 [2023-11-29 03:47:23,218 INFO L226 Difference]: Without dead ends: 22406 [2023-11-29 03:47:23,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9464 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=5251, Invalid=24161, Unknown=0, NotChecked=0, Total=29412 [2023-11-29 03:47:23,225 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 2353 mSDsluCounter, 3304 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 3505 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:47:23,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 3505 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 03:47:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22406 states. [2023-11-29 03:47:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22406 to 13589. [2023-11-29 03:47:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13589 states, 13588 states have (on average 1.163085075066235) internal successors, (15804), 13588 states have internal predecessors, (15804), 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 03:47:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13589 states to 13589 states and 15804 transitions. [2023-11-29 03:47:24,449 INFO L78 Accepts]: Start accepts. Automaton has 13589 states and 15804 transitions. Word has length 103 [2023-11-29 03:47:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:47:24,450 INFO L495 AbstractCegarLoop]: Abstraction has 13589 states and 15804 transitions. [2023-11-29 03:47:24,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.756756756756757) internal successors, (287), 37 states have internal predecessors, (287), 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 03:47:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13589 states and 15804 transitions. [2023-11-29 03:47:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 03:47:24,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:47:24,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:47:24,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:47:24,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:47:24,655 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:47:24,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:47:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2111316196, now seen corresponding path program 1 times [2023-11-29 03:47:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:47:24,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558673657] [2023-11-29 03:47:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:47:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:47:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:47:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:47:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558673657] [2023-11-29 03:47:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558673657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:47:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957154802] [2023-11-29 03:47:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:47:26,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:47:26,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:47:26,869 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:47:26,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:47:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:47:26,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:47:26,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:47:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:28,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:47:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957154802] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:47:31,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:47:31,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 43 [2023-11-29 03:47:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608921076] [2023-11-29 03:47:31,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:47:31,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 03:47:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:47:31,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 03:47:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1651, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 03:47:31,032 INFO L87 Difference]: Start difference. First operand 13589 states and 15804 transitions. Second operand has 43 states, 43 states have (on average 6.465116279069767) internal successors, (278), 43 states have internal predecessors, (278), 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 03:48:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:08,895 INFO L93 Difference]: Finished difference Result 36394 states and 42040 transitions. [2023-11-29 03:48:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2023-11-29 03:48:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.465116279069767) internal successors, (278), 43 states have internal predecessors, (278), 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) Word has length 104 [2023-11-29 03:48:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:08,920 INFO L225 Difference]: With dead ends: 36394 [2023-11-29 03:48:08,920 INFO L226 Difference]: Without dead ends: 29986 [2023-11-29 03:48:08,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26900 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=10881, Invalid=54911, Unknown=0, NotChecked=0, Total=65792 [2023-11-29 03:48:08,929 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 4963 mSDsluCounter, 5493 mSDsCounter, 0 mSdLazyCounter, 4889 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4963 SdHoareTripleChecker+Valid, 5658 SdHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:08,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4963 Valid, 5658 Invalid, 5134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4889 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 03:48:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29986 states. [2023-11-29 03:48:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29986 to 17254. [2023-11-29 03:48:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17254 states, 17253 states have (on average 1.1637976004173187) internal successors, (20079), 17253 states have internal predecessors, (20079), 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 03:48:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 20079 transitions. [2023-11-29 03:48:10,466 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 20079 transitions. Word has length 104 [2023-11-29 03:48:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:10,467 INFO L495 AbstractCegarLoop]: Abstraction has 17254 states and 20079 transitions. [2023-11-29 03:48:10,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.465116279069767) internal successors, (278), 43 states have internal predecessors, (278), 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 03:48:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 20079 transitions. [2023-11-29 03:48:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 03:48:10,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:10,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:10,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 03:48:10,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:48:10,671 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:10,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -602031832, now seen corresponding path program 1 times [2023-11-29 03:48:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430736226] [2023-11-29 03:48:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430736226] [2023-11-29 03:48:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430736226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:48:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873230781] [2023-11-29 03:48:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:12,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:48:12,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:48:12,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:48:12,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:48:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:12,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:48:12,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:48:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:13,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:48:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873230781] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:48:15,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:48:15,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 14] total 42 [2023-11-29 03:48:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989098723] [2023-11-29 03:48:15,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:48:15,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 03:48:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 03:48:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1575, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 03:48:15,584 INFO L87 Difference]: Start difference. First operand 17254 states and 20079 transitions. Second operand has 42 states, 42 states have (on average 7.0) internal successors, (294), 42 states have internal predecessors, (294), 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 03:49:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:49:05,780 INFO L93 Difference]: Finished difference Result 49134 states and 57253 transitions. [2023-11-29 03:49:05,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 328 states. [2023-11-29 03:49:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.0) internal successors, (294), 42 states have internal predecessors, (294), 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) Word has length 104 [2023-11-29 03:49:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:49:05,817 INFO L225 Difference]: With dead ends: 49134 [2023-11-29 03:49:05,817 INFO L226 Difference]: Without dead ends: 40517 [2023-11-29 03:49:05,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55050 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=16420, Invalid=116440, Unknown=0, NotChecked=0, Total=132860 [2023-11-29 03:49:05,830 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 4319 mSDsluCounter, 7388 mSDsCounter, 0 mSdLazyCounter, 7884 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 7683 SdHoareTripleChecker+Invalid, 8089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 7884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:49:05,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 7683 Invalid, 8089 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [205 Valid, 7884 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-29 03:49:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40517 states. [2023-11-29 03:49:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40517 to 21087. [2023-11-29 03:49:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21087 states, 21086 states have (on average 1.1625723228682538) internal successors, (24514), 21086 states have internal predecessors, (24514), 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 03:49:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21087 states to 21087 states and 24514 transitions. [2023-11-29 03:49:08,488 INFO L78 Accepts]: Start accepts. Automaton has 21087 states and 24514 transitions. Word has length 104 [2023-11-29 03:49:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:49:08,488 INFO L495 AbstractCegarLoop]: Abstraction has 21087 states and 24514 transitions. [2023-11-29 03:49:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.0) internal successors, (294), 42 states have internal predecessors, (294), 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 03:49:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21087 states and 24514 transitions. [2023-11-29 03:49:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:49:08,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:49:08,492 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 03:49:08,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 03:49:08,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:49:08,693 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:49:08,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:49:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1410913789, now seen corresponding path program 1 times [2023-11-29 03:49:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:49:08,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730899600] [2023-11-29 03:49:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:49:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:49:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:49:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730899600] [2023-11-29 03:49:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730899600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:49:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819199912] [2023-11-29 03:49:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:11,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:49:11,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:49:11,381 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:49:11,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:49:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:11,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:49:11,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:49:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 03:49:12,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:49:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 03:49:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819199912] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:49:14,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:49:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 14] total 44 [2023-11-29 03:49:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767461525] [2023-11-29 03:49:14,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:49:14,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 03:49:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:49:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 03:49:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1796, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 03:49:14,193 INFO L87 Difference]: Start difference. First operand 21087 states and 24514 transitions. Second operand has 45 states, 45 states have (on average 5.8) internal successors, (261), 44 states have internal predecessors, (261), 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 03:50:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:06,320 INFO L93 Difference]: Finished difference Result 45137 states and 51996 transitions. [2023-11-29 03:50:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2023-11-29 03:50:06,321 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.8) internal successors, (261), 44 states have internal predecessors, (261), 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) Word has length 105 [2023-11-29 03:50:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:06,353 INFO L225 Difference]: With dead ends: 45137 [2023-11-29 03:50:06,353 INFO L226 Difference]: Without dead ends: 33424 [2023-11-29 03:50:06,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37679 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=13641, Invalid=76059, Unknown=0, NotChecked=0, Total=89700 [2023-11-29 03:50:06,364 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 4963 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 3417 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4963 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 3417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:06,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4963 Valid, 3343 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 3417 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 03:50:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33424 states. [2023-11-29 03:50:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33424 to 20220. [2023-11-29 03:50:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20220 states, 20219 states have (on average 1.1626687768930215) internal successors, (23508), 20219 states have internal predecessors, (23508), 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 03:50:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20220 states to 20220 states and 23508 transitions. [2023-11-29 03:50:09,113 INFO L78 Accepts]: Start accepts. Automaton has 20220 states and 23508 transitions. Word has length 105 [2023-11-29 03:50:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:09,113 INFO L495 AbstractCegarLoop]: Abstraction has 20220 states and 23508 transitions. [2023-11-29 03:50:09,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.8) internal successors, (261), 44 states have internal predecessors, (261), 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 03:50:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 20220 states and 23508 transitions. [2023-11-29 03:50:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:50:09,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:09,117 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:50:09,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 03:50:09,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:09,318 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:09,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash 403842068, now seen corresponding path program 1 times [2023-11-29 03:50:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419494971] [2023-11-29 03:50:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:50:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419494971] [2023-11-29 03:50:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419494971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749559820] [2023-11-29 03:50:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:09,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:09,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:09,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:09,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:50:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:10,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:50:10,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 20 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:11,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749559820] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:13,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2023-11-29 03:50:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756374906] [2023-11-29 03:50:13,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:13,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 03:50:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 03:50:13,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 03:50:13,342 INFO L87 Difference]: Start difference. First operand 20220 states and 23508 transitions. Second operand has 36 states, 36 states have (on average 7.888888888888889) internal successors, (284), 36 states have internal predecessors, (284), 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 03:50:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:24,651 INFO L93 Difference]: Finished difference Result 39201 states and 45631 transitions. [2023-11-29 03:50:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-29 03:50:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.888888888888889) internal successors, (284), 36 states have internal predecessors, (284), 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) Word has length 105 [2023-11-29 03:50:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:24,680 INFO L225 Difference]: With dead ends: 39201 [2023-11-29 03:50:24,680 INFO L226 Difference]: Without dead ends: 30337 [2023-11-29 03:50:24,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3255 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2039, Invalid=8061, Unknown=0, NotChecked=0, Total=10100 [2023-11-29 03:50:24,688 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 2071 mSDsluCounter, 2261 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:24,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2071 Valid, 2354 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:50:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30337 states. [2023-11-29 03:50:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30337 to 23997. [2023-11-29 03:50:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23997 states, 23996 states have (on average 1.1649858309718286) internal successors, (27955), 23996 states have internal predecessors, (27955), 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 03:50:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23997 states to 23997 states and 27955 transitions. [2023-11-29 03:50:28,079 INFO L78 Accepts]: Start accepts. Automaton has 23997 states and 27955 transitions. Word has length 105 [2023-11-29 03:50:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:28,080 INFO L495 AbstractCegarLoop]: Abstraction has 23997 states and 27955 transitions. [2023-11-29 03:50:28,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.888888888888889) internal successors, (284), 36 states have internal predecessors, (284), 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 03:50:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 23997 states and 27955 transitions. [2023-11-29 03:50:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:50:28,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:28,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 03:50:28,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 03:50:28,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:28,284 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:28,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -999938604, now seen corresponding path program 1 times [2023-11-29 03:50:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659125296] [2023-11-29 03:50:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 03:50:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:29,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659125296] [2023-11-29 03:50:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659125296] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604790471] [2023-11-29 03:50:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:29,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:29,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:29,016 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:29,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 03:50:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:50:29,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:50:30,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 30 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:50:33,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604790471] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:33,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:33,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 34 [2023-11-29 03:50:33,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042080551] [2023-11-29 03:50:33,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:33,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 03:50:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 03:50:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 03:50:33,803 INFO L87 Difference]: Start difference. First operand 23997 states and 27955 transitions. Second operand has 35 states, 35 states have (on average 7.571428571428571) internal successors, (265), 34 states have internal predecessors, (265), 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 03:50:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:39,327 INFO L93 Difference]: Finished difference Result 34929 states and 40551 transitions. [2023-11-29 03:50:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:50:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.571428571428571) internal successors, (265), 34 states have internal predecessors, (265), 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) Word has length 105 [2023-11-29 03:50:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:39,353 INFO L225 Difference]: With dead ends: 34929 [2023-11-29 03:50:39,353 INFO L226 Difference]: Without dead ends: 28135 [2023-11-29 03:50:39,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=688, Invalid=2618, Unknown=0, NotChecked=0, Total=3306 [2023-11-29 03:50:39,360 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 623 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:39,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1793 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:50:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28135 states. [2023-11-29 03:50:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28135 to 23517. [2023-11-29 03:50:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23517 states, 23516 states have (on average 1.164781425412485) internal successors, (27391), 23516 states have internal predecessors, (27391), 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 03:50:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23517 states to 23517 states and 27391 transitions. [2023-11-29 03:50:42,678 INFO L78 Accepts]: Start accepts. Automaton has 23517 states and 27391 transitions. Word has length 105 [2023-11-29 03:50:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:42,679 INFO L495 AbstractCegarLoop]: Abstraction has 23517 states and 27391 transitions. [2023-11-29 03:50:42,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.571428571428571) internal successors, (265), 34 states have internal predecessors, (265), 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 03:50:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 23517 states and 27391 transitions. [2023-11-29 03:50:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:50:42,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:42,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 03:50:42,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 03:50:42,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 03:50:42,883 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:42,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1451847561, now seen corresponding path program 1 times [2023-11-29 03:50:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:42,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136286908] [2023-11-29 03:50:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136286908] [2023-11-29 03:50:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136286908] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218183985] [2023-11-29 03:50:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:44,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:44,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:44,737 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:44,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 03:50:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:44,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:50:44,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:46,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218183985] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:52,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 17] total 54 [2023-11-29 03:50:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393632673] [2023-11-29 03:50:52,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:52,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 03:50:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:52,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 03:50:52,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2654, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 03:50:52,550 INFO L87 Difference]: Start difference. First operand 23517 states and 27391 transitions. Second operand has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 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 03:53:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:29,191 INFO L93 Difference]: Finished difference Result 57582 states and 67076 transitions. [2023-11-29 03:53:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 437 states. [2023-11-29 03:53:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 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) Word has length 107 [2023-11-29 03:53:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:29,225 INFO L225 Difference]: With dead ends: 57582 [2023-11-29 03:53:29,225 INFO L226 Difference]: Without dead ends: 45425 [2023-11-29 03:53:29,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99993 ImplicationChecksByTransitivity, 143.9s TimeCoverageRelationStatistics Valid=24582, Invalid=214050, Unknown=0, NotChecked=0, Total=238632 [2023-11-29 03:53:29,241 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 6156 mSDsluCounter, 7399 mSDsCounter, 0 mSdLazyCounter, 7255 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6156 SdHoareTripleChecker+Valid, 7672 SdHoareTripleChecker+Invalid, 7596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 7255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:29,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6156 Valid, 7672 Invalid, 7596 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [341 Valid, 7255 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-11-29 03:53:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45425 states. [2023-11-29 03:53:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45425 to 33402. [2023-11-29 03:53:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33402 states, 33401 states have (on average 1.165833358282686) internal successors, (38940), 33401 states have internal predecessors, (38940), 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 03:53:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33402 states to 33402 states and 38940 transitions. [2023-11-29 03:53:33,653 INFO L78 Accepts]: Start accepts. Automaton has 33402 states and 38940 transitions. Word has length 107 [2023-11-29 03:53:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:33,654 INFO L495 AbstractCegarLoop]: Abstraction has 33402 states and 38940 transitions. [2023-11-29 03:53:33,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 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 03:53:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33402 states and 38940 transitions. [2023-11-29 03:53:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 03:53:33,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:33,659 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:53:33,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:33,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:33,860 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:33,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash -365335861, now seen corresponding path program 1 times [2023-11-29 03:53:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256464808] [2023-11-29 03:53:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 131 proven. 50 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 03:53:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256464808] [2023-11-29 03:53:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256464808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017321244] [2023-11-29 03:53:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:34,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:34,674 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:34,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 03:53:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:53:34,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 03:53:36,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 03:53:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017321244] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:53:37,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:53:37,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2023-11-29 03:53:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900553585] [2023-11-29 03:53:37,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:53:37,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 03:53:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:37,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 03:53:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2023-11-29 03:53:37,985 INFO L87 Difference]: Start difference. First operand 33402 states and 38940 transitions. Second operand has 29 states, 29 states have (on average 8.586206896551724) internal successors, (249), 29 states have internal predecessors, (249), 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 03:53:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:49,116 INFO L93 Difference]: Finished difference Result 74822 states and 87420 transitions. [2023-11-29 03:53:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-29 03:53:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.586206896551724) internal successors, (249), 29 states have internal predecessors, (249), 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) Word has length 136 [2023-11-29 03:53:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:49,156 INFO L225 Difference]: With dead ends: 74822 [2023-11-29 03:53:49,157 INFO L226 Difference]: Without dead ends: 47837 [2023-11-29 03:53:49,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1472, Invalid=6900, Unknown=0, NotChecked=0, Total=8372 [2023-11-29 03:53:49,167 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1848 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:49,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 1083 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:53:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47837 states. [2023-11-29 03:53:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47837 to 32959. [2023-11-29 03:53:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32959 states, 32958 states have (on average 1.1539535165968808) internal successors, (38032), 32958 states have internal predecessors, (38032), 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 03:53:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32959 states to 32959 states and 38032 transitions. [2023-11-29 03:53:53,923 INFO L78 Accepts]: Start accepts. Automaton has 32959 states and 38032 transitions. Word has length 136 [2023-11-29 03:53:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:53,923 INFO L495 AbstractCegarLoop]: Abstraction has 32959 states and 38032 transitions. [2023-11-29 03:53:53,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.586206896551724) internal successors, (249), 29 states have internal predecessors, (249), 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 03:53:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 32959 states and 38032 transitions. [2023-11-29 03:53:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 03:53:53,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:53,929 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 03:53:53,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 03:53:54,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:54,129 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:54,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1606776377, now seen corresponding path program 1 times [2023-11-29 03:53:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507083807] [2023-11-29 03:53:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 03:53:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507083807] [2023-11-29 03:53:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507083807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616327387] [2023-11-29 03:53:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:54,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:54,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 03:53:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 03:53:54,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 135 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 03:53:56,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 128 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:53:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616327387] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:53:57,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:53:57,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 18] total 37 [2023-11-29 03:53:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578121398] [2023-11-29 03:53:57,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:53:57,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 03:53:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:57,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 03:53:57,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 03:53:57,731 INFO L87 Difference]: Start difference. First operand 32959 states and 38032 transitions. Second operand has 38 states, 38 states have (on average 6.473684210526316) internal successors, (246), 37 states have internal predecessors, (246), 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 03:54:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:18,377 INFO L93 Difference]: Finished difference Result 84952 states and 98226 transitions. [2023-11-29 03:54:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-29 03:54:18,378 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.473684210526316) internal successors, (246), 37 states have internal predecessors, (246), 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) Word has length 136 [2023-11-29 03:54:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:54:18,446 INFO L225 Difference]: With dead ends: 84952 [2023-11-29 03:54:18,446 INFO L226 Difference]: Without dead ends: 80540 [2023-11-29 03:54:18,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6637 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3543, Invalid=14817, Unknown=0, NotChecked=0, Total=18360 [2023-11-29 03:54:18,458 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 4074 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 2949 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 3464 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:54:18,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 3464 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2949 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 03:54:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80540 states. [2023-11-29 03:54:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80540 to 34465. [2023-11-29 03:54:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 34464 states have (on average 1.1513463324048283) internal successors, (39680), 34464 states have internal predecessors, (39680), 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 03:54:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 39680 transitions. [2023-11-29 03:54:24,354 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 39680 transitions. Word has length 136 [2023-11-29 03:54:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:54:24,354 INFO L495 AbstractCegarLoop]: Abstraction has 34465 states and 39680 transitions. [2023-11-29 03:54:24,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.473684210526316) internal successors, (246), 37 states have internal predecessors, (246), 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 03:54:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 39680 transitions. [2023-11-29 03:54:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 03:54:24,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:54:24,360 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 03:54:24,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 03:54:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 03:54:24,561 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:54:24,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1209784893, now seen corresponding path program 1 times [2023-11-29 03:54:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908569611] [2023-11-29 03:54:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2023-11-29 03:54:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908569611] [2023-11-29 03:54:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908569611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:54:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:54:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:54:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845507608] [2023-11-29 03:54:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:54:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:54:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:24,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:54:24,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:54:24,677 INFO L87 Difference]: Start difference. First operand 34465 states and 39680 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 03:54:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:30,938 INFO L93 Difference]: Finished difference Result 34471 states and 39683 transitions. [2023-11-29 03:54:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:54:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) Word has length 136 [2023-11-29 03:54:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:54:30,969 INFO L225 Difference]: With dead ends: 34471 [2023-11-29 03:54:30,969 INFO L226 Difference]: Without dead ends: 33722 [2023-11-29 03:54:30,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:54:30,975 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:54:30,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 207 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:54:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33722 states. [2023-11-29 03:54:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33722 to 33718. [2023-11-29 03:54:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33718 states, 33717 states have (on average 1.1523563780882047) internal successors, (38854), 33717 states have internal predecessors, (38854), 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 03:54:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33718 states to 33718 states and 38854 transitions. [2023-11-29 03:54:36,955 INFO L78 Accepts]: Start accepts. Automaton has 33718 states and 38854 transitions. Word has length 136 [2023-11-29 03:54:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:54:36,956 INFO L495 AbstractCegarLoop]: Abstraction has 33718 states and 38854 transitions. [2023-11-29 03:54:36,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 03:54:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33718 states and 38854 transitions. [2023-11-29 03:54:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 03:54:36,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:54:36,964 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 03:54:36,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 03:54:36,964 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:54:36,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -206448956, now seen corresponding path program 1 times [2023-11-29 03:54:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706318968] [2023-11-29 03:54:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:37,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:37,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:37,086 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:54:37,087 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:54:37,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 03:54:37,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:37,096 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:54:37,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:54:37 BoogieIcfgContainer [2023-11-29 03:54:37,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:54:37,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:54:37,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:54:37,256 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:54:37,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:41:39" (3/4) ... [2023-11-29 03:54:37,258 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 03:54:37,407 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:54:37,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:54:37,408 INFO L158 Benchmark]: Toolchain (without parser) took 779126.48ms. Allocated memory was 165.7MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 128.0MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-29 03:54:37,408 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:54:37,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.41ms. Allocated memory is still 165.7MB. Free memory was 128.0MB in the beginning and 113.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 03:54:37,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.18ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:54:37,409 INFO L158 Benchmark]: Boogie Preprocessor took 49.03ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 109.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:54:37,410 INFO L158 Benchmark]: RCFGBuilder took 457.26ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 87.3MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 03:54:37,410 INFO L158 Benchmark]: TraceAbstraction took 778144.44ms. Allocated memory was 165.7MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 86.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-29 03:54:37,410 INFO L158 Benchmark]: Witness Printer took 151.21ms. Allocated memory is still 3.4GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:54:37,412 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.13ms. Allocated memory is still 109.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.41ms. Allocated memory is still 165.7MB. Free memory was 128.0MB in the beginning and 113.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.18ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.03ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 109.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.26ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 87.3MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 778144.44ms. Allocated memory was 165.7MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 86.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 151.21ms. Allocated memory is still 3.4GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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 - CounterExampleResult [Line: 306]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; [L250] int c1 ; [L251] int i2 ; [L254] c1 = 0 [L255] r1 = __VERIFIER_nondet_char() [L256] id1 = __VERIFIER_nondet_char() [L257] st1 = __VERIFIER_nondet_char() [L258] send1 = __VERIFIER_nondet_char() [L259] mode1 = __VERIFIER_nondet_bool() [L260] alive1 = __VERIFIER_nondet_bool() [L261] id2 = __VERIFIER_nondet_char() [L262] st2 = __VERIFIER_nondet_char() [L263] send2 = __VERIFIER_nondet_char() [L264] mode2 = __VERIFIER_nondet_bool() [L265] alive2 = __VERIFIER_nondet_bool() [L266] id3 = __VERIFIER_nondet_char() [L267] st3 = __VERIFIER_nondet_char() [L268] send3 = __VERIFIER_nondet_char() [L269] mode3 = __VERIFIER_nondet_bool() [L270] alive3 = __VERIFIER_nondet_bool() [L271] CALL, EXPR init() [L153] int tmp ; VAL [id1=0, id2=1, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L156] COND TRUE (int )r1 == 0 VAL [id1=0, id2=1, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L157] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L158] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L159] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L160] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L161] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L162] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L163] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L164] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L165] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L166] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L167] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L168] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L169] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L170] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L171] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id2 != (int )id3 [L173] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=1] [L225] return (tmp); [L271] RET, EXPR init() [L271] i2 = init() [L272] COND FALSE !(!(i2)) VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L273] p1_old = nomsg [L274] p1_new = nomsg [L275] p2_old = nomsg [L276] p2_new = nomsg [L277] p3_old = nomsg [L278] p3_new = nomsg [L279] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=0, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=4, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=2, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=3, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=4, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=5, id1=0, id2=1, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m1=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L234] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L237] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L240] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0, tmp=0] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND TRUE ! arg VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] [L306] reach_error() VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=1, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=1, send3=4, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 777.9s, OverallIterations: 39, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 655.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48458 SdHoareTripleChecker+Valid, 46.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48458 mSDsluCounter, 52147 SdHoareTripleChecker+Invalid, 41.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47881 mSDsCounter, 2328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45606 IncrementalHoareTripleChecker+Invalid, 47934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2328 mSolverCounterUnsat, 4266 mSDtfsCounter, 45606 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5969 GetRequests, 2889 SyntacticMatches, 19 SemanticMatches, 3061 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506237 ImplicationChecksByTransitivity, 563.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34465occurred in iteration=37, InterpolantAutomatonStates: 2613, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 180878 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 70.5s InterpolantComputationTime, 4481 NumberOfCodeBlocks, 4481 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 5878 ConstructedInterpolants, 0 QuantifiedInterpolants, 98761 SizeOfPredicates, 106 NumberOfNonLiveVariables, 5954 ConjunctsInSsa, 367 ConjunctsInUnsatCore, 74 InterpolantComputations, 20 PerfectInterpolantSequences, 2350/3872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 03:54:37,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61df6d9e-31f5-4356-967b-e718172f8969/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE