./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1 --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 12e64e5880a6492945a65c8a75846fcd1e471751df63fa7462470a498bbbc9fb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-01 23:15:46,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-01 23:15:46,730 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-01 23:15:46,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-01 23:15:46,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-01 23:15:46,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-01 23:15:46,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-01 23:15:46,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-01 23:15:46,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-01 23:15:46,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-01 23:15:46,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-01 23:15:46,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-01 23:15:46,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * Use SBE=true [2024-12-01 23:15:46,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-01 23:15:46,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-01 23:15:46,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:15:46,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:15:46,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:15:46,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-01 23:15:46,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-01 23:15:46,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1 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 -> 12e64e5880a6492945a65c8a75846fcd1e471751df63fa7462470a498bbbc9fb [2024-12-01 23:15:46,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-01 23:15:46,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-01 23:15:46,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-01 23:15:46,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-01 23:15:46,979 INFO L274 PluginConnector]: CDTParser initialized [2024-12-01 23:15:46,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-12-01 23:15:49,602 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/data/9b7e79e96/eabad2440b1f4bfebc1fb771c91f485c/FLAGf238df74b [2024-12-01 23:15:50,062 INFO L384 CDTParser]: Found 1 translation units. [2024-12-01 23:15:50,063 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-12-01 23:15:50,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/data/9b7e79e96/eabad2440b1f4bfebc1fb771c91f485c/FLAGf238df74b [2024-12-01 23:15:50,114 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/data/9b7e79e96/eabad2440b1f4bfebc1fb771c91f485c [2024-12-01 23:15:50,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-01 23:15:50,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-01 23:15:50,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-01 23:15:50,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-01 23:15:50,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-01 23:15:50,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:15:50" (1/1) ... [2024-12-01 23:15:50,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ea0c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:50, skipping insertion in model container [2024-12-01 23:15:50,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:15:50" (1/1) ... [2024-12-01 23:15:50,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-01 23:15:50,471 WARN L250 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_7ce974d8-2106-4218-9d83-9eff39e75df9/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c[6487,6500] [2024-12-01 23:15:50,528 WARN L250 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_7ce974d8-2106-4218-9d83-9eff39e75df9/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c[13548,13561] [2024-12-01 23:15:51,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:15:51,128 INFO L200 MainTranslator]: Completed pre-run [2024-12-01 23:15:51,152 WARN L250 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_7ce974d8-2106-4218-9d83-9eff39e75df9/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c[6487,6500] [2024-12-01 23:15:51,162 WARN L250 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_7ce974d8-2106-4218-9d83-9eff39e75df9/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c[13548,13561] [2024-12-01 23:15:51,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:15:51,591 INFO L204 MainTranslator]: Completed translation [2024-12-01 23:15:51,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51 WrapperNode [2024-12-01 23:15:51,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-01 23:15:51,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-01 23:15:51,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-01 23:15:51,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-01 23:15:51,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:51,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:51,921 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4982 [2024-12-01 23:15:51,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-01 23:15:51,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-01 23:15:51,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-01 23:15:51,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-01 23:15:51,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:51,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:51,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,124 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]. [2024-12-01 23:15:52,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-01 23:15:52,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-01 23:15:52,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-01 23:15:52,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-01 23:15:52,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (1/1) ... [2024-12-01 23:15:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:15:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:15:52,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-01 23:15:52,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-01 23:15:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-01 23:15:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-01 23:15:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-01 23:15:52,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-01 23:15:52,497 INFO L234 CfgBuilder]: Building ICFG [2024-12-01 23:15:52,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-01 23:15:56,932 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-12-01 23:15:56,932 INFO L283 CfgBuilder]: Performing block encoding [2024-12-01 23:15:56,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-01 23:15:56,957 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-01 23:15:56,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:15:56 BoogieIcfgContainer [2024-12-01 23:15:56,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-01 23:15:56,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-01 23:15:56,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-01 23:15:56,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-01 23:15:56,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 11:15:50" (1/3) ... [2024-12-01 23:15:56,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be47090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:15:56, skipping insertion in model container [2024-12-01 23:15:56,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:15:51" (2/3) ... [2024-12-01 23:15:56,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be47090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:15:56, skipping insertion in model container [2024-12-01 23:15:56,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:15:56" (3/3) ... [2024-12-01 23:15:56,967 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-12-01 23:15:56,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-01 23:15:56,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 874 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-12-01 23:15:57,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 23:15:57,075 INFO L333 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, 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;@2cf6f2ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 23:15:57,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-01 23:15:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 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) [2024-12-01 23:15:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-01 23:15:57,089 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:57,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:15:57,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:57,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash -934405548, now seen corresponding path program 1 times [2024-12-01 23:15:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912492154] [2024-12-01 23:15:57,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912492154] [2024-12-01 23:15:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912492154] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:57,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:15:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567146826] [2024-12-01 23:15:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 23:15:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:57,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 23:15:57,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:15:57,319 INFO L87 Difference]: Start difference. First operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-12-01 23:15:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:57,381 INFO L93 Difference]: Finished difference Result 1724 states and 3278 transitions. [2024-12-01 23:15:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 23:15:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2024-12-01 23:15:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:57,394 INFO L225 Difference]: With dead ends: 1724 [2024-12-01 23:15:57,394 INFO L226 Difference]: Without dead ends: 808 [2024-12-01 23:15:57,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:15:57,401 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:57,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-12-01 23:15:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-12-01 23:15:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 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) [2024-12-01 23:15:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2024-12-01 23:15:57,463 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2024-12-01 23:15:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2024-12-01 23:15:57,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-12-01 23:15:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2024-12-01 23:15:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-01 23:15:57,465 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:57,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:15:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-01 23:15:57,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:57,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1945522798, now seen corresponding path program 1 times [2024-12-01 23:15:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318097498] [2024-12-01 23:15:57,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318097498] [2024-12-01 23:15:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318097498] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:15:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871212108] [2024-12-01 23:15:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:15:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:15:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:15:57,644 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-12-01 23:15:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:57,716 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2024-12-01 23:15:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:15:57,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-12-01 23:15:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:57,721 INFO L225 Difference]: With dead ends: 844 [2024-12-01 23:15:57,721 INFO L226 Difference]: Without dead ends: 808 [2024-12-01 23:15:57,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:15:57,722 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:57,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-12-01 23:15:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-12-01 23:15:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 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) [2024-12-01 23:15:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2024-12-01 23:15:57,764 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2024-12-01 23:15:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2024-12-01 23:15:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-12-01 23:15:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2024-12-01 23:15:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-01 23:15:57,765 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:57,766 INFO L218 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] [2024-12-01 23:15:57,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-01 23:15:57,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:57,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1226597962, now seen corresponding path program 1 times [2024-12-01 23:15:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749079165] [2024-12-01 23:15:57,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:57,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749079165] [2024-12-01 23:15:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749079165] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:57,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:57,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:15:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592688355] [2024-12-01 23:15:57,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:15:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:57,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:15:57,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:15:57,894 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-12-01 23:15:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:58,003 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2024-12-01 23:15:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-01 23:15:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-12-01 23:15:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:58,007 INFO L225 Difference]: With dead ends: 1000 [2024-12-01 23:15:58,007 INFO L226 Difference]: Without dead ends: 968 [2024-12-01 23:15:58,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-12-01 23:15:58,009 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4682 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:58,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 1758 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:15:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-12-01 23:15:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2024-12-01 23:15:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 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) [2024-12-01 23:15:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2024-12-01 23:15:58,026 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2024-12-01 23:15:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:58,026 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2024-12-01 23:15:58,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-12-01 23:15:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2024-12-01 23:15:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-01 23:15:58,028 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:58,028 INFO L218 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] [2024-12-01 23:15:58,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-01 23:15:58,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 523901274, now seen corresponding path program 1 times [2024-12-01 23:15:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709665058] [2024-12-01 23:15:58,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709665058] [2024-12-01 23:15:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709665058] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:58,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:58,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:15:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486907215] [2024-12-01 23:15:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:58,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:15:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:58,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:15:58,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:15:58,107 INFO L87 Difference]: Start difference. First operand 838 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-12-01 23:15:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:58,139 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2024-12-01 23:15:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:15:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-12-01 23:15:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:58,143 INFO L225 Difference]: With dead ends: 951 [2024-12-01 23:15:58,143 INFO L226 Difference]: Without dead ends: 889 [2024-12-01 23:15:58,143 INFO L434 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 [2024-12-01 23:15:58,144 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:58,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-12-01 23:15:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2024-12-01 23:15:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8437146092865233) internal successors, (1628), 884 states have internal predecessors, (1628), 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) [2024-12-01 23:15:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1628 transitions. [2024-12-01 23:15:58,161 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1628 transitions. Word has length 37 [2024-12-01 23:15:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:58,161 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1628 transitions. [2024-12-01 23:15:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-12-01 23:15:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1628 transitions. [2024-12-01 23:15:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-01 23:15:58,162 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:58,162 INFO L218 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] [2024-12-01 23:15:58,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-01 23:15:58,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 590394786, now seen corresponding path program 1 times [2024-12-01 23:15:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534831454] [2024-12-01 23:15:58,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534831454] [2024-12-01 23:15:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534831454] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:15:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063006735] [2024-12-01 23:15:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:58,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:15:58,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:58,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:15:58,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:15:58,308 INFO L87 Difference]: Start difference. First operand 885 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-12-01 23:15:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:58,384 INFO L93 Difference]: Finished difference Result 996 states and 1796 transitions. [2024-12-01 23:15:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:15:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-12-01 23:15:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:58,389 INFO L225 Difference]: With dead ends: 996 [2024-12-01 23:15:58,389 INFO L226 Difference]: Without dead ends: 887 [2024-12-01 23:15:58,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:15:58,390 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 2952 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:58,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 1598 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-12-01 23:15:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2024-12-01 23:15:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 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) [2024-12-01 23:15:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2024-12-01 23:15:58,414 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2024-12-01 23:15:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:58,414 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2024-12-01 23:15:58,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-12-01 23:15:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2024-12-01 23:15:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-01 23:15:58,415 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:58,416 INFO L218 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] [2024-12-01 23:15:58,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-01 23:15:58,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:58,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash 707645968, now seen corresponding path program 1 times [2024-12-01 23:15:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620467676] [2024-12-01 23:15:58,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620467676] [2024-12-01 23:15:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620467676] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-01 23:15:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722269710] [2024-12-01 23:15:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:58,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-01 23:15:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:58,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-01 23:15:58,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-01 23:15:58,643 INFO L87 Difference]: Start difference. First operand 885 states and 1626 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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) [2024-12-01 23:15:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:58,723 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2024-12-01 23:15:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-01 23:15:58,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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 [2024-12-01 23:15:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:58,727 INFO L225 Difference]: With dead ends: 893 [2024-12-01 23:15:58,727 INFO L226 Difference]: Without dead ends: 891 [2024-12-01 23:15:58,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-01 23:15:58,729 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:58,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-12-01 23:15:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-12-01 23:15:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 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) [2024-12-01 23:15:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2024-12-01 23:15:58,751 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2024-12-01 23:15:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:58,751 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2024-12-01 23:15:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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) [2024-12-01 23:15:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2024-12-01 23:15:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-01 23:15:58,752 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:58,752 INFO L218 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] [2024-12-01 23:15:58,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-01 23:15:58,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:58,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1903217474, now seen corresponding path program 1 times [2024-12-01 23:15:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:58,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631370141] [2024-12-01 23:15:58,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:58,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631370141] [2024-12-01 23:15:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631370141] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:58,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:15:58,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942206637] [2024-12-01 23:15:58,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:58,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:15:58,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:58,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:15:58,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:15:58,803 INFO L87 Difference]: Start difference. First operand 891 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2024-12-01 23:15:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:58,831 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2024-12-01 23:15:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:15:58,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 [2024-12-01 23:15:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:58,835 INFO L225 Difference]: With dead ends: 1105 [2024-12-01 23:15:58,836 INFO L226 Difference]: Without dead ends: 990 [2024-12-01 23:15:58,836 INFO L434 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 [2024-12-01 23:15:58,837 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:58,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1587 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-12-01 23:15:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2024-12-01 23:15:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 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) [2024-12-01 23:15:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2024-12-01 23:15:58,863 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2024-12-01 23:15:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:58,864 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2024-12-01 23:15:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2024-12-01 23:15:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2024-12-01 23:15:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-01 23:15:58,865 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:58,865 INFO L218 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] [2024-12-01 23:15:58,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-01 23:15:58,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash 122284610, now seen corresponding path program 1 times [2024-12-01 23:15:58,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:58,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113492202] [2024-12-01 23:15:58,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:58,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:58,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113492202] [2024-12-01 23:15:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113492202] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:58,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:15:58,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180521757] [2024-12-01 23:15:58,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:58,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:15:58,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:58,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:15:58,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:15:58,915 INFO L87 Difference]: Start difference. First operand 988 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2024-12-01 23:15:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:58,942 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2024-12-01 23:15:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:15:58,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 [2024-12-01 23:15:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:58,947 INFO L225 Difference]: With dead ends: 1380 [2024-12-01 23:15:58,947 INFO L226 Difference]: Without dead ends: 1168 [2024-12-01 23:15:58,948 INFO L434 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 [2024-12-01 23:15:58,949 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:58,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-12-01 23:15:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2024-12-01 23:15:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 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) [2024-12-01 23:15:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2024-12-01 23:15:58,980 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2024-12-01 23:15:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:58,980 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2024-12-01 23:15:58,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2024-12-01 23:15:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2024-12-01 23:15:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-01 23:15:58,981 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:58,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:15:58,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-01 23:15:58,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1688735299, now seen corresponding path program 1 times [2024-12-01 23:15:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279737797] [2024-12-01 23:15:58,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279737797] [2024-12-01 23:15:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279737797] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:15:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819449304] [2024-12-01 23:15:59,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:15:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:59,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:15:59,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:15:59,031 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2024-12-01 23:15:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:59,064 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2024-12-01 23:15:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:15:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-12-01 23:15:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:59,070 INFO L225 Difference]: With dead ends: 1589 [2024-12-01 23:15:59,070 INFO L226 Difference]: Without dead ends: 1354 [2024-12-01 23:15:59,071 INFO L434 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 [2024-12-01 23:15:59,071 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:59,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-12-01 23:15:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2024-12-01 23:15:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 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) [2024-12-01 23:15:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2024-12-01 23:15:59,108 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2024-12-01 23:15:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:59,109 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2024-12-01 23:15:59,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2024-12-01 23:15:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2024-12-01 23:15:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-01 23:15:59,110 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:59,110 INFO L218 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] [2024-12-01 23:15:59,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-01 23:15:59,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash 923003988, now seen corresponding path program 1 times [2024-12-01 23:15:59,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518430888] [2024-12-01 23:15:59,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-01 23:15:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518430888] [2024-12-01 23:15:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518430888] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:59,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:15:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512749497] [2024-12-01 23:15:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:15:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:59,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:15:59,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:15:59,249 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-12-01 23:15:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:59,354 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2024-12-01 23:15:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:15:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 54 [2024-12-01 23:15:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:59,363 INFO L225 Difference]: With dead ends: 3208 [2024-12-01 23:15:59,364 INFO L226 Difference]: Without dead ends: 2634 [2024-12-01 23:15:59,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-01 23:15:59,366 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 3057 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3057 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:59,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3057 Valid, 3155 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-12-01 23:15:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2024-12-01 23:15:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.5879292403746097) internal successors, (3052), 1923 states have internal predecessors, (3052), 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) [2024-12-01 23:15:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2024-12-01 23:15:59,427 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2024-12-01 23:15:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:59,427 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2024-12-01 23:15:59,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-12-01 23:15:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2024-12-01 23:15:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-01 23:15:59,428 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:59,428 INFO L218 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] [2024-12-01 23:15:59,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-01 23:15:59,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:59,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash -857928876, now seen corresponding path program 1 times [2024-12-01 23:15:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:59,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862053942] [2024-12-01 23:15:59,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-01 23:15:59,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862053942] [2024-12-01 23:15:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862053942] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:15:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166144040] [2024-12-01 23:15:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:59,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:15:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:59,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:15:59,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:15:59,541 INFO L87 Difference]: Start difference. First operand 1924 states and 3052 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2024-12-01 23:15:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:59,656 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2024-12-01 23:15:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:15:59,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 54 [2024-12-01 23:15:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:59,667 INFO L225 Difference]: With dead ends: 3780 [2024-12-01 23:15:59,667 INFO L226 Difference]: Without dead ends: 3206 [2024-12-01 23:15:59,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-01 23:15:59,669 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3049 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:59,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3170 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-12-01 23:15:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2024-12-01 23:15:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.518332135154565) internal successors, (4224), 2783 states have internal predecessors, (4224), 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) [2024-12-01 23:15:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2024-12-01 23:15:59,756 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2024-12-01 23:15:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2024-12-01 23:15:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2024-12-01 23:15:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2024-12-01 23:15:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-01 23:15:59,757 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:59,757 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-01 23:15:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-01 23:15:59,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:59,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 894361900, now seen corresponding path program 1 times [2024-12-01 23:15:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12043188] [2024-12-01 23:15:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:15:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:15:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:15:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12043188] [2024-12-01 23:15:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12043188] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:15:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:15:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:15:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384295051] [2024-12-01 23:15:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:15:59,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:15:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:15:59,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:15:59,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:15:59,849 INFO L87 Difference]: Start difference. First operand 2784 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2024-12-01 23:15:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:15:59,888 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2024-12-01 23:15:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:15:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2024-12-01 23:15:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:15:59,896 INFO L225 Difference]: With dead ends: 4260 [2024-12-01 23:15:59,896 INFO L226 Difference]: Without dead ends: 2254 [2024-12-01 23:15:59,898 INFO L434 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 [2024-12-01 23:15:59,899 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:15:59,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:15:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-12-01 23:15:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2024-12-01 23:15:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.5537777777777777) internal successors, (3496), 2251 states have internal predecessors, (3496), 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) [2024-12-01 23:15:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2024-12-01 23:15:59,956 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2024-12-01 23:15:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:15:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2024-12-01 23:15:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2024-12-01 23:15:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2024-12-01 23:15:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-01 23:15:59,957 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:15:59,957 INFO L218 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] [2024-12-01 23:15:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-01 23:15:59,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:15:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:15:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1218909775, now seen corresponding path program 1 times [2024-12-01 23:15:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:15:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108438321] [2024-12-01 23:15:59,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:15:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:15:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-01 23:16:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:00,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108438321] [2024-12-01 23:16:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108438321] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:16:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:16:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:16:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961161325] [2024-12-01 23:16:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:16:00,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:16:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:00,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:16:00,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:16:00,060 INFO L87 Difference]: Start difference. First operand 2252 states and 3496 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2024-12-01 23:16:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:00,150 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2024-12-01 23:16:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:16:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 56 [2024-12-01 23:16:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:00,160 INFO L225 Difference]: With dead ends: 3508 [2024-12-01 23:16:00,160 INFO L226 Difference]: Without dead ends: 3090 [2024-12-01 23:16:00,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-01 23:16:00,162 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 3051 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:00,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3147 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:16:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-12-01 23:16:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2024-12-01 23:16:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5273818454613652) internal successors, (4072), 2667 states have internal predecessors, (4072), 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) [2024-12-01 23:16:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2024-12-01 23:16:00,234 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2024-12-01 23:16:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:00,235 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2024-12-01 23:16:00,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2024-12-01 23:16:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2024-12-01 23:16:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-01 23:16:00,236 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:00,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:16:00,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-01 23:16:00,236 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:00,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -877348108, now seen corresponding path program 1 times [2024-12-01 23:16:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291773302] [2024-12-01 23:16:00,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291773302] [2024-12-01 23:16:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291773302] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:16:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:16:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:16:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819838756] [2024-12-01 23:16:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:16:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:16:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:00,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:16:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:16:00,346 INFO L87 Difference]: Start difference. First operand 2668 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-12-01 23:16:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:00,379 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2024-12-01 23:16:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:16:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2024-12-01 23:16:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:00,385 INFO L225 Difference]: With dead ends: 3608 [2024-12-01 23:16:00,385 INFO L226 Difference]: Without dead ends: 1734 [2024-12-01 23:16:00,387 INFO L434 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 [2024-12-01 23:16:00,387 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:00,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:16:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-12-01 23:16:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-12-01 23:16:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5942196531791908) internal successors, (2758), 1731 states have internal predecessors, (2758), 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) [2024-12-01 23:16:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2024-12-01 23:16:00,427 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2024-12-01 23:16:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:00,427 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2024-12-01 23:16:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-12-01 23:16:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2024-12-01 23:16:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-01 23:16:00,428 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:00,429 INFO L218 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] [2024-12-01 23:16:00,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-01 23:16:00,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:00,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1226511174, now seen corresponding path program 1 times [2024-12-01 23:16:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98902123] [2024-12-01 23:16:00,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98902123] [2024-12-01 23:16:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98902123] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:16:00,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:16:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:16:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72335008] [2024-12-01 23:16:00,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:16:00,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:16:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:00,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:16:00,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:16:00,512 INFO L87 Difference]: Start difference. First operand 1732 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2024-12-01 23:16:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:00,537 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2024-12-01 23:16:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:16:00,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 [2024-12-01 23:16:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:00,542 INFO L225 Difference]: With dead ends: 2204 [2024-12-01 23:16:00,542 INFO L226 Difference]: Without dead ends: 1266 [2024-12-01 23:16:00,543 INFO L434 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 [2024-12-01 23:16:00,544 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:00,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-01 23:16:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-12-01 23:16:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2024-12-01 23:16:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1262 states have (on average 1.6719492868462758) internal successors, (2110), 1263 states have internal predecessors, (2110), 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) [2024-12-01 23:16:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2024-12-01 23:16:00,570 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2024-12-01 23:16:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:00,571 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2024-12-01 23:16:00,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2024-12-01 23:16:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2024-12-01 23:16:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-01 23:16:00,572 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:00,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:16:00,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-01 23:16:00,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:00,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1826022888, now seen corresponding path program 1 times [2024-12-01 23:16:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567671119] [2024-12-01 23:16:00,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:01,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:01,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567671119] [2024-12-01 23:16:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567671119] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:01,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388459428] [2024-12-01 23:16:01,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:01,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:01,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:01,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-01 23:16:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:02,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-01 23:16:02,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-01 23:16:02,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-01 23:16:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388459428] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:02,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:02,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-12-01 23:16:02,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990607699] [2024-12-01 23:16:02,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:02,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-01 23:16:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:02,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-01 23:16:02,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-01 23:16:02,515 INFO L87 Difference]: Start difference. First operand 1264 states and 2110 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 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) [2024-12-01 23:16:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:04,606 INFO L93 Difference]: Finished difference Result 3665 states and 5284 transitions. [2024-12-01 23:16:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-12-01 23:16:04,607 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 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 61 [2024-12-01 23:16:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:04,614 INFO L225 Difference]: With dead ends: 3665 [2024-12-01 23:16:04,614 INFO L226 Difference]: Without dead ends: 3195 [2024-12-01 23:16:04,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2024-12-01 23:16:04,617 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 14347 mSDsluCounter, 7682 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14347 SdHoareTripleChecker+Valid, 9181 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14347 Valid, 9181 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-01 23:16:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2024-12-01 23:16:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3161. [2024-12-01 23:16:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3159 states have (on average 1.4102564102564104) internal successors, (4455), 3160 states have internal predecessors, (4455), 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) [2024-12-01 23:16:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4455 transitions. [2024-12-01 23:16:04,677 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4455 transitions. Word has length 61 [2024-12-01 23:16:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:04,678 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4455 transitions. [2024-12-01 23:16:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 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) [2024-12-01 23:16:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4455 transitions. [2024-12-01 23:16:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-01 23:16:04,679 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:04,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:16:04,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-12-01 23:16:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-01 23:16:04,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -651882757, now seen corresponding path program 1 times [2024-12-01 23:16:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763476331] [2024-12-01 23:16:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:04,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:04,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763476331] [2024-12-01 23:16:04,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763476331] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:16:04,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:16:04,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:16:04,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534958950] [2024-12-01 23:16:04,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:16:04,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:16:04,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:04,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:16:04,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:16:04,925 INFO L87 Difference]: Start difference. First operand 3161 states and 4455 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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) [2024-12-01 23:16:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:08,003 INFO L93 Difference]: Finished difference Result 4665 states and 7328 transitions. [2024-12-01 23:16:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:16:08,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2024-12-01 23:16:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:08,008 INFO L225 Difference]: With dead ends: 4665 [2024-12-01 23:16:08,008 INFO L226 Difference]: Without dead ends: 3912 [2024-12-01 23:16:08,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:16:08,010 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 826 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:08,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 149 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-12-01 23:16:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2024-12-01 23:16:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3912. [2024-12-01 23:16:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3910 states have (on average 1.4910485933503836) internal successors, (5830), 3911 states have internal predecessors, (5830), 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) [2024-12-01 23:16:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5830 transitions. [2024-12-01 23:16:08,064 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5830 transitions. Word has length 61 [2024-12-01 23:16:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:08,065 INFO L471 AbstractCegarLoop]: Abstraction has 3912 states and 5830 transitions. [2024-12-01 23:16:08,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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) [2024-12-01 23:16:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5830 transitions. [2024-12-01 23:16:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-01 23:16:08,066 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:08,066 INFO L218 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] [2024-12-01 23:16:08,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-01 23:16:08,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:08,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 459765187, now seen corresponding path program 1 times [2024-12-01 23:16:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980486080] [2024-12-01 23:16:08,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980486080] [2024-12-01 23:16:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980486080] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057749376] [2024-12-01 23:16:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:09,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:09,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-01 23:16:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:09,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-01 23:16:09,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:09,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:10,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057749376] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:10,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:10,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-12-01 23:16:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140919838] [2024-12-01 23:16:10,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:10,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-01 23:16:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:10,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-01 23:16:10,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-12-01 23:16:10,505 INFO L87 Difference]: Start difference. First operand 3912 states and 5830 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 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) [2024-12-01 23:16:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:11,023 INFO L93 Difference]: Finished difference Result 8019 states and 11020 transitions. [2024-12-01 23:16:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-01 23:16:11,024 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 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 [2024-12-01 23:16:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:11,031 INFO L225 Difference]: With dead ends: 8019 [2024-12-01 23:16:11,032 INFO L226 Difference]: Without dead ends: 6060 [2024-12-01 23:16:11,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2024-12-01 23:16:11,034 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 12051 mSDsluCounter, 4782 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12051 SdHoareTripleChecker+Valid, 6277 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12051 Valid, 6277 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-01 23:16:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2024-12-01 23:16:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 5994. [2024-12-01 23:16:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5994 states, 5992 states have (on average 1.395026702269693) internal successors, (8359), 5993 states have internal predecessors, (8359), 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) [2024-12-01 23:16:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 8359 transitions. [2024-12-01 23:16:11,128 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 8359 transitions. Word has length 62 [2024-12-01 23:16:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:11,128 INFO L471 AbstractCegarLoop]: Abstraction has 5994 states and 8359 transitions. [2024-12-01 23:16:11,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 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) [2024-12-01 23:16:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 8359 transitions. [2024-12-01 23:16:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-01 23:16:11,129 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:11,129 INFO L218 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, 1, 1, 1, 1] [2024-12-01 23:16:11,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-01 23:16:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-01 23:16:11,330 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1147902773, now seen corresponding path program 1 times [2024-12-01 23:16:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259351622] [2024-12-01 23:16:11,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:11,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259351622] [2024-12-01 23:16:11,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259351622] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222920055] [2024-12-01 23:16:11,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:11,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:11,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:11,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:11,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-01 23:16:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:11,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-01 23:16:11,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:12,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222920055] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:12,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-01 23:16:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021239461] [2024-12-01 23:16:12,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-01 23:16:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-01 23:16:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-12-01 23:16:12,933 INFO L87 Difference]: Start difference. First operand 5994 states and 8359 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 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) [2024-12-01 23:16:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:16,009 INFO L93 Difference]: Finished difference Result 14015 states and 18419 transitions. [2024-12-01 23:16:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-12-01 23:16:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 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 [2024-12-01 23:16:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:16,027 INFO L225 Difference]: With dead ends: 14015 [2024-12-01 23:16:16,027 INFO L226 Difference]: Without dead ends: 10055 [2024-12-01 23:16:16,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-12-01 23:16:16,032 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 20416 mSDsluCounter, 16805 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20416 SdHoareTripleChecker+Valid, 18313 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:16,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20416 Valid, 18313 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-01 23:16:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2024-12-01 23:16:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 6653. [2024-12-01 23:16:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6653 states, 6651 states have (on average 1.3794918057434973) internal successors, (9175), 6652 states have internal predecessors, (9175), 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) [2024-12-01 23:16:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6653 states to 6653 states and 9175 transitions. [2024-12-01 23:16:16,200 INFO L78 Accepts]: Start accepts. Automaton has 6653 states and 9175 transitions. Word has length 62 [2024-12-01 23:16:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:16,201 INFO L471 AbstractCegarLoop]: Abstraction has 6653 states and 9175 transitions. [2024-12-01 23:16:16,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 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) [2024-12-01 23:16:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6653 states and 9175 transitions. [2024-12-01 23:16:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-01 23:16:16,201 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:16,202 INFO L218 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, 1] [2024-12-01 23:16:16,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-01 23:16:16,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:16,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:16,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 807603108, now seen corresponding path program 1 times [2024-12-01 23:16:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613350335] [2024-12-01 23:16:16,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:16,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613350335] [2024-12-01 23:16:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613350335] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954878224] [2024-12-01 23:16:16,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:16,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:16,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:16,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:16,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-01 23:16:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:16,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-01 23:16:16,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:17,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954878224] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:18,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-12-01 23:16:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493352971] [2024-12-01 23:16:18,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:18,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-01 23:16:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:18,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-01 23:16:18,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-12-01 23:16:18,798 INFO L87 Difference]: Start difference. First operand 6653 states and 9175 transitions. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 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) [2024-12-01 23:16:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:20,309 INFO L93 Difference]: Finished difference Result 13303 states and 17478 transitions. [2024-12-01 23:16:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-01 23:16:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 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 [2024-12-01 23:16:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:20,324 INFO L225 Difference]: With dead ends: 13303 [2024-12-01 23:16:20,324 INFO L226 Difference]: Without dead ends: 8989 [2024-12-01 23:16:20,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=637, Invalid=2015, Unknown=0, NotChecked=0, Total=2652 [2024-12-01 23:16:20,328 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 17081 mSDsluCounter, 5061 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17081 SdHoareTripleChecker+Valid, 6575 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:20,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17081 Valid, 6575 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-01 23:16:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-12-01 23:16:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8565. [2024-12-01 23:16:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8565 states, 8563 states have (on average 1.3383160107438983) internal successors, (11460), 8564 states have internal predecessors, (11460), 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) [2024-12-01 23:16:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8565 states to 8565 states and 11460 transitions. [2024-12-01 23:16:20,543 INFO L78 Accepts]: Start accepts. Automaton has 8565 states and 11460 transitions. Word has length 63 [2024-12-01 23:16:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:20,544 INFO L471 AbstractCegarLoop]: Abstraction has 8565 states and 11460 transitions. [2024-12-01 23:16:20,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 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) [2024-12-01 23:16:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8565 states and 11460 transitions. [2024-12-01 23:16:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-01 23:16:20,545 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:20,545 INFO L218 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, 1, 1, 1, 1, 1] [2024-12-01 23:16:20,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-01 23:16:20,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:20,745 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1786741782, now seen corresponding path program 1 times [2024-12-01 23:16:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:20,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45961121] [2024-12-01 23:16:20,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45961121] [2024-12-01 23:16:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45961121] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898425733] [2024-12-01 23:16:22,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:22,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:22,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:22,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-01 23:16:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:22,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-01 23:16:22,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:25,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898425733] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:26,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 15] total 51 [2024-12-01 23:16:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837958045] [2024-12-01 23:16:26,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-12-01 23:16:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-12-01 23:16:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2024-12-01 23:16:26,801 INFO L87 Difference]: Start difference. First operand 8565 states and 11460 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 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) [2024-12-01 23:16:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:47,782 INFO L93 Difference]: Finished difference Result 15291 states and 19717 transitions. [2024-12-01 23:16:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-12-01 23:16:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 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 [2024-12-01 23:16:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:47,797 INFO L225 Difference]: With dead ends: 15291 [2024-12-01 23:16:47,797 INFO L226 Difference]: Without dead ends: 12452 [2024-12-01 23:16:47,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=4031, Invalid=15991, Unknown=0, NotChecked=0, Total=20022 [2024-12-01 23:16:47,802 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 23531 mSDsluCounter, 20536 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23531 SdHoareTripleChecker+Valid, 22072 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:47,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23531 Valid, 22072 Invalid, 2161 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [133 Valid, 2028 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-01 23:16:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12452 states. [2024-12-01 23:16:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12452 to 10636. [2024-12-01 23:16:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10636 states, 10634 states have (on average 1.3189768666541282) internal successors, (14026), 10635 states have internal predecessors, (14026), 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) [2024-12-01 23:16:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 14026 transitions. [2024-12-01 23:16:48,320 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 14026 transitions. Word has length 63 [2024-12-01 23:16:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:48,320 INFO L471 AbstractCegarLoop]: Abstraction has 10636 states and 14026 transitions. [2024-12-01 23:16:48,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 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) [2024-12-01 23:16:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 14026 transitions. [2024-12-01 23:16:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-01 23:16:48,323 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:48,323 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-12-01 23:16:48,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-01 23:16:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-01 23:16:48,523 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash 532152701, now seen corresponding path program 1 times [2024-12-01 23:16:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293751033] [2024-12-01 23:16:48,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293751033] [2024-12-01 23:16:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293751033] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799379601] [2024-12-01 23:16:49,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:49,911 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:49,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-01 23:16:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:50,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-01 23:16:50,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:51,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799379601] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:52,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2024-12-01 23:16:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692622416] [2024-12-01 23:16:52,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:52,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-01 23:16:52,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-01 23:16:52,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-12-01 23:16:52,134 INFO L87 Difference]: Start difference. First operand 10636 states and 14026 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 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) [2024-12-01 23:16:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:16:55,562 INFO L93 Difference]: Finished difference Result 14134 states and 18303 transitions. [2024-12-01 23:16:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-01 23:16:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 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 64 [2024-12-01 23:16:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:16:55,580 INFO L225 Difference]: With dead ends: 14134 [2024-12-01 23:16:55,581 INFO L226 Difference]: Without dead ends: 10323 [2024-12-01 23:16:55,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2024-12-01 23:16:55,587 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 17257 mSDsluCounter, 15658 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17257 SdHoareTripleChecker+Valid, 17175 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-01 23:16:55,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17257 Valid, 17175 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-01 23:16:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10323 states. [2024-12-01 23:16:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10323 to 8705. [2024-12-01 23:16:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8705 states, 8703 states have (on average 1.3340227507755946) internal successors, (11610), 8704 states have internal predecessors, (11610), 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) [2024-12-01 23:16:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 11610 transitions. [2024-12-01 23:16:55,919 INFO L78 Accepts]: Start accepts. Automaton has 8705 states and 11610 transitions. Word has length 64 [2024-12-01 23:16:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:16:55,919 INFO L471 AbstractCegarLoop]: Abstraction has 8705 states and 11610 transitions. [2024-12-01 23:16:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 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) [2024-12-01 23:16:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8705 states and 11610 transitions. [2024-12-01 23:16:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-01 23:16:55,920 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:16:55,920 INFO L218 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, 1, 1, 1] [2024-12-01 23:16:55,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-01 23:16:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-01 23:16:56,120 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:16:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:16:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1624666796, now seen corresponding path program 1 times [2024-12-01 23:16:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:16:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266463856] [2024-12-01 23:16:56,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:16:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:16:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266463856] [2024-12-01 23:16:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266463856] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:16:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179310107] [2024-12-01 23:16:57,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:16:57,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:16:57,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:16:57,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:16:57,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-01 23:16:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:16:57,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-01 23:16:57,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:16:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:58,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:16:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:16:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179310107] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:16:59,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:16:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 42 [2024-12-01 23:16:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770816067] [2024-12-01 23:16:59,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:16:59,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-01 23:16:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:16:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-01 23:16:59,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2024-12-01 23:16:59,713 INFO L87 Difference]: Start difference. First operand 8705 states and 11610 transitions. Second operand has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 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) [2024-12-01 23:17:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:17:09,716 INFO L93 Difference]: Finished difference Result 22615 states and 28660 transitions. [2024-12-01 23:17:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-12-01 23:17:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 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 65 [2024-12-01 23:17:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:17:09,730 INFO L225 Difference]: With dead ends: 22615 [2024-12-01 23:17:09,730 INFO L226 Difference]: Without dead ends: 18184 [2024-12-01 23:17:09,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2435, Invalid=9121, Unknown=0, NotChecked=0, Total=11556 [2024-12-01 23:17:09,735 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 16695 mSDsluCounter, 32347 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16695 SdHoareTripleChecker+Valid, 33930 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:17:09,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16695 Valid, 33930 Invalid, 3211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-01 23:17:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18184 states. [2024-12-01 23:17:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18184 to 5862. [2024-12-01 23:17:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5862 states, 5860 states have (on average 1.392320819112628) internal successors, (8159), 5861 states have internal predecessors, (8159), 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) [2024-12-01 23:17:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8159 transitions. [2024-12-01 23:17:10,036 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8159 transitions. Word has length 65 [2024-12-01 23:17:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:17:10,036 INFO L471 AbstractCegarLoop]: Abstraction has 5862 states and 8159 transitions. [2024-12-01 23:17:10,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 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) [2024-12-01 23:17:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8159 transitions. [2024-12-01 23:17:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-01 23:17:10,039 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:17:10,039 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-12-01 23:17:10,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-01 23:17:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-01 23:17:10,240 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:17:10,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:17:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1065912349, now seen corresponding path program 1 times [2024-12-01 23:17:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:17:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393658817] [2024-12-01 23:17:10,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:17:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:17:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393658817] [2024-12-01 23:17:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393658817] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:17:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553565958] [2024-12-01 23:17:10,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:17:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:17:10,973 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:17:10,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-01 23:17:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:11,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-01 23:17:11,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:17:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:11,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:17:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553565958] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:17:13,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:17:13,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-01 23:17:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535125381] [2024-12-01 23:17:13,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:17:13,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-01 23:17:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:17:13,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-01 23:17:13,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-12-01 23:17:13,158 INFO L87 Difference]: Start difference. First operand 5862 states and 8159 transitions. Second operand has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 26 states have internal predecessors, (225), 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) [2024-12-01 23:17:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:17:14,363 INFO L93 Difference]: Finished difference Result 15432 states and 20087 transitions. [2024-12-01 23:17:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-01 23:17:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 26 states have internal predecessors, (225), 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 [2024-12-01 23:17:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:17:14,370 INFO L225 Difference]: With dead ends: 15432 [2024-12-01 23:17:14,370 INFO L226 Difference]: Without dead ends: 11433 [2024-12-01 23:17:14,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-12-01 23:17:14,373 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 16364 mSDsluCounter, 12108 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16364 SdHoareTripleChecker+Valid, 13624 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:17:14,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16364 Valid, 13624 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-01 23:17:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11433 states. [2024-12-01 23:17:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11433 to 10613. [2024-12-01 23:17:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10613 states, 10611 states have (on average 1.308641975308642) internal successors, (13886), 10612 states have internal predecessors, (13886), 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) [2024-12-01 23:17:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10613 states to 10613 states and 13886 transitions. [2024-12-01 23:17:14,839 INFO L78 Accepts]: Start accepts. Automaton has 10613 states and 13886 transitions. Word has length 103 [2024-12-01 23:17:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:17:14,840 INFO L471 AbstractCegarLoop]: Abstraction has 10613 states and 13886 transitions. [2024-12-01 23:17:14,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 26 states have internal predecessors, (225), 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) [2024-12-01 23:17:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 10613 states and 13886 transitions. [2024-12-01 23:17:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-01 23:17:14,841 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:17:14,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:17:14,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-01 23:17:15,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:17:15,042 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:17:15,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:17:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1754049935, now seen corresponding path program 1 times [2024-12-01 23:17:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:17:15,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668821846] [2024-12-01 23:17:15,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:17:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:15,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:17:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668821846] [2024-12-01 23:17:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668821846] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:17:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163952630] [2024-12-01 23:17:15,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:15,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:17:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:17:15,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:17:15,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-01 23:17:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:15,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-01 23:17:15,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:17:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:16,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:17:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:17,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163952630] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:17:17,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:17:17,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-01 23:17:17,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903615831] [2024-12-01 23:17:17,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:17:17,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-01 23:17:17,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:17:17,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-01 23:17:17,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-12-01 23:17:17,919 INFO L87 Difference]: Start difference. First operand 10613 states and 13886 transitions. Second operand has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 26 states have internal predecessors, (217), 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) [2024-12-01 23:17:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:17:19,137 INFO L93 Difference]: Finished difference Result 15323 states and 19650 transitions. [2024-12-01 23:17:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-01 23:17:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 26 states have internal predecessors, (217), 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 [2024-12-01 23:17:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:17:19,145 INFO L225 Difference]: With dead ends: 15323 [2024-12-01 23:17:19,145 INFO L226 Difference]: Without dead ends: 9611 [2024-12-01 23:17:19,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2024-12-01 23:17:19,149 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 11912 mSDsluCounter, 9164 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11912 SdHoareTripleChecker+Valid, 10679 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:17:19,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11912 Valid, 10679 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-01 23:17:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2024-12-01 23:17:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9519. [2024-12-01 23:17:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9519 states, 9517 states have (on average 1.3104970053588316) internal successors, (12472), 9518 states have internal predecessors, (12472), 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) [2024-12-01 23:17:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9519 states to 9519 states and 12472 transitions. [2024-12-01 23:17:19,605 INFO L78 Accepts]: Start accepts. Automaton has 9519 states and 12472 transitions. Word has length 103 [2024-12-01 23:17:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:17:19,605 INFO L471 AbstractCegarLoop]: Abstraction has 9519 states and 12472 transitions. [2024-12-01 23:17:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 26 states have internal predecessors, (217), 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) [2024-12-01 23:17:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9519 states and 12472 transitions. [2024-12-01 23:17:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-01 23:17:19,608 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:17:19,608 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:17:19,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-01 23:17:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-01 23:17:19,809 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:17:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:17:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 856710688, now seen corresponding path program 1 times [2024-12-01 23:17:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:17:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781310817] [2024-12-01 23:17:19,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:17:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-01 23:17:20,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:17:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781310817] [2024-12-01 23:17:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781310817] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:17:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539175009] [2024-12-01 23:17:20,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:17:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:17:20,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:17:20,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-01 23:17:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:20,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-01 23:17:20,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:17:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:22,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:17:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539175009] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:17:25,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:17:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-12-01 23:17:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621241458] [2024-12-01 23:17:25,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:17:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-12-01 23:17:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:17:25,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-12-01 23:17:25,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2024-12-01 23:17:25,744 INFO L87 Difference]: Start difference. First operand 9519 states and 12472 transitions. Second operand has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 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) [2024-12-01 23:17:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:17:35,428 INFO L93 Difference]: Finished difference Result 15217 states and 19341 transitions. [2024-12-01 23:17:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-01 23:17:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 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 [2024-12-01 23:17:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:17:35,434 INFO L225 Difference]: With dead ends: 15217 [2024-12-01 23:17:35,435 INFO L226 Difference]: Without dead ends: 9687 [2024-12-01 23:17:35,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3017 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1975, Invalid=10907, Unknown=0, NotChecked=0, Total=12882 [2024-12-01 23:17:35,438 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 26015 mSDsluCounter, 27303 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26015 SdHoareTripleChecker+Valid, 28812 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-01 23:17:35,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26015 Valid, 28812 Invalid, 1799 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-01 23:17:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2024-12-01 23:17:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 9203. [2024-12-01 23:17:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9203 states, 9201 states have (on average 1.3150744484295185) internal successors, (12100), 9202 states have internal predecessors, (12100), 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) [2024-12-01 23:17:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9203 states to 9203 states and 12100 transitions. [2024-12-01 23:17:35,953 INFO L78 Accepts]: Start accepts. Automaton has 9203 states and 12100 transitions. Word has length 104 [2024-12-01 23:17:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:17:35,953 INFO L471 AbstractCegarLoop]: Abstraction has 9203 states and 12100 transitions. [2024-12-01 23:17:35,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 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) [2024-12-01 23:17:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 9203 states and 12100 transitions. [2024-12-01 23:17:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-01 23:17:35,955 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:17:35,955 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:17:35,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-01 23:17:36,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-01 23:17:36,156 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:17:36,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:17:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 15634770, now seen corresponding path program 1 times [2024-12-01 23:17:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:17:36,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532698549] [2024-12-01 23:17:36,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:17:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:17:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532698549] [2024-12-01 23:17:36,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532698549] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:17:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265088494] [2024-12-01 23:17:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:36,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:17:36,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:17:36,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:17:36,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-01 23:17:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:36,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-01 23:17:36,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:17:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:37,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:17:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265088494] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:17:40,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:17:40,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2024-12-01 23:17:40,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749866651] [2024-12-01 23:17:40,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:17:40,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-01 23:17:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:17:40,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-01 23:17:40,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2024-12-01 23:17:40,602 INFO L87 Difference]: Start difference. First operand 9203 states and 12100 transitions. Second operand has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 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) [2024-12-01 23:17:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:17:45,899 INFO L93 Difference]: Finished difference Result 20585 states and 25974 transitions. [2024-12-01 23:17:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-12-01 23:17:45,900 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 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 [2024-12-01 23:17:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:17:45,909 INFO L225 Difference]: With dead ends: 20585 [2024-12-01 23:17:45,909 INFO L226 Difference]: Without dead ends: 13509 [2024-12-01 23:17:45,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1986, Invalid=8726, Unknown=0, NotChecked=0, Total=10712 [2024-12-01 23:17:45,913 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 21291 mSDsluCounter, 10585 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21291 SdHoareTripleChecker+Valid, 12208 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:17:45,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21291 Valid, 12208 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-01 23:17:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13509 states. [2024-12-01 23:17:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13509 to 5383. [2024-12-01 23:17:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 5381 states have (on average 1.3871027690020443) internal successors, (7464), 5382 states have internal predecessors, (7464), 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) [2024-12-01 23:17:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 7464 transitions. [2024-12-01 23:17:46,246 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 7464 transitions. Word has length 104 [2024-12-01 23:17:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:17:46,247 INFO L471 AbstractCegarLoop]: Abstraction has 5383 states and 7464 transitions. [2024-12-01 23:17:46,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 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) [2024-12-01 23:17:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 7464 transitions. [2024-12-01 23:17:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-01 23:17:46,248 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:17:46,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:17:46,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-01 23:17:46,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-01 23:17:46,448 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:17:46,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:17:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1395528875, now seen corresponding path program 1 times [2024-12-01 23:17:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:17:46,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985002349] [2024-12-01 23:17:46,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:17:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:17:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985002349] [2024-12-01 23:17:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985002349] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:17:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342030741] [2024-12-01 23:17:47,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:17:47,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:17:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:17:47,448 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:17:47,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-01 23:17:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:17:47,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-01 23:17:47,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:17:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:48,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:17:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:17:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342030741] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:17:52,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:17:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 53 [2024-12-01 23:17:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515860830] [2024-12-01 23:17:52,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:17:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-12-01 23:17:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:17:52,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-12-01 23:17:52,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2526, Unknown=0, NotChecked=0, Total=2756 [2024-12-01 23:17:52,037 INFO L87 Difference]: Start difference. First operand 5383 states and 7464 transitions. Second operand has 53 states, 53 states have (on average 5.377358490566038) internal successors, (285), 53 states have internal predecessors, (285), 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) [2024-12-01 23:18:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:18:32,514 INFO L93 Difference]: Finished difference Result 16426 states and 20641 transitions. [2024-12-01 23:18:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2024-12-01 23:18:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.377358490566038) internal successors, (285), 53 states have internal predecessors, (285), 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 [2024-12-01 23:18:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:18:32,523 INFO L225 Difference]: With dead ends: 16426 [2024-12-01 23:18:32,524 INFO L226 Difference]: Without dead ends: 14463 [2024-12-01 23:18:32,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24928 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=12162, Invalid=59930, Unknown=0, NotChecked=0, Total=72092 [2024-12-01 23:18:32,531 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 23551 mSDsluCounter, 40667 mSDsCounter, 0 mSdLazyCounter, 3742 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23551 SdHoareTripleChecker+Valid, 42268 SdHoareTripleChecker+Invalid, 3953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 3742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-01 23:18:32,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23551 Valid, 42268 Invalid, 3953 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [211 Valid, 3742 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-01 23:18:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14463 states. [2024-12-01 23:18:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14463 to 11333. [2024-12-01 23:18:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11333 states, 11331 states have (on average 1.286823757832495) internal successors, (14581), 11332 states have internal predecessors, (14581), 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) [2024-12-01 23:18:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11333 states to 11333 states and 14581 transitions. [2024-12-01 23:18:33,434 INFO L78 Accepts]: Start accepts. Automaton has 11333 states and 14581 transitions. Word has length 105 [2024-12-01 23:18:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:18:33,435 INFO L471 AbstractCegarLoop]: Abstraction has 11333 states and 14581 transitions. [2024-12-01 23:18:33,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.377358490566038) internal successors, (285), 53 states have internal predecessors, (285), 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) [2024-12-01 23:18:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11333 states and 14581 transitions. [2024-12-01 23:18:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-01 23:18:33,436 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:18:33,436 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:18:33,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-01 23:18:33,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-01 23:18:33,636 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:18:33,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:18:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1322155965, now seen corresponding path program 1 times [2024-12-01 23:18:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:18:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683154458] [2024-12-01 23:18:33,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:18:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:18:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:18:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:18:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:18:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683154458] [2024-12-01 23:18:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683154458] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:18:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436281834] [2024-12-01 23:18:34,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:18:34,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:18:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:18:34,314 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:18:34,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-01 23:18:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:18:34,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-01 23:18:34,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:18:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:18:39,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:18:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:18:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436281834] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:18:46,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:18:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32, 27] total 76 [2024-12-01 23:18:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682975005] [2024-12-01 23:18:46,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:18:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-01 23:18:46,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:18:46,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-01 23:18:46,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=5073, Unknown=0, NotChecked=0, Total=5700 [2024-12-01 23:18:46,862 INFO L87 Difference]: Start difference. First operand 11333 states and 14581 transitions. Second operand has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 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) [2024-12-01 23:19:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:19:22,258 INFO L93 Difference]: Finished difference Result 19339 states and 24355 transitions. [2024-12-01 23:19:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-12-01 23:19:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 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 [2024-12-01 23:19:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:19:22,269 INFO L225 Difference]: With dead ends: 19339 [2024-12-01 23:19:22,270 INFO L226 Difference]: Without dead ends: 15201 [2024-12-01 23:19:22,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12702 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=6924, Invalid=33276, Unknown=0, NotChecked=0, Total=40200 [2024-12-01 23:19:22,274 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 22231 mSDsluCounter, 34952 mSDsCounter, 0 mSdLazyCounter, 3947 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22231 SdHoareTripleChecker+Valid, 36512 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 3947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-12-01 23:19:22,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22231 Valid, 36512 Invalid, 4098 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [151 Valid, 3947 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-12-01 23:19:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2024-12-01 23:19:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 14430. [2024-12-01 23:19:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14430 states, 14428 states have (on average 1.2674660382589409) internal successors, (18287), 14429 states have internal predecessors, (18287), 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) [2024-12-01 23:19:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14430 states to 14430 states and 18287 transitions. [2024-12-01 23:19:23,574 INFO L78 Accepts]: Start accepts. Automaton has 14430 states and 18287 transitions. Word has length 105 [2024-12-01 23:19:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:19:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 14430 states and 18287 transitions. [2024-12-01 23:19:23,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 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) [2024-12-01 23:19:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14430 states and 18287 transitions. [2024-12-01 23:19:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-01 23:19:23,576 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:19:23,576 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:19:23,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-01 23:19:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-01 23:19:23,777 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:19:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:19:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1973850741, now seen corresponding path program 1 times [2024-12-01 23:19:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:19:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422881768] [2024-12-01 23:19:23,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:19:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:19:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:19:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:19:24,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:19:24,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422881768] [2024-12-01 23:19:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422881768] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:19:24,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976561221] [2024-12-01 23:19:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:19:24,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:19:24,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:19:24,836 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:19:24,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-01 23:19:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:19:24,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-01 23:19:24,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:19:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:19:26,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:19:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:19:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976561221] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:19:30,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:19:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 21] total 59 [2024-12-01 23:19:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717760385] [2024-12-01 23:19:30,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:19:30,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-01 23:19:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:19:30,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-01 23:19:30,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3177, Unknown=0, NotChecked=0, Total=3422 [2024-12-01 23:19:30,071 INFO L87 Difference]: Start difference. First operand 14430 states and 18287 transitions. Second operand has 59 states, 59 states have (on average 4.915254237288136) internal successors, (290), 59 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) [2024-12-01 23:19:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:19:47,881 INFO L93 Difference]: Finished difference Result 30706 states and 37717 transitions. [2024-12-01 23:19:47,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-12-01 23:19:47,881 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 4.915254237288136) internal successors, (290), 59 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 105 [2024-12-01 23:19:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:19:47,897 INFO L225 Difference]: With dead ends: 30706 [2024-12-01 23:19:47,897 INFO L226 Difference]: Without dead ends: 22845 [2024-12-01 23:19:47,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5470 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3809, Invalid=18541, Unknown=0, NotChecked=0, Total=22350 [2024-12-01 23:19:47,903 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 28700 mSDsluCounter, 37266 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28700 SdHoareTripleChecker+Valid, 38885 SdHoareTripleChecker+Invalid, 3489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:19:47,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28700 Valid, 38885 Invalid, 3489 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [157 Valid, 3332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-01 23:19:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22845 states. [2024-12-01 23:19:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22845 to 14452. [2024-12-01 23:19:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14452 states, 14450 states have (on average 1.2642906574394464) internal successors, (18269), 14451 states have internal predecessors, (18269), 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) [2024-12-01 23:19:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 18269 transitions. [2024-12-01 23:19:49,394 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 18269 transitions. Word has length 105 [2024-12-01 23:19:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:19:49,394 INFO L471 AbstractCegarLoop]: Abstraction has 14452 states and 18269 transitions. [2024-12-01 23:19:49,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.915254237288136) internal successors, (290), 59 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) [2024-12-01 23:19:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 18269 transitions. [2024-12-01 23:19:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-01 23:19:49,395 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:19:49,395 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:19:49,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-01 23:19:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:19:49,596 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:19:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:19:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1775421751, now seen corresponding path program 1 times [2024-12-01 23:19:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:19:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388175756] [2024-12-01 23:19:49,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:19:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:19:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:19:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:19:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:19:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388175756] [2024-12-01 23:19:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388175756] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:19:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100978141] [2024-12-01 23:19:49,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:19:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:19:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:19:49,999 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:19:50,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-01 23:19:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:19:50,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-01 23:19:50,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:19:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:19:51,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:19:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 23 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:19:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100978141] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:19:54,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:19:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 44 [2024-12-01 23:19:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088286431] [2024-12-01 23:19:54,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:19:54,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-01 23:19:54,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:19:54,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-01 23:19:54,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-12-01 23:19:54,296 INFO L87 Difference]: Start difference. First operand 14452 states and 18269 transitions. Second operand has 44 states, 44 states have (on average 6.545454545454546) internal successors, (288), 44 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) [2024-12-01 23:20:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:20:03,491 INFO L93 Difference]: Finished difference Result 39167 states and 48068 transitions. [2024-12-01 23:20:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-12-01 23:20:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.545454545454546) internal successors, (288), 44 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 107 [2024-12-01 23:20:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:20:03,512 INFO L225 Difference]: With dead ends: 39167 [2024-12-01 23:20:03,512 INFO L226 Difference]: Without dead ends: 29530 [2024-12-01 23:20:03,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2529, Invalid=10811, Unknown=0, NotChecked=0, Total=13340 [2024-12-01 23:20:03,518 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 21837 mSDsluCounter, 18062 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21837 SdHoareTripleChecker+Valid, 19635 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:20:03,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21837 Valid, 19635 Invalid, 1708 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [97 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-01 23:20:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29530 states. [2024-12-01 23:20:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29530 to 21999. [2024-12-01 23:20:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21999 states, 21997 states have (on average 1.2454880210937855) internal successors, (27397), 21998 states have internal predecessors, (27397), 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) [2024-12-01 23:20:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21999 states to 21999 states and 27397 transitions. [2024-12-01 23:20:05,964 INFO L78 Accepts]: Start accepts. Automaton has 21999 states and 27397 transitions. Word has length 107 [2024-12-01 23:20:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:20:05,964 INFO L471 AbstractCegarLoop]: Abstraction has 21999 states and 27397 transitions. [2024-12-01 23:20:05,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.545454545454546) internal successors, (288), 44 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) [2024-12-01 23:20:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 21999 states and 27397 transitions. [2024-12-01 23:20:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-01 23:20:05,965 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:20:05,965 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:20:05,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-01 23:20:06,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-12-01 23:20:06,165 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:20:06,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:20:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2088015337, now seen corresponding path program 1 times [2024-12-01 23:20:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:20:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101720238] [2024-12-01 23:20:06,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:20:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:20:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:20:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 24 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:20:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:20:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101720238] [2024-12-01 23:20:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101720238] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:20:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436362834] [2024-12-01 23:20:06,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:20:06,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:20:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:20:06,681 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:20:06,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-01 23:20:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:20:06,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-01 23:20:06,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:20:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:20:07,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:20:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 41 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:20:09,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436362834] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:20:09,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:20:09,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 40 [2024-12-01 23:20:09,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834953062] [2024-12-01 23:20:09,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:20:09,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-01 23:20:09,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:20:09,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-01 23:20:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2024-12-01 23:20:09,164 INFO L87 Difference]: Start difference. First operand 21999 states and 27397 transitions. Second operand has 40 states, 40 states have (on average 7.3) internal successors, (292), 40 states have internal predecessors, (292), 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) [2024-12-01 23:20:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:20:15,071 INFO L93 Difference]: Finished difference Result 49728 states and 60780 transitions. [2024-12-01 23:20:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-01 23:20:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.3) internal successors, (292), 40 states have internal predecessors, (292), 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 [2024-12-01 23:20:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:20:15,095 INFO L225 Difference]: With dead ends: 49728 [2024-12-01 23:20:15,095 INFO L226 Difference]: Without dead ends: 34435 [2024-12-01 23:20:15,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=972, Invalid=4140, Unknown=0, NotChecked=0, Total=5112 [2024-12-01 23:20:15,103 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 25867 mSDsluCounter, 17764 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25867 SdHoareTripleChecker+Valid, 19335 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-01 23:20:15,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25867 Valid, 19335 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-01 23:20:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34435 states. [2024-12-01 23:20:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34435 to 27308. [2024-12-01 23:20:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27308 states, 27306 states have (on average 1.2320002929759026) internal successors, (33641), 27307 states have internal predecessors, (33641), 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) [2024-12-01 23:20:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27308 states to 27308 states and 33641 transitions. [2024-12-01 23:20:18,285 INFO L78 Accepts]: Start accepts. Automaton has 27308 states and 33641 transitions. Word has length 107 [2024-12-01 23:20:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:20:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 27308 states and 33641 transitions. [2024-12-01 23:20:18,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.3) internal successors, (292), 40 states have internal predecessors, (292), 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) [2024-12-01 23:20:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 27308 states and 33641 transitions. [2024-12-01 23:20:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-01 23:20:18,287 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:20:18,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:20:18,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-01 23:20:18,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:20:18,487 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:20:18,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:20:18,488 INFO L85 PathProgramCache]: Analyzing trace with hash 117034249, now seen corresponding path program 1 times [2024-12-01 23:20:18,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:20:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100828410] [2024-12-01 23:20:18,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:20:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:20:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:20:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:20:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:20:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100828410] [2024-12-01 23:20:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100828410] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:20:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028226040] [2024-12-01 23:20:20,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:20:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:20:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:20:20,012 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:20:20,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-01 23:20:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:20:20,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-12-01 23:20:20,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:20:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:20:24,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:20:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:20:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028226040] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:20:30,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:20:30,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 23] total 77 [2024-12-01 23:20:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428484395] [2024-12-01 23:20:30,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:20:30,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-12-01 23:20:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:20:30,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-12-01 23:20:30,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=5434, Unknown=0, NotChecked=0, Total=5852 [2024-12-01 23:20:30,968 INFO L87 Difference]: Start difference. First operand 27308 states and 33641 transitions. Second operand has 77 states, 77 states have (on average 3.792207792207792) internal successors, (292), 77 states have internal predecessors, (292), 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) [2024-12-01 23:21:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:21:43,995 INFO L93 Difference]: Finished difference Result 49865 states and 60556 transitions. [2024-12-01 23:21:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-12-01 23:21:43,995 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.792207792207792) internal successors, (292), 77 states have internal predecessors, (292), 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 [2024-12-01 23:21:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:21:44,020 INFO L225 Difference]: With dead ends: 49865 [2024-12-01 23:21:44,020 INFO L226 Difference]: Without dead ends: 32282 [2024-12-01 23:21:44,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23641 ImplicationChecksByTransitivity, 67.0s TimeCoverageRelationStatistics Valid=9158, Invalid=57664, Unknown=0, NotChecked=0, Total=66822 [2024-12-01 23:21:44,030 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 30546 mSDsluCounter, 44088 mSDsCounter, 0 mSdLazyCounter, 6143 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30546 SdHoareTripleChecker+Valid, 45726 SdHoareTripleChecker+Invalid, 6376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 6143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-12-01 23:21:44,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30546 Valid, 45726 Invalid, 6376 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [233 Valid, 6143 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-12-01 23:21:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32282 states. [2024-12-01 23:21:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32282 to 27603. [2024-12-01 23:21:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27603 states, 27601 states have (on average 1.2298829752545197) internal successors, (33946), 27602 states have internal predecessors, (33946), 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) [2024-12-01 23:21:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27603 states to 27603 states and 33946 transitions. [2024-12-01 23:21:47,743 INFO L78 Accepts]: Start accepts. Automaton has 27603 states and 33946 transitions. Word has length 107 [2024-12-01 23:21:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:21:47,743 INFO L471 AbstractCegarLoop]: Abstraction has 27603 states and 33946 transitions. [2024-12-01 23:21:47,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.792207792207792) internal successors, (292), 77 states have internal predecessors, (292), 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) [2024-12-01 23:21:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27603 states and 33946 transitions. [2024-12-01 23:21:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-01 23:21:47,744 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:21:47,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:21:47,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-01 23:21:47,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:21:47,945 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:21:47,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:21:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1360080118, now seen corresponding path program 1 times [2024-12-01 23:21:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:21:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415893329] [2024-12-01 23:21:47,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:21:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:21:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:21:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:21:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:21:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415893329] [2024-12-01 23:21:49,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415893329] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:21:49,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044799421] [2024-12-01 23:21:49,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:21:49,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:21:49,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:21:49,030 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:21:49,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-01 23:21:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:21:49,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-01 23:21:49,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:21:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:21:52,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:22:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:22:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044799421] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:22:00,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:22:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 28] total 76 [2024-12-01 23:22:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273458809] [2024-12-01 23:22:00,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:22:00,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-01 23:22:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:22:00,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-01 23:22:00,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=5042, Unknown=0, NotChecked=0, Total=5700 [2024-12-01 23:22:00,092 INFO L87 Difference]: Start difference. First operand 27603 states and 33946 transitions. Second operand has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 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) [2024-12-01 23:22:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:22:52,788 INFO L93 Difference]: Finished difference Result 49626 states and 60238 transitions. [2024-12-01 23:22:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-12-01 23:22:52,788 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 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 108 [2024-12-01 23:22:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:22:52,813 INFO L225 Difference]: With dead ends: 49626 [2024-12-01 23:22:52,813 INFO L226 Difference]: Without dead ends: 32290 [2024-12-01 23:22:52,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18130 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=9606, Invalid=46326, Unknown=0, NotChecked=0, Total=55932 [2024-12-01 23:22:52,823 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 32561 mSDsluCounter, 34585 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32561 SdHoareTripleChecker+Valid, 36142 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:22:52,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32561 Valid, 36142 Invalid, 3603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [201 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-01 23:22:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32290 states. [2024-12-01 23:22:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32290 to 26466. [2024-12-01 23:22:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26466 states, 26464 states have (on average 1.2326178960096734) internal successors, (32620), 26465 states have internal predecessors, (32620), 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) [2024-12-01 23:22:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26466 states to 26466 states and 32620 transitions. [2024-12-01 23:22:56,533 INFO L78 Accepts]: Start accepts. Automaton has 26466 states and 32620 transitions. Word has length 108 [2024-12-01 23:22:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:22:56,534 INFO L471 AbstractCegarLoop]: Abstraction has 26466 states and 32620 transitions. [2024-12-01 23:22:56,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 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) [2024-12-01 23:22:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26466 states and 32620 transitions. [2024-12-01 23:22:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-01 23:22:56,534 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:22:56,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:22:56,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-12-01 23:22:56,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:22:56,735 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:22:56,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:22:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash 896728914, now seen corresponding path program 1 times [2024-12-01 23:22:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:22:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200210493] [2024-12-01 23:22:56,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:22:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:22:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:22:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:22:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:22:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200210493] [2024-12-01 23:22:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200210493] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:22:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882377816] [2024-12-01 23:22:58,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:22:58,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:22:58,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:22:58,184 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:22:58,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-01 23:22:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:22:58,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-01 23:22:58,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:23:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:23:01,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:23:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:23:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882377816] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:23:07,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:23:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 26] total 75 [2024-12-01 23:23:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867434579] [2024-12-01 23:23:07,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:23:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-12-01 23:23:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:23:07,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-12-01 23:23:07,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=5136, Unknown=0, NotChecked=0, Total=5550 [2024-12-01 23:23:07,706 INFO L87 Difference]: Start difference. First operand 26466 states and 32620 transitions. Second operand has 75 states, 75 states have (on average 3.84) internal successors, (288), 75 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) [2024-12-01 23:24:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:24:20,791 INFO L93 Difference]: Finished difference Result 38396 states and 46848 transitions. [2024-12-01 23:24:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-12-01 23:24:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.84) internal successors, (288), 75 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 108 [2024-12-01 23:24:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:24:20,812 INFO L225 Difference]: With dead ends: 38396 [2024-12-01 23:24:20,812 INFO L226 Difference]: Without dead ends: 29880 [2024-12-01 23:24:20,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21772 ImplicationChecksByTransitivity, 68.1s TimeCoverageRelationStatistics Valid=9343, Invalid=57997, Unknown=0, NotChecked=0, Total=67340 [2024-12-01 23:24:20,819 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 37781 mSDsluCounter, 32113 mSDsCounter, 0 mSdLazyCounter, 4060 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37781 SdHoareTripleChecker+Valid, 33677 SdHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 4060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-12-01 23:24:20,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37781 Valid, 33677 Invalid, 4267 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [207 Valid, 4060 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-01 23:24:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29880 states. [2024-12-01 23:24:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29880 to 27064. [2024-12-01 23:24:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27064 states, 27062 states have (on average 1.2303229620870593) internal successors, (33295), 27063 states have internal predecessors, (33295), 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) [2024-12-01 23:24:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27064 states to 27064 states and 33295 transitions. [2024-12-01 23:24:24,795 INFO L78 Accepts]: Start accepts. Automaton has 27064 states and 33295 transitions. Word has length 108 [2024-12-01 23:24:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:24:24,795 INFO L471 AbstractCegarLoop]: Abstraction has 27064 states and 33295 transitions. [2024-12-01 23:24:24,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.84) internal successors, (288), 75 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) [2024-12-01 23:24:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 27064 states and 33295 transitions. [2024-12-01 23:24:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-01 23:24:24,796 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:24:24,796 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-12-01 23:24:24,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-12-01 23:24:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:24:24,996 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:24:24,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:24:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1964330765, now seen corresponding path program 1 times [2024-12-01 23:24:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:24:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140326569] [2024-12-01 23:24:24,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:24:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:24:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:24:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:24:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:24:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140326569] [2024-12-01 23:24:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140326569] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:24:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136008737] [2024-12-01 23:24:26,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:24:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:24:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:24:26,390 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:24:26,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-01 23:24:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:24:26,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-01 23:24:26,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:24:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:24:31,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:24:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:24:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136008737] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:24:36,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:24:36,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2024-12-01 23:24:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815923441] [2024-12-01 23:24:36,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:24:36,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-12-01 23:24:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:24:36,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-12-01 23:24:36,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=4884, Unknown=0, NotChecked=0, Total=5256 [2024-12-01 23:24:36,472 INFO L87 Difference]: Start difference. First operand 27064 states and 33295 transitions. Second operand has 73 states, 73 states have (on average 4.232876712328767) internal successors, (309), 73 states have internal predecessors, (309), 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) [2024-12-01 23:25:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:25:31,745 INFO L93 Difference]: Finished difference Result 47701 states and 58030 transitions. [2024-12-01 23:25:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-12-01 23:25:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.232876712328767) internal successors, (309), 73 states have internal predecessors, (309), 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 109 [2024-12-01 23:25:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:25:31,768 INFO L225 Difference]: With dead ends: 47701 [2024-12-01 23:25:31,769 INFO L226 Difference]: Without dead ends: 29201 [2024-12-01 23:25:31,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11546 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=5041, Invalid=37601, Unknown=0, NotChecked=0, Total=42642 [2024-12-01 23:25:31,779 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 35672 mSDsluCounter, 40650 mSDsCounter, 0 mSdLazyCounter, 5661 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35672 SdHoareTripleChecker+Valid, 42260 SdHoareTripleChecker+Invalid, 5888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 5661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-12-01 23:25:31,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35672 Valid, 42260 Invalid, 5888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [227 Valid, 5661 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-12-01 23:25:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29201 states. [2024-12-01 23:25:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29201 to 23209. [2024-12-01 23:25:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23209 states, 23207 states have (on average 1.2385487137501616) internal successors, (28743), 23208 states have internal predecessors, (28743), 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) [2024-12-01 23:25:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23209 states to 23209 states and 28743 transitions. [2024-12-01 23:25:35,682 INFO L78 Accepts]: Start accepts. Automaton has 23209 states and 28743 transitions. Word has length 109 [2024-12-01 23:25:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:25:35,682 INFO L471 AbstractCegarLoop]: Abstraction has 23209 states and 28743 transitions. [2024-12-01 23:25:35,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.232876712328767) internal successors, (309), 73 states have internal predecessors, (309), 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) [2024-12-01 23:25:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 23209 states and 28743 transitions. [2024-12-01 23:25:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-01 23:25:35,683 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:25:35,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:25:35,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-12-01 23:25:35,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:25:35,884 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:25:35,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:25:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1787027792, now seen corresponding path program 1 times [2024-12-01 23:25:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:25:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199060062] [2024-12-01 23:25:35,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:25:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:25:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:25:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:25:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:25:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199060062] [2024-12-01 23:25:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199060062] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:25:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:25:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:25:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572561936] [2024-12-01 23:25:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:25:35,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:25:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:25:35,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:25:35,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:25:35,944 INFO L87 Difference]: Start difference. First operand 23209 states and 28743 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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) [2024-12-01 23:25:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:25:42,794 INFO L93 Difference]: Finished difference Result 26215 states and 34366 transitions. [2024-12-01 23:25:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:25:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 134 [2024-12-01 23:25:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:25:42,811 INFO L225 Difference]: With dead ends: 26215 [2024-12-01 23:25:42,812 INFO L226 Difference]: Without dead ends: 24711 [2024-12-01 23:25:42,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:25:42,816 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:25:42,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 564 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-01 23:25:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24711 states. [2024-12-01 23:25:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24711 to 24711. [2024-12-01 23:25:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24711 states, 24709 states have (on average 1.2417742522967339) internal successors, (30683), 24710 states have internal predecessors, (30683), 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) [2024-12-01 23:25:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24711 states to 24711 states and 30683 transitions. [2024-12-01 23:25:46,702 INFO L78 Accepts]: Start accepts. Automaton has 24711 states and 30683 transitions. Word has length 134 [2024-12-01 23:25:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:25:46,703 INFO L471 AbstractCegarLoop]: Abstraction has 24711 states and 30683 transitions. [2024-12-01 23:25:46,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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) [2024-12-01 23:25:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 24711 states and 30683 transitions. [2024-12-01 23:25:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-01 23:25:46,704 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:25:46,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:25:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-01 23:25:46,704 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:25:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:25:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 129702219, now seen corresponding path program 1 times [2024-12-01 23:25:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:25:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442763018] [2024-12-01 23:25:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:25:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:25:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:25:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:25:46,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:25:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442763018] [2024-12-01 23:25:46,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442763018] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:25:46,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:25:46,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:25:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005382519] [2024-12-01 23:25:46,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:25:46,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:25:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:25:46,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:25:46,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:25:46,749 INFO L87 Difference]: Start difference. First operand 24711 states and 30683 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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) [2024-12-01 23:25:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:25:53,762 INFO L93 Difference]: Finished difference Result 30723 states and 40187 transitions. [2024-12-01 23:25:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:25:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 [2024-12-01 23:25:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:25:53,782 INFO L225 Difference]: With dead ends: 30723 [2024-12-01 23:25:53,783 INFO L226 Difference]: Without dead ends: 27717 [2024-12-01 23:25:53,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:25:53,788 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 985 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:25:53,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 622 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-01 23:25:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27717 states. [2024-12-01 23:25:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27717 to 27715. [2024-12-01 23:25:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27715 states, 27713 states have (on average 1.2474290044383503) internal successors, (34570), 27714 states have internal predecessors, (34570), 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) [2024-12-01 23:25:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27715 states to 27715 states and 34570 transitions. [2024-12-01 23:25:57,678 INFO L78 Accepts]: Start accepts. Automaton has 27715 states and 34570 transitions. Word has length 136 [2024-12-01 23:25:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:25:57,678 INFO L471 AbstractCegarLoop]: Abstraction has 27715 states and 34570 transitions. [2024-12-01 23:25:57,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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) [2024-12-01 23:25:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 27715 states and 34570 transitions. [2024-12-01 23:25:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-01 23:25:57,680 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:25:57,680 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2024-12-01 23:25:57,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-01 23:25:57,680 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:25:57,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:25:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 289672907, now seen corresponding path program 1 times [2024-12-01 23:25:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:25:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656102811] [2024-12-01 23:25:57,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:25:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:25:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:25:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 37 proven. 190 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-01 23:25:58,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:25:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656102811] [2024-12-01 23:25:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656102811] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:25:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279016687] [2024-12-01 23:25:58,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:25:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:25:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:25:58,200 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:25:58,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-01 23:25:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:25:58,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-01 23:25:58,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:26:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 37 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:26:00,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:26:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 37 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:26:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279016687] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:26:07,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:26:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28, 27] total 59 [2024-12-01 23:26:07,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145774874] [2024-12-01 23:26:07,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:26:07,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-01 23:26:07,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:26:07,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-01 23:26:07,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2024-12-01 23:26:07,913 INFO L87 Difference]: Start difference. First operand 27715 states and 34570 transitions. Second operand has 60 states, 60 states have (on average 6.05) internal successors, (363), 59 states have internal predecessors, (363), 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) [2024-12-01 23:26:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:26:17,594 INFO L93 Difference]: Finished difference Result 45400 states and 56148 transitions. [2024-12-01 23:26:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-12-01 23:26:17,595 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.05) internal successors, (363), 59 states have internal predecessors, (363), 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 146 [2024-12-01 23:26:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:26:17,618 INFO L225 Difference]: With dead ends: 45400 [2024-12-01 23:26:17,618 INFO L226 Difference]: Without dead ends: 35043 [2024-12-01 23:26:17,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2440, Invalid=9992, Unknown=0, NotChecked=0, Total=12432 [2024-12-01 23:26:17,625 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 16934 mSDsluCounter, 24749 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16934 SdHoareTripleChecker+Valid, 26282 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:26:17,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16934 Valid, 26282 Invalid, 2113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-01 23:26:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35043 states. [2024-12-01 23:26:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35043 to 22746. [2024-12-01 23:26:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22746 states, 22744 states have (on average 1.2501319029194513) internal successors, (28433), 22745 states have internal predecessors, (28433), 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) [2024-12-01 23:26:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22746 states to 22746 states and 28433 transitions. [2024-12-01 23:26:20,810 INFO L78 Accepts]: Start accepts. Automaton has 22746 states and 28433 transitions. Word has length 146 [2024-12-01 23:26:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:26:20,810 INFO L471 AbstractCegarLoop]: Abstraction has 22746 states and 28433 transitions. [2024-12-01 23:26:20,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.05) internal successors, (363), 59 states have internal predecessors, (363), 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) [2024-12-01 23:26:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 22746 states and 28433 transitions. [2024-12-01 23:26:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-01 23:26:20,812 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:26:20,812 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:26:20,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-01 23:26:21,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-01 23:26:21,012 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:26:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:26:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 283574013, now seen corresponding path program 1 times [2024-12-01 23:26:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:26:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858494372] [2024-12-01 23:26:21,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:26:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:26:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:26:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 55 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-01 23:26:21,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:26:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858494372] [2024-12-01 23:26:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858494372] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:26:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110947876] [2024-12-01 23:26:21,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:26:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:26:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:26:21,766 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:26:21,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-01 23:26:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:26:21,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-01 23:26:21,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:26:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 50 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:26:23,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:26:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 44 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:26:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110947876] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:26:29,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:26:29,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 20] total 60 [2024-12-01 23:26:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829407176] [2024-12-01 23:26:29,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:26:29,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-01 23:26:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:26:29,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-01 23:26:29,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3223, Unknown=0, NotChecked=0, Total=3540 [2024-12-01 23:26:29,744 INFO L87 Difference]: Start difference. First operand 22746 states and 28433 transitions. Second operand has 60 states, 60 states have (on average 6.833333333333333) internal successors, (410), 60 states have internal predecessors, (410), 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) [2024-12-01 23:26:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:26:57,195 INFO L93 Difference]: Finished difference Result 50980 states and 61929 transitions. [2024-12-01 23:26:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-12-01 23:26:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.833333333333333) internal successors, (410), 60 states have internal predecessors, (410), 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 146 [2024-12-01 23:26:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:26:57,227 INFO L225 Difference]: With dead ends: 50980 [2024-12-01 23:26:57,227 INFO L226 Difference]: Without dead ends: 37911 [2024-12-01 23:26:57,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8251 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=4683, Invalid=25419, Unknown=0, NotChecked=0, Total=30102 [2024-12-01 23:26:57,235 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 23520 mSDsluCounter, 39140 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23520 SdHoareTripleChecker+Valid, 40663 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:26:57,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23520 Valid, 40663 Invalid, 2767 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [190 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-01 23:26:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37911 states. [2024-12-01 23:27:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37911 to 31737. [2024-12-01 23:27:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31737 states, 31735 states have (on average 1.2256814242949425) internal successors, (38897), 31736 states have internal predecessors, (38897), 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) [2024-12-01 23:27:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31737 states to 31737 states and 38897 transitions. [2024-12-01 23:27:03,156 INFO L78 Accepts]: Start accepts. Automaton has 31737 states and 38897 transitions. Word has length 146 [2024-12-01 23:27:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:27:03,156 INFO L471 AbstractCegarLoop]: Abstraction has 31737 states and 38897 transitions. [2024-12-01 23:27:03,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.833333333333333) internal successors, (410), 60 states have internal predecessors, (410), 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) [2024-12-01 23:27:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 31737 states and 38897 transitions. [2024-12-01 23:27:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-01 23:27:03,158 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:27:03,158 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2024-12-01 23:27:03,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-01 23:27:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-01 23:27:03,359 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:27:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:27:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1346272192, now seen corresponding path program 1 times [2024-12-01 23:27:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:27:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328367512] [2024-12-01 23:27:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:27:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:27:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:27:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-01 23:27:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:27:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328367512] [2024-12-01 23:27:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328367512] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:27:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697439891] [2024-12-01 23:27:04,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:27:04,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:27:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:27:04,629 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:27:04,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-01 23:27:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:27:04,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-01 23:27:04,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:27:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 37 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:27:07,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:27:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 37 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:27:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697439891] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:27:10,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:27:10,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 18] total 60 [2024-12-01 23:27:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863412246] [2024-12-01 23:27:10,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:27:10,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-01 23:27:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:27:10,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-01 23:27:10,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3312, Unknown=0, NotChecked=0, Total=3540 [2024-12-01 23:27:10,806 INFO L87 Difference]: Start difference. First operand 31737 states and 38897 transitions. Second operand has 60 states, 60 states have (on average 6.733333333333333) internal successors, (404), 60 states have internal predecessors, (404), 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) [2024-12-01 23:27:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:27:54,871 INFO L93 Difference]: Finished difference Result 48726 states and 58917 transitions. [2024-12-01 23:27:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2024-12-01 23:27:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.733333333333333) internal successors, (404), 60 states have internal predecessors, (404), 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 147 [2024-12-01 23:27:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:27:54,900 INFO L225 Difference]: With dead ends: 48726 [2024-12-01 23:27:54,900 INFO L226 Difference]: Without dead ends: 31502 [2024-12-01 23:27:54,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16408 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=8009, Invalid=45583, Unknown=0, NotChecked=0, Total=53592 [2024-12-01 23:27:54,912 INFO L435 NwaCegarLoop]: 1689 mSDtfsCounter, 31562 mSDsluCounter, 43086 mSDsCounter, 0 mSdLazyCounter, 6495 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31562 SdHoareTripleChecker+Valid, 44775 SdHoareTripleChecker+Invalid, 6645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 6495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:27:54,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31562 Valid, 44775 Invalid, 6645 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [150 Valid, 6495 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-12-01 23:27:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31502 states. [2024-12-01 23:27:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31502 to 27293. [2024-12-01 23:27:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27293 states, 27291 states have (on average 1.2334102817778756) internal successors, (33661), 27292 states have internal predecessors, (33661), 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) [2024-12-01 23:27:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27293 states to 27293 states and 33661 transitions. [2024-12-01 23:27:59,862 INFO L78 Accepts]: Start accepts. Automaton has 27293 states and 33661 transitions. Word has length 147 [2024-12-01 23:27:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:27:59,862 INFO L471 AbstractCegarLoop]: Abstraction has 27293 states and 33661 transitions. [2024-12-01 23:27:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.733333333333333) internal successors, (404), 60 states have internal predecessors, (404), 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) [2024-12-01 23:27:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27293 states and 33661 transitions. [2024-12-01 23:27:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-01 23:27:59,864 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:27:59,864 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1] [2024-12-01 23:27:59,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-12-01 23:28:00,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:28:00,065 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:28:00,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:28:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -970975155, now seen corresponding path program 1 times [2024-12-01 23:28:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:28:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860939593] [2024-12-01 23:28:00,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:28:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:28:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:28:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 20 proven. 199 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-01 23:28:00,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:28:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860939593] [2024-12-01 23:28:00,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860939593] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:28:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628454430] [2024-12-01 23:28:00,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:28:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:28:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:28:00,189 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:28:00,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-12-01 23:28:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:28:00,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-01 23:28:00,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:28:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 20 proven. 199 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-01 23:28:00,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:28:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-01 23:28:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628454430] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:28:00,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:28:00,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2024-12-01 23:28:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360278510] [2024-12-01 23:28:00,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:28:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-01 23:28:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:28:00,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-01 23:28:00,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-12-01 23:28:00,993 INFO L87 Difference]: Start difference. First operand 27293 states and 33661 transitions. Second operand has 17 states, 17 states have (on average 16.647058823529413) internal successors, (283), 17 states have internal predecessors, (283), 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) [2024-12-01 23:28:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:28:05,477 INFO L93 Difference]: Finished difference Result 52290 states and 64777 transitions. [2024-12-01 23:28:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-01 23:28:05,477 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.647058823529413) internal successors, (283), 17 states have internal predecessors, (283), 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 148 [2024-12-01 23:28:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:28:05,503 INFO L225 Difference]: With dead ends: 52290 [2024-12-01 23:28:05,503 INFO L226 Difference]: Without dead ends: 31748 [2024-12-01 23:28:05,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-12-01 23:28:05,512 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 4637 mSDsluCounter, 8014 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 9586 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:28:05,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 9586 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:28:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2024-12-01 23:28:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31744. [2024-12-01 23:28:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31744 states, 31742 states have (on average 1.2066347426123119) internal successors, (38301), 31743 states have internal predecessors, (38301), 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) [2024-12-01 23:28:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 38301 transitions. [2024-12-01 23:28:10,266 INFO L78 Accepts]: Start accepts. Automaton has 31744 states and 38301 transitions. Word has length 148 [2024-12-01 23:28:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:28:10,266 INFO L471 AbstractCegarLoop]: Abstraction has 31744 states and 38301 transitions. [2024-12-01 23:28:10,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.647058823529413) internal successors, (283), 17 states have internal predecessors, (283), 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) [2024-12-01 23:28:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31744 states and 38301 transitions. [2024-12-01 23:28:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-01 23:28:10,267 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:28:10,267 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:28:10,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-12-01 23:28:10,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:28:10,468 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:28:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:28:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -352711843, now seen corresponding path program 1 times [2024-12-01 23:28:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:28:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402740369] [2024-12-01 23:28:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:28:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:28:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:28:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 53 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:28:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:28:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402740369] [2024-12-01 23:28:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402740369] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:28:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747556142] [2024-12-01 23:28:11,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:28:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:28:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:28:11,766 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:28:11,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-12-01 23:28:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:28:11,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-01 23:28:11,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:28:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 53 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:28:14,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:28:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 53 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:28:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747556142] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:28:17,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:28:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 19] total 62 [2024-12-01 23:28:17,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684556063] [2024-12-01 23:28:17,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:28:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-01 23:28:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:28:17,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-01 23:28:17,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3490, Unknown=0, NotChecked=0, Total=3782 [2024-12-01 23:28:17,808 INFO L87 Difference]: Start difference. First operand 31744 states and 38301 transitions. Second operand has 62 states, 62 states have (on average 6.290322580645161) internal successors, (390), 62 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) [2024-12-01 23:29:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:29:18,408 INFO L93 Difference]: Finished difference Result 51553 states and 61256 transitions. [2024-12-01 23:29:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2024-12-01 23:29:18,409 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 6.290322580645161) internal successors, (390), 62 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) Word has length 148 [2024-12-01 23:29:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:29:18,436 INFO L225 Difference]: With dead ends: 51553 [2024-12-01 23:29:18,436 INFO L226 Difference]: Without dead ends: 30648 [2024-12-01 23:29:18,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25932 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=12437, Invalid=59655, Unknown=0, NotChecked=0, Total=72092 [2024-12-01 23:29:18,447 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 46252 mSDsluCounter, 23370 mSDsCounter, 0 mSdLazyCounter, 3353 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46252 SdHoareTripleChecker+Valid, 24938 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 3353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-01 23:29:18,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46252 Valid, 24938 Invalid, 3522 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [169 Valid, 3353 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-01 23:29:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30648 states. [2024-12-01 23:29:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30648 to 21456. [2024-12-01 23:29:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21456 states, 21454 states have (on average 1.2282091917591125) internal successors, (26350), 21455 states have internal predecessors, (26350), 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) [2024-12-01 23:29:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 26350 transitions. [2024-12-01 23:29:21,457 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 26350 transitions. Word has length 148 [2024-12-01 23:29:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:29:21,457 INFO L471 AbstractCegarLoop]: Abstraction has 21456 states and 26350 transitions. [2024-12-01 23:29:21,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 6.290322580645161) internal successors, (390), 62 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) [2024-12-01 23:29:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 26350 transitions. [2024-12-01 23:29:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-01 23:29:21,459 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:29:21,459 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:29:21,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-12-01 23:29:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:29:21,659 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 23:29:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:29:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash 666783477, now seen corresponding path program 1 times [2024-12-01 23:29:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:29:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9319028] [2024-12-01 23:29:21,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:29:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:29:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-01 23:29:21,687 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-01 23:29:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-01 23:29:21,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-01 23:29:21,745 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-01 23:29:21,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-12-01 23:29:21,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-01 23:29:21,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-01 23:29:21,752 INFO L422 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, 1, 1, 1, 1, 1] [2024-12-01 23:29:21,892 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-01 23:29:21,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 11:29:21 BoogieIcfgContainer [2024-12-01 23:29:21,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-01 23:29:21,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-01 23:29:21,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-01 23:29:21,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-01 23:29:21,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:15:56" (3/4) ... [2024-12-01 23:29:21,898 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-01 23:29:22,069 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 154. [2024-12-01 23:29:22,183 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-01 23:29:22,185 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-01 23:29:22,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-01 23:29:22,186 INFO L158 Benchmark]: Toolchain (without parser) took 812067.62ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 102.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-12-01 23:29:22,186 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-01 23:29:22,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1473.00ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 49.7MB in the end (delta: 52.9MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2024-12-01 23:29:22,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 329.19ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 49.7MB in the beginning and 160.0MB in the end (delta: -110.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-12-01 23:29:22,186 INFO L158 Benchmark]: Boogie Preprocessor took 431.26ms. Allocated memory is still 285.2MB. Free memory was 160.0MB in the beginning and 166.9MB in the end (delta: -6.8MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2024-12-01 23:29:22,187 INFO L158 Benchmark]: RCFGBuilder took 4603.57ms. Allocated memory was 285.2MB in the beginning and 570.4MB in the end (delta: 285.2MB). Free memory was 166.9MB in the beginning and 188.4MB in the end (delta: -21.5MB). Peak memory consumption was 284.5MB. Max. memory is 16.1GB. [2024-12-01 23:29:22,187 INFO L158 Benchmark]: TraceAbstraction took 804935.01ms. Allocated memory was 570.4MB in the beginning and 3.9GB in the end (delta: 3.3GB). Free memory was 188.4MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-12-01 23:29:22,187 INFO L158 Benchmark]: Witness Printer took 288.91ms. Allocated memory is still 3.9GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-01 23:29:22,188 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.29ms. Allocated memory is still 142.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1473.00ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 49.7MB in the end (delta: 52.9MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 329.19ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 49.7MB in the beginning and 160.0MB in the end (delta: -110.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 431.26ms. Allocated memory is still 285.2MB. Free memory was 160.0MB in the beginning and 166.9MB in the end (delta: -6.8MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. * RCFGBuilder took 4603.57ms. Allocated memory was 285.2MB in the beginning and 570.4MB in the end (delta: 285.2MB). Free memory was 166.9MB in the beginning and 188.4MB in the end (delta: -21.5MB). Peak memory consumption was 284.5MB. Max. memory is 16.1GB. * TraceAbstraction took 804935.01ms. Allocated memory was 570.4MB in the beginning and 3.9GB in the end (delta: 3.3GB). Free memory was 188.4MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 288.91ms. Allocated memory is still 3.9GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. 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: 297]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] msg_t nomsg = (msg_t )-1; [L39] unsigned char r1 ; [L40] port_t p1 ; [L41] char p1_old ; [L42] char p1_new ; [L43] char id1 ; [L44] char st1 ; [L45] msg_t send1 ; [L46] _Bool mode1 ; [L47] port_t p2 ; [L48] char p2_old ; [L49] char p2_new ; [L50] char id2 ; [L51] char st2 ; [L52] msg_t send2 ; [L53] _Bool mode2 ; [L54] port_t p3 ; [L55] char p3_old ; [L56] char p3_new ; [L57] char id3 ; [L58] char st3 ; [L59] msg_t send3 ; [L60] _Bool mode3 ; [L313] int inputC = 3; [L314] int inputF = 6; [L315] int inputA = 1; [L316] int inputB = 2; [L317] int inputD = 4; [L318] int inputE = 5; [L321] int a17 = -124; [L322] int a5 = 4; [L323] int a24 = 15; [L324] int a2 = 170; [L325] int a7 = 13; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=0, id2=0, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send3=0, st1=0, st2=0, st3=0] [L5133] COND TRUE __VERIFIER_nondet_int() [L5134] CALL main1() [L245] int c1 ; [L246] int i2 ; [L249] c1 = 0 [L250] r1 = __VERIFIER_nondet_uchar() [L251] id1 = __VERIFIER_nondet_char() [L252] st1 = __VERIFIER_nondet_char() [L253] send1 = __VERIFIER_nondet_char() [L254] mode1 = __VERIFIER_nondet_bool() [L255] id2 = __VERIFIER_nondet_char() [L256] st2 = __VERIFIER_nondet_char() [L257] send2 = __VERIFIER_nondet_char() [L258] mode2 = __VERIFIER_nondet_bool() [L259] id3 = __VERIFIER_nondet_char() [L260] st3 = __VERIFIER_nondet_char() [L261] send3 = __VERIFIER_nondet_char() [L262] mode3 = __VERIFIER_nondet_bool() [L263] CALL, EXPR init() [L144] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L147] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L148] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L149] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L150] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L151] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L152] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L153] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L154] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L155] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L156] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L157] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L158] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L159] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L160] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L161] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L162] COND TRUE (int )id2 != (int )id3 [L163] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0, tmp=1] [L212] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L263] RET, EXPR init() [L263] i2 = init() [L264] CALL assume_abort_if_not(i2) [L32] COND FALSE !(!cond) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L264] RET assume_abort_if_not(i2) [L265] p1_old = nomsg [L266] p1_new = nomsg [L267] p2_old = nomsg [L268] p2_new = nomsg [L269] p3_old = nomsg [L270] p3_new = nomsg [L271] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L78] COND FALSE !((int )m1 == (int )id1) [L81] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=5, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=5, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L102] COND TRUE (int )m2 > (int )id2 [L103] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=4, 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=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=4, 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=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L78] COND FALSE !((int )m1 == (int )id1) [L81] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L102] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L105] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, 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=5, send3=4, st1=0, st2=0, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, 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=5, send3=4, st1=0, st2=0, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=5, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L78] COND TRUE (int )m1 == (int )id1 [L79] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L102] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L105] COND TRUE (int )m2 == (int )id2 [L106] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, 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=5, send3=5, st1=1, st2=1, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, 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=5, send3=5, st1=1, st2=1, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0] [L220] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L238] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0, tmp=0] [L240] return (tmp); VAL [\result=0, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND TRUE ! arg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0] [L297] reach_error() VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=5, send3=5, st1=1, st2=1, st3=0] - UnprovableResult [Line: 495]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 874 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 804.7s, OverallIterations: 44, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 586.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 603993 SdHoareTripleChecker+Valid, 60.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603993 mSDsluCounter, 687257 SdHoareTripleChecker+Invalid, 53.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 623966 mSDsCounter, 4981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68305 IncrementalHoareTripleChecker+Invalid, 73286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4981 mSolverCounterUnsat, 63291 mSDtfsCounter, 68305 mSolverCounterSat, 2.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7816 GetRequests, 4395 SyntacticMatches, 10 SemanticMatches, 3411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195732 ImplicationChecksByTransitivity, 496.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31744occurred in iteration=42, InterpolantAutomatonStates: 2381, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 58.3s AutomataMinimizationTime, 43 MinimizatonAttempts, 109047 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 149.8s InterpolantComputationTime, 6221 NumberOfCodeBlocks, 6221 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 8530 ConstructedInterpolants, 10 QuantifiedInterpolants, 195048 SizeOfPredicates, 180 NumberOfNonLiveVariables, 10480 ConjunctsInSsa, 806 ConjunctsInUnsatCore, 93 InterpolantComputations, 18 PerfectInterpolantSequences, 2509/7755 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-01 23:29:22,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ce974d8-2106-4218-9d83-9eff39e75df9/bin/uautomizer-verify-84ZbGMXZE1/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