./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.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_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/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_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/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_59ffb552-17fd-439b-a2a3-1224a6720944/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 6325d9fccdba44ffb7ef0e133bfabfb6d285a7f8e20c4133b9b681e02437a24c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 12:37:05,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 12:37:05,127 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 12:37:05,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 12:37:05,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 12:37:05,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 12:37:05,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 12:37:05,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 12:37:05,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 12:37:05,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 12:37:05,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 12:37:05,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 12:37:05,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 12:37:05,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 12:37:05,152 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 12:37:05,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 12:37:05,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 12:37:05,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:37:05,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:37:05,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:37:05,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 12:37:05,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 12:37:05,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 12:37:05,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 12:37:05,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 12:37:05,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 12:37:05,156 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_59ffb552-17fd-439b-a2a3-1224a6720944/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 -> 6325d9fccdba44ffb7ef0e133bfabfb6d285a7f8e20c4133b9b681e02437a24c [2024-12-02 12:37:05,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 12:37:05,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 12:37:05,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 12:37:05,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 12:37:05,362 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 12:37:05,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-12-02 12:37:07,991 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/data/b7a1837f5/106717ede5c94a518e6773b370604b47/FLAG5c9271c9b [2024-12-02 12:37:08,429 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 12:37:08,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-12-02 12:37:08,455 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/data/b7a1837f5/106717ede5c94a518e6773b370604b47/FLAG5c9271c9b [2024-12-02 12:37:08,584 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/data/b7a1837f5/106717ede5c94a518e6773b370604b47 [2024-12-02 12:37:08,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 12:37:08,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 12:37:08,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 12:37:08,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 12:37:08,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 12:37:08,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:08" (1/1) ... [2024-12-02 12:37:08,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb48fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:08, skipping insertion in model container [2024-12-02 12:37:08,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:08" (1/1) ... [2024-12-02 12:37:08,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 12:37:08,899 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_59ffb552-17fd-439b-a2a3-1224a6720944/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2024-12-02 12:37:08,953 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_59ffb552-17fd-439b-a2a3-1224a6720944/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2024-12-02 12:37:09,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:37:09,536 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 12:37:09,559 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_59ffb552-17fd-439b-a2a3-1224a6720944/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2024-12-02 12:37:09,572 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_59ffb552-17fd-439b-a2a3-1224a6720944/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2024-12-02 12:37:10,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:37:10,059 INFO L204 MainTranslator]: Completed translation [2024-12-02 12:37:10,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10 WrapperNode [2024-12-02 12:37:10,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 12:37:10,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 12:37:10,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 12:37:10,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 12:37:10,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,418 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4982 [2024-12-02 12:37:10,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 12:37:10,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 12:37:10,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 12:37:10,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 12:37:10,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,611 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-02 12:37:10,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 12:37:10,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 12:37:10,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 12:37:10,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 12:37:10,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (1/1) ... [2024-12-02 12:37:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:37:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:10,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 12:37:10,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 12:37:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 12:37:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 12:37:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 12:37:10,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 12:37:11,064 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 12:37:11,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 12:37:15,353 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-12-02 12:37:15,353 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 12:37:15,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 12:37:15,382 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-02 12:37:15,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:15 BoogieIcfgContainer [2024-12-02 12:37:15,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 12:37:15,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 12:37:15,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 12:37:15,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 12:37:15,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:37:08" (1/3) ... [2024-12-02 12:37:15,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2017c0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:15, skipping insertion in model container [2024-12-02 12:37:15,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:10" (2/3) ... [2024-12-02 12:37:15,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2017c0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:15, skipping insertion in model container [2024-12-02 12:37:15,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:15" (3/3) ... [2024-12-02 12:37:15,392 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-12-02 12:37:15,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 12:37:15,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 874 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-12-02 12:37:15,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 12:37:15,492 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;@dbcba63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 12:37:15,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-02 12:37:15,499 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-02 12:37:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 12:37:15,505 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:15,506 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-02 12:37:15,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash -934405548, now seen corresponding path program 1 times [2024-12-02 12:37:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:15,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339491265] [2024-12-02 12:37:15,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:15,687 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-02 12:37:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339491265] [2024-12-02 12:37:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339491265] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:37:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373894110] [2024-12-02 12:37:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:15,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 12:37:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:15,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 12:37:15,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 12:37:15,716 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-02 12:37:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:15,778 INFO L93 Difference]: Finished difference Result 1724 states and 3278 transitions. [2024-12-02 12:37:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 12:37:15,779 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-02 12:37:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:15,792 INFO L225 Difference]: With dead ends: 1724 [2024-12-02 12:37:15,792 INFO L226 Difference]: Without dead ends: 808 [2024-12-02 12:37:15,797 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-02 12:37:15,800 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-02 12:37:15,801 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-02 12:37:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-12-02 12:37:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-12-02 12:37:15,849 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-02 12:37:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2024-12-02 12:37:15,857 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2024-12-02 12:37:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:15,858 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2024-12-02 12:37:15,858 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-02 12:37:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2024-12-02 12:37:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 12:37:15,859 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:15,859 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-02 12:37:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 12:37:15,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:15,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1945522798, now seen corresponding path program 1 times [2024-12-02 12:37:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424187179] [2024-12-02 12:37:15,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:16,038 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-02 12:37:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424187179] [2024-12-02 12:37:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424187179] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:16,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155567014] [2024-12-02 12:37:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:16,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:16,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:16,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:16,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:16,041 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-02 12:37:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:16,141 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2024-12-02 12:37:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:16,141 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-02 12:37:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:16,145 INFO L225 Difference]: With dead ends: 844 [2024-12-02 12:37:16,145 INFO L226 Difference]: Without dead ends: 808 [2024-12-02 12:37:16,146 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-02 12:37:16,147 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-02 12:37:16,147 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-02 12:37:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-12-02 12:37:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-12-02 12:37:16,166 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-02 12:37:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2024-12-02 12:37:16,171 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2024-12-02 12:37:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2024-12-02 12:37:16,171 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-02 12:37:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2024-12-02 12:37:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 12:37:16,172 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:16,172 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-02 12:37:16,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 12:37:16,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:16,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1226597962, now seen corresponding path program 1 times [2024-12-02 12:37:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:16,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117475057] [2024-12-02 12:37:16,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:16,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:16,292 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-02 12:37:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117475057] [2024-12-02 12:37:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117475057] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355001789] [2024-12-02 12:37:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:16,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:16,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:16,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:16,294 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-02 12:37:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:16,419 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2024-12-02 12:37:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:37:16,419 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-02 12:37:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:16,423 INFO L225 Difference]: With dead ends: 1000 [2024-12-02 12:37:16,424 INFO L226 Difference]: Without dead ends: 968 [2024-12-02 12:37:16,424 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-02 12:37:16,425 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-02 12:37:16,425 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-02 12:37:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-12-02 12:37:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2024-12-02 12:37:16,446 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-02 12:37:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2024-12-02 12:37:16,450 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2024-12-02 12:37:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2024-12-02 12:37:16,451 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-02 12:37:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2024-12-02 12:37:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 12:37:16,452 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:16,452 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-02 12:37:16,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 12:37:16,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:16,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash 523901274, now seen corresponding path program 1 times [2024-12-02 12:37:16,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:16,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222355209] [2024-12-02 12:37:16,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:16,527 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-02 12:37:16,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222355209] [2024-12-02 12:37:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222355209] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:16,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:16,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259928166] [2024-12-02 12:37:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:16,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:16,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:16,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:16,529 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-02 12:37:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:16,567 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2024-12-02 12:37:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:16,568 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-02 12:37:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:16,572 INFO L225 Difference]: With dead ends: 951 [2024-12-02 12:37:16,572 INFO L226 Difference]: Without dead ends: 889 [2024-12-02 12:37:16,572 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-02 12:37:16,573 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-02 12:37:16,573 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-02 12:37:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-12-02 12:37:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2024-12-02 12:37:16,594 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-02 12:37:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1628 transitions. [2024-12-02 12:37:16,599 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1628 transitions. Word has length 37 [2024-12-02 12:37:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:16,599 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1628 transitions. [2024-12-02 12:37:16,599 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-02 12:37:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1628 transitions. [2024-12-02 12:37:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 12:37:16,600 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:16,600 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-02 12:37:16,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 12:37:16,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash 590394786, now seen corresponding path program 1 times [2024-12-02 12:37:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704603491] [2024-12-02 12:37:16,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:16,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-02 12:37:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:16,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704603491] [2024-12-02 12:37:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704603491] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:16,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048019884] [2024-12-02 12:37:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:16,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:16,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:16,802 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-02 12:37:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:16,897 INFO L93 Difference]: Finished difference Result 996 states and 1796 transitions. [2024-12-02 12:37:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:16,897 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-02 12:37:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:16,902 INFO L225 Difference]: With dead ends: 996 [2024-12-02 12:37:16,902 INFO L226 Difference]: Without dead ends: 887 [2024-12-02 12:37:16,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:37:16,903 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-02 12:37:16,904 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-02 12:37:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-12-02 12:37:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2024-12-02 12:37:16,930 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-02 12:37:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2024-12-02 12:37:16,934 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2024-12-02 12:37:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:16,935 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2024-12-02 12:37:16,935 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-02 12:37:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2024-12-02 12:37:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 12:37:16,936 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:16,936 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-02 12:37:16,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 12:37:16,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:16,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 707645968, now seen corresponding path program 1 times [2024-12-02 12:37:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888942778] [2024-12-02 12:37:16,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:17,226 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-02 12:37:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888942778] [2024-12-02 12:37:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888942778] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:17,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:17,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 12:37:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827445282] [2024-12-02 12:37:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:17,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:37:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:17,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:37:17,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:37:17,228 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-02 12:37:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:17,325 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2024-12-02 12:37:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 12:37:17,326 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-02 12:37:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:17,330 INFO L225 Difference]: With dead ends: 893 [2024-12-02 12:37:17,330 INFO L226 Difference]: Without dead ends: 891 [2024-12-02 12:37:17,331 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-02 12:37:17,331 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-02 12:37:17,332 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-02 12:37:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-12-02 12:37:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-12-02 12:37:17,355 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-02 12:37:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2024-12-02 12:37:17,360 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2024-12-02 12:37:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:17,360 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2024-12-02 12:37:17,361 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-02 12:37:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2024-12-02 12:37:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 12:37:17,362 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:17,362 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-02 12:37:17,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 12:37:17,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:17,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1903217474, now seen corresponding path program 1 times [2024-12-02 12:37:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086036183] [2024-12-02 12:37:17,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:17,418 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-02 12:37:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086036183] [2024-12-02 12:37:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086036183] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941054317] [2024-12-02 12:37:17,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:17,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:17,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:17,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:17,419 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-02 12:37:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:17,454 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2024-12-02 12:37:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:17,455 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-02 12:37:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:17,459 INFO L225 Difference]: With dead ends: 1105 [2024-12-02 12:37:17,459 INFO L226 Difference]: Without dead ends: 990 [2024-12-02 12:37:17,460 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-02 12:37:17,461 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-02 12:37:17,461 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-02 12:37:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-12-02 12:37:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2024-12-02 12:37:17,488 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-02 12:37:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2024-12-02 12:37:17,493 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2024-12-02 12:37:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:17,493 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2024-12-02 12:37:17,493 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-02 12:37:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2024-12-02 12:37:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 12:37:17,494 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:17,494 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-02 12:37:17,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 12:37:17,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:17,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash 122284610, now seen corresponding path program 1 times [2024-12-02 12:37:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:17,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555739785] [2024-12-02 12:37:17,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:17,553 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-02 12:37:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555739785] [2024-12-02 12:37:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555739785] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:17,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:17,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023460479] [2024-12-02 12:37:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:17,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:17,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:17,555 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-02 12:37:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:17,592 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2024-12-02 12:37:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:17,592 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-02 12:37:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:17,597 INFO L225 Difference]: With dead ends: 1380 [2024-12-02 12:37:17,598 INFO L226 Difference]: Without dead ends: 1168 [2024-12-02 12:37:17,599 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-02 12:37:17,599 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-02 12:37:17,599 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-02 12:37:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-12-02 12:37:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2024-12-02 12:37:17,636 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-02 12:37:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2024-12-02 12:37:17,642 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2024-12-02 12:37:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:17,642 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2024-12-02 12:37:17,643 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-02 12:37:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2024-12-02 12:37:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 12:37:17,643 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:17,643 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-02 12:37:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 12:37:17,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:17,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1688735299, now seen corresponding path program 1 times [2024-12-02 12:37:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900349982] [2024-12-02 12:37:17,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:17,701 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-02 12:37:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900349982] [2024-12-02 12:37:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900349982] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465903020] [2024-12-02 12:37:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:17,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:17,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:17,703 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-02 12:37:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:17,744 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2024-12-02 12:37:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:17,745 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-02 12:37:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:17,750 INFO L225 Difference]: With dead ends: 1589 [2024-12-02 12:37:17,750 INFO L226 Difference]: Without dead ends: 1354 [2024-12-02 12:37:17,751 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-02 12:37:17,751 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-02 12:37:17,752 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-02 12:37:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-12-02 12:37:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2024-12-02 12:37:17,791 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-02 12:37:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2024-12-02 12:37:17,798 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2024-12-02 12:37:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:17,798 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2024-12-02 12:37:17,798 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-02 12:37:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2024-12-02 12:37:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 12:37:17,799 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:17,799 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-02 12:37:17,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 12:37:17,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 923003988, now seen corresponding path program 1 times [2024-12-02 12:37:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520763765] [2024-12-02 12:37:17,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:17,936 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-02 12:37:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520763765] [2024-12-02 12:37:17,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520763765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:17,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:17,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683369063] [2024-12-02 12:37:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:17,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:17,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:17,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:17,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:17,937 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-02 12:37:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:18,068 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2024-12-02 12:37:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:18,069 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-02 12:37:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:18,078 INFO L225 Difference]: With dead ends: 3208 [2024-12-02 12:37:18,078 INFO L226 Difference]: Without dead ends: 2634 [2024-12-02 12:37:18,080 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-02 12:37:18,080 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-02 12:37:18,081 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-02 12:37:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-12-02 12:37:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2024-12-02 12:37:18,143 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-02 12:37:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2024-12-02 12:37:18,151 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2024-12-02 12:37:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:18,151 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2024-12-02 12:37:18,151 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-02 12:37:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2024-12-02 12:37:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 12:37:18,152 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:18,152 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-02 12:37:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 12:37:18,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:18,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -857928876, now seen corresponding path program 1 times [2024-12-02 12:37:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222600654] [2024-12-02 12:37:18,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:18,271 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-02 12:37:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:18,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222600654] [2024-12-02 12:37:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222600654] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115570757] [2024-12-02 12:37:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:18,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:18,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:18,273 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-02 12:37:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:18,417 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2024-12-02 12:37:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:18,418 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-02 12:37:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:18,430 INFO L225 Difference]: With dead ends: 3780 [2024-12-02 12:37:18,430 INFO L226 Difference]: Without dead ends: 3206 [2024-12-02 12:37:18,432 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-02 12:37:18,432 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-02 12:37:18,433 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-02 12:37:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-12-02 12:37:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2024-12-02 12:37:18,541 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-02 12:37:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2024-12-02 12:37:18,554 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2024-12-02 12:37:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:18,554 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2024-12-02 12:37:18,554 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-02 12:37:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2024-12-02 12:37:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 12:37:18,556 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:18,556 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-02 12:37:18,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 12:37:18,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:18,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash 894361900, now seen corresponding path program 1 times [2024-12-02 12:37:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315028643] [2024-12-02 12:37:18,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:18,668 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-02 12:37:18,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:18,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315028643] [2024-12-02 12:37:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315028643] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:18,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184008859] [2024-12-02 12:37:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:18,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:18,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:18,670 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-02 12:37:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:18,753 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2024-12-02 12:37:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:18,754 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-02 12:37:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:18,761 INFO L225 Difference]: With dead ends: 4260 [2024-12-02 12:37:18,761 INFO L226 Difference]: Without dead ends: 2254 [2024-12-02 12:37:18,764 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-02 12:37:18,764 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-02 12:37:18,764 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-02 12:37:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-12-02 12:37:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2024-12-02 12:37:18,819 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-02 12:37:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2024-12-02 12:37:18,825 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2024-12-02 12:37:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:18,825 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2024-12-02 12:37:18,825 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-02 12:37:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2024-12-02 12:37:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 12:37:18,826 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:18,826 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-02 12:37:18,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 12:37:18,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:18,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1218909775, now seen corresponding path program 1 times [2024-12-02 12:37:18,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69975485] [2024-12-02 12:37:18,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:18,925 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-02 12:37:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:18,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69975485] [2024-12-02 12:37:18,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69975485] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:18,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:18,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772654446] [2024-12-02 12:37:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:18,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:18,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:18,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:18,926 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-02 12:37:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:19,017 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2024-12-02 12:37:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:19,017 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-02 12:37:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:19,027 INFO L225 Difference]: With dead ends: 3508 [2024-12-02 12:37:19,027 INFO L226 Difference]: Without dead ends: 3090 [2024-12-02 12:37:19,028 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-02 12:37:19,029 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-02 12:37:19,029 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-02 12:37:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-12-02 12:37:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2024-12-02 12:37:19,093 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-02 12:37:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2024-12-02 12:37:19,098 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2024-12-02 12:37:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:19,099 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2024-12-02 12:37:19,099 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-02 12:37:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2024-12-02 12:37:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 12:37:19,100 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:19,100 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-02 12:37:19,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 12:37:19,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash -877348108, now seen corresponding path program 1 times [2024-12-02 12:37:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:19,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098405765] [2024-12-02 12:37:19,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:19,188 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-02 12:37:19,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098405765] [2024-12-02 12:37:19,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098405765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:19,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:19,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:19,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376016016] [2024-12-02 12:37:19,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:19,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:19,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:19,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:19,189 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-02 12:37:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:19,224 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2024-12-02 12:37:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:19,225 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-02 12:37:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:19,230 INFO L225 Difference]: With dead ends: 3608 [2024-12-02 12:37:19,230 INFO L226 Difference]: Without dead ends: 1734 [2024-12-02 12:37:19,232 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-02 12:37:19,233 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-02 12:37:19,233 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-02 12:37:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-12-02 12:37:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-12-02 12:37:19,270 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-02 12:37:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2024-12-02 12:37:19,273 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2024-12-02 12:37:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:19,274 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2024-12-02 12:37:19,274 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-02 12:37:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2024-12-02 12:37:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 12:37:19,275 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:19,275 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-02 12:37:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 12:37:19,275 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:19,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1226511174, now seen corresponding path program 1 times [2024-12-02 12:37:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687119411] [2024-12-02 12:37:19,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:19,356 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-02 12:37:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687119411] [2024-12-02 12:37:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687119411] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199242391] [2024-12-02 12:37:19,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:19,357 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-02 12:37:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:19,384 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2024-12-02 12:37:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:19,384 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-02 12:37:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:19,388 INFO L225 Difference]: With dead ends: 2204 [2024-12-02 12:37:19,388 INFO L226 Difference]: Without dead ends: 1266 [2024-12-02 12:37:19,389 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-02 12:37:19,390 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-02 12:37:19,390 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-02 12:37:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-12-02 12:37:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2024-12-02 12:37:19,416 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-02 12:37:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2024-12-02 12:37:19,419 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2024-12-02 12:37:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:19,419 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2024-12-02 12:37:19,419 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-02 12:37:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2024-12-02 12:37:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 12:37:19,420 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:19,420 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-02 12:37:19,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 12:37:19,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:19,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1826022888, now seen corresponding path program 1 times [2024-12-02 12:37:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633182554] [2024-12-02 12:37:19,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:20,845 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-02 12:37:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633182554] [2024-12-02 12:37:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633182554] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145608199] [2024-12-02 12:37:20,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:20,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:20,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 12:37:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:20,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 12:37:20,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:21,140 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-02 12:37:21,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:21,320 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-02 12:37:21,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145608199] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:21,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-12-02 12:37:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535609147] [2024-12-02 12:37:21,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:21,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 12:37:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:21,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 12:37:21,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-02 12:37:21,322 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-02 12:37:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:23,210 INFO L93 Difference]: Finished difference Result 3665 states and 5284 transitions. [2024-12-02 12:37:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-12-02 12:37:23,211 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-02 12:37:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:23,217 INFO L225 Difference]: With dead ends: 3665 [2024-12-02 12:37:23,217 INFO L226 Difference]: Without dead ends: 3195 [2024-12-02 12:37:23,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2024-12-02 12:37:23,219 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 14347 mSDsluCounter, 7682 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-02 12:37:23,220 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-02 12:37:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2024-12-02 12:37:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3161. [2024-12-02 12:37:23,305 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-02 12:37:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4455 transitions. [2024-12-02 12:37:23,311 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4455 transitions. Word has length 61 [2024-12-02 12:37:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:23,311 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4455 transitions. [2024-12-02 12:37:23,311 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-02 12:37:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4455 transitions. [2024-12-02 12:37:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 12:37:23,312 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:23,312 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-02 12:37:23,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 12:37:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 12:37:23,513 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 459765187, now seen corresponding path program 1 times [2024-12-02 12:37:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103992712] [2024-12-02 12:37:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:25,205 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-02 12:37:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103992712] [2024-12-02 12:37:25,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103992712] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407181686] [2024-12-02 12:37:25,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:25,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:25,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 12:37:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:25,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 12:37:25,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:25,683 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-02 12:37:25,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:26,221 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-02 12:37:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407181686] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:26,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-12-02 12:37:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773192841] [2024-12-02 12:37:26,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:26,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 12:37:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:26,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 12:37:26,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-12-02 12:37:26,222 INFO L87 Difference]: Start difference. First operand 3161 states and 4455 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-02 12:37:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:26,781 INFO L93 Difference]: Finished difference Result 7268 states and 9645 transitions. [2024-12-02 12:37:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 12:37:26,782 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-02 12:37:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:26,789 INFO L225 Difference]: With dead ends: 7268 [2024-12-02 12:37:26,789 INFO L226 Difference]: Without dead ends: 5309 [2024-12-02 12:37:26,791 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-02 12:37:26,792 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 15169 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15169 SdHoareTripleChecker+Valid, 4758 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:37:26,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15169 Valid, 4758 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 12:37:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2024-12-02 12:37:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5243. [2024-12-02 12:37:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5241 states have (on average 1.3325701202060676) internal successors, (6984), 5242 states have internal predecessors, (6984), 0 states have call successors, (0), 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-02 12:37:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6984 transitions. [2024-12-02 12:37:26,876 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6984 transitions. Word has length 62 [2024-12-02 12:37:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:26,877 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 6984 transitions. [2024-12-02 12:37:26,877 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-02 12:37:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6984 transitions. [2024-12-02 12:37:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 12:37:26,877 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:26,878 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-02 12:37:26,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 12:37:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 12:37:27,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1147902773, now seen corresponding path program 1 times [2024-12-02 12:37:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030401298] [2024-12-02 12:37:27,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:27,454 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-02 12:37:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030401298] [2024-12-02 12:37:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030401298] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097463541] [2024-12-02 12:37:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:27,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:27,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 12:37:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:27,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 12:37:27,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:28,119 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-02 12:37:28,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:28,937 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-02 12:37:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097463541] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:28,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 12:37:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499546153] [2024-12-02 12:37:28,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 12:37:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:28,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 12:37:28,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-12-02 12:37:28,939 INFO L87 Difference]: Start difference. First operand 5243 states and 6984 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-02 12:37:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:31,873 INFO L93 Difference]: Finished difference Result 13264 states and 17044 transitions. [2024-12-02 12:37:31,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-12-02 12:37:31,873 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-02 12:37:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:31,885 INFO L225 Difference]: With dead ends: 13264 [2024-12-02 12:37:31,885 INFO L226 Difference]: Without dead ends: 9304 [2024-12-02 12:37:31,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-12-02 12:37:31,889 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 13920 mSDsluCounter, 14047 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13920 SdHoareTripleChecker+Valid, 15555 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:37:31,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13920 Valid, 15555 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 12:37:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2024-12-02 12:37:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 5902. [2024-12-02 12:37:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5902 states, 5900 states have (on average 1.3220338983050848) internal successors, (7800), 5901 states have internal predecessors, (7800), 0 states have call successors, (0), 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-02 12:37:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 7800 transitions. [2024-12-02 12:37:32,054 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 7800 transitions. Word has length 62 [2024-12-02 12:37:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:32,054 INFO L471 AbstractCegarLoop]: Abstraction has 5902 states and 7800 transitions. [2024-12-02 12:37:32,054 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-02 12:37:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 7800 transitions. [2024-12-02 12:37:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 12:37:32,055 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:32,055 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-02 12:37:32,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 12:37:32,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 12:37:32,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:32,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash 807603108, now seen corresponding path program 1 times [2024-12-02 12:37:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103362480] [2024-12-02 12:37:32,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:32,573 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-02 12:37:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103362480] [2024-12-02 12:37:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103362480] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825657051] [2024-12-02 12:37:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:32,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:32,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:32,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:32,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 12:37:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:32,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 12:37:32,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:33,893 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-02 12:37:33,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:34,718 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-02 12:37:34,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825657051] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:34,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:34,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-12-02 12:37:34,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9659695] [2024-12-02 12:37:34,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:34,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 12:37:34,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:34,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 12:37:34,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-12-02 12:37:34,720 INFO L87 Difference]: Start difference. First operand 5902 states and 7800 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-02 12:37:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:37:36,380 INFO L93 Difference]: Finished difference Result 12552 states and 16103 transitions. [2024-12-02 12:37:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 12:37:36,381 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-02 12:37:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:37:36,397 INFO L225 Difference]: With dead ends: 12552 [2024-12-02 12:37:36,397 INFO L226 Difference]: Without dead ends: 8238 [2024-12-02 12:37:36,402 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-02 12:37:36,403 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 21567 mSDsluCounter, 7866 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21567 SdHoareTripleChecker+Valid, 9380 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:37:36,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21567 Valid, 9380 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 12:37:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2024-12-02 12:37:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 7814. [2024-12-02 12:37:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 7812 states have (on average 1.290962621607783) internal successors, (10085), 7813 states have internal predecessors, (10085), 0 states have call successors, (0), 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-02 12:37:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 10085 transitions. [2024-12-02 12:37:36,643 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 10085 transitions. Word has length 63 [2024-12-02 12:37:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:37:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 7814 states and 10085 transitions. [2024-12-02 12:37:36,644 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-02 12:37:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 10085 transitions. [2024-12-02 12:37:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 12:37:36,644 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:37:36,644 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-02 12:37:36,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 12:37:36,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:36,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:37:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1786741782, now seen corresponding path program 1 times [2024-12-02 12:37:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835352230] [2024-12-02 12:37:36,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:38,311 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-02 12:37:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:38,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835352230] [2024-12-02 12:37:38,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835352230] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:38,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533382563] [2024-12-02 12:37:38,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:38,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:38,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:38,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:38,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 12:37:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:38,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 12:37:38,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:41,149 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-02 12:37:41,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:42,747 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-02 12:37:42,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533382563] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:42,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:42,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 15] total 51 [2024-12-02 12:37:42,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679334421] [2024-12-02 12:37:42,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:42,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-12-02 12:37:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:42,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-12-02 12:37:42,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2024-12-02 12:37:42,750 INFO L87 Difference]: Start difference. First operand 7814 states and 10085 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-02 12:38:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:04,509 INFO L93 Difference]: Finished difference Result 14540 states and 18342 transitions. [2024-12-02 12:38:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-12-02 12:38:04,509 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-02 12:38:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:04,519 INFO L225 Difference]: With dead ends: 14540 [2024-12-02 12:38:04,519 INFO L226 Difference]: Without dead ends: 11701 [2024-12-02 12:38:04,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=4031, Invalid=15991, Unknown=0, NotChecked=0, Total=20022 [2024-12-02 12:38:04,524 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31060 mSDsluCounter, 23922 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31060 SdHoareTripleChecker+Valid, 25458 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:04,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31060 Valid, 25458 Invalid, 2601 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [121 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-12-02 12:38:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11701 states. [2024-12-02 12:38:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11701 to 9885. [2024-12-02 12:38:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9885 states, 9883 states have (on average 1.2800768997268035) internal successors, (12651), 9884 states have internal predecessors, (12651), 0 states have call successors, (0), 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-02 12:38:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9885 states to 9885 states and 12651 transitions. [2024-12-02 12:38:04,950 INFO L78 Accepts]: Start accepts. Automaton has 9885 states and 12651 transitions. Word has length 63 [2024-12-02 12:38:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:04,950 INFO L471 AbstractCegarLoop]: Abstraction has 9885 states and 12651 transitions. [2024-12-02 12:38:04,951 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-02 12:38:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 9885 states and 12651 transitions. [2024-12-02 12:38:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 12:38:04,951 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:04,952 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, 1, 1] [2024-12-02 12:38:04,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 12:38:05,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-12-02 12:38:05,153 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:05,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash 606047555, now seen corresponding path program 1 times [2024-12-02 12:38:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183244314] [2024-12-02 12:38:05,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:05,205 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-02 12:38:05,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:05,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183244314] [2024-12-02 12:38:05,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183244314] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:05,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:38:05,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:38:05,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944486446] [2024-12-02 12:38:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:38:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:05,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:38:05,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:38:05,206 INFO L87 Difference]: Start difference. First operand 9885 states and 12651 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:08,867 INFO L93 Difference]: Finished difference Result 11389 states and 15524 transitions. [2024-12-02 12:38:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:38:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 12:38:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:08,878 INFO L225 Difference]: With dead ends: 11389 [2024-12-02 12:38:08,878 INFO L226 Difference]: Without dead ends: 10636 [2024-12-02 12:38:08,881 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-02 12:38:08,882 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 810 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 547 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 12:38:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10636 states. [2024-12-02 12:38:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10636 to 10636. [2024-12-02 12:38:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10636 states, 10634 states have (on average 1.2817378220801203) internal successors, (13630), 10635 states have internal predecessors, (13630), 0 states have call successors, (0), 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-02 12:38:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 13630 transitions. [2024-12-02 12:38:09,401 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 13630 transitions. Word has length 63 [2024-12-02 12:38:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:09,401 INFO L471 AbstractCegarLoop]: Abstraction has 10636 states and 13630 transitions. [2024-12-02 12:38:09,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 13630 transitions. [2024-12-02 12:38:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 12:38:09,402 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:09,402 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-02 12:38:09,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 12:38:09,402 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:09,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash 532152701, now seen corresponding path program 1 times [2024-12-02 12:38:09,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:09,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226084840] [2024-12-02 12:38:09,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:10,354 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-02 12:38:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226084840] [2024-12-02 12:38:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226084840] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869371101] [2024-12-02 12:38:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:10,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:10,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:10,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 12:38:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:10,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 12:38:10,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:11,536 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-02 12:38:11,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:12,131 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-02 12:38:12,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869371101] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:12,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:12,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2024-12-02 12:38:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782953828] [2024-12-02 12:38:12,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:12,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 12:38:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:12,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 12:38:12,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 12:38:12,133 INFO L87 Difference]: Start difference. First operand 10636 states and 13630 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-02 12:38:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:14,728 INFO L93 Difference]: Finished difference Result 14134 states and 17907 transitions. [2024-12-02 12:38:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-02 12:38:14,729 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-02 12:38:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:14,735 INFO L225 Difference]: With dead ends: 14134 [2024-12-02 12:38:14,736 INFO L226 Difference]: Without dead ends: 10323 [2024-12-02 12:38:14,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 12:38:14,739 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 18874 mSDsluCounter, 15365 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18874 SdHoareTripleChecker+Valid, 16882 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:14,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18874 Valid, 16882 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 12:38:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10323 states. [2024-12-02 12:38:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10323 to 8705. [2024-12-02 12:38:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8705 states, 8703 states have (on average 1.2885211995863495) internal successors, (11214), 8704 states have internal predecessors, (11214), 0 states have call successors, (0), 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-02 12:38:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 11214 transitions. [2024-12-02 12:38:15,099 INFO L78 Accepts]: Start accepts. Automaton has 8705 states and 11214 transitions. Word has length 64 [2024-12-02 12:38:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:15,099 INFO L471 AbstractCegarLoop]: Abstraction has 8705 states and 11214 transitions. [2024-12-02 12:38:15,099 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-02 12:38:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8705 states and 11214 transitions. [2024-12-02 12:38:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 12:38:15,100 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:15,100 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-02 12:38:15,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 12:38:15,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 12:38:15,301 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1624666796, now seen corresponding path program 1 times [2024-12-02 12:38:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438849985] [2024-12-02 12:38:15,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:16,705 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-02 12:38:16,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438849985] [2024-12-02 12:38:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438849985] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:16,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117111284] [2024-12-02 12:38:16,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:16,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:16,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:16,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:16,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 12:38:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:16,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 12:38:16,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:17,378 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-02 12:38:17,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:18,620 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-02 12:38:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117111284] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:18,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 42 [2024-12-02 12:38:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111717207] [2024-12-02 12:38:18,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:18,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 12:38:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:18,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 12:38:18,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 12:38:18,622 INFO L87 Difference]: Start difference. First operand 8705 states and 11214 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-02 12:38:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:28,521 INFO L93 Difference]: Finished difference Result 22615 states and 28264 transitions. [2024-12-02 12:38:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-12-02 12:38:28,522 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-02 12:38:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:28,535 INFO L225 Difference]: With dead ends: 22615 [2024-12-02 12:38:28,535 INFO L226 Difference]: Without dead ends: 18184 [2024-12-02 12:38:28,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2435, Invalid=9121, Unknown=0, NotChecked=0, Total=11556 [2024-12-02 12:38:28,540 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 15627 mSDsluCounter, 29091 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15627 SdHoareTripleChecker+Valid, 30674 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:28,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15627 Valid, 30674 Invalid, 2900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 12:38:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18184 states. [2024-12-02 12:38:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18184 to 5862. [2024-12-02 12:38:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5862 states, 5860 states have (on average 1.3247440273037543) internal successors, (7763), 5861 states have internal predecessors, (7763), 0 states have call successors, (0), 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-02 12:38:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 7763 transitions. [2024-12-02 12:38:28,794 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 7763 transitions. Word has length 65 [2024-12-02 12:38:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:28,795 INFO L471 AbstractCegarLoop]: Abstraction has 5862 states and 7763 transitions. [2024-12-02 12:38:28,795 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-02 12:38:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 7763 transitions. [2024-12-02 12:38:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 12:38:28,805 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:28,805 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-02 12:38:28,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 12:38:29,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 12:38:29,006 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:29,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1065912349, now seen corresponding path program 1 times [2024-12-02 12:38:29,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:29,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653956400] [2024-12-02 12:38:29,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:29,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:29,718 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-02 12:38:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653956400] [2024-12-02 12:38:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653956400] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178103990] [2024-12-02 12:38:29,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:29,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:29,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:29,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 12:38:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:29,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 12:38:29,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:30,454 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-02 12:38:30,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:31,800 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-02 12:38:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178103990] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:31,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-02 12:38:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321290495] [2024-12-02 12:38:31,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:31,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 12:38:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:31,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 12:38:31,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-12-02 12:38:31,802 INFO L87 Difference]: Start difference. First operand 5862 states and 7763 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-02 12:38:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:32,997 INFO L93 Difference]: Finished difference Result 15432 states and 19691 transitions. [2024-12-02 12:38:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 12:38:32,998 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-02 12:38:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:33,005 INFO L225 Difference]: With dead ends: 15432 [2024-12-02 12:38:33,005 INFO L226 Difference]: Without dead ends: 11433 [2024-12-02 12:38:33,008 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-02 12:38:33,008 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 14891 mSDsluCounter, 12086 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14891 SdHoareTripleChecker+Valid, 13602 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:33,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14891 Valid, 13602 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 12:38:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11433 states. [2024-12-02 12:38:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11433 to 10613. [2024-12-02 12:38:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10613 states, 10611 states have (on average 1.2713222127980397) internal successors, (13490), 10612 states have internal predecessors, (13490), 0 states have call successors, (0), 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-02 12:38:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10613 states to 10613 states and 13490 transitions. [2024-12-02 12:38:33,494 INFO L78 Accepts]: Start accepts. Automaton has 10613 states and 13490 transitions. Word has length 103 [2024-12-02 12:38:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:33,494 INFO L471 AbstractCegarLoop]: Abstraction has 10613 states and 13490 transitions. [2024-12-02 12:38:33,494 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-02 12:38:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 10613 states and 13490 transitions. [2024-12-02 12:38:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 12:38:33,496 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:33,496 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-02 12:38:33,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 12:38:33,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 12:38:33,696 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1754049935, now seen corresponding path program 1 times [2024-12-02 12:38:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659226266] [2024-12-02 12:38:33,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:34,433 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-02 12:38:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659226266] [2024-12-02 12:38:34,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659226266] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727495924] [2024-12-02 12:38:34,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:34,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:34,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:34,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 12:38:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:34,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 12:38:34,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:35,259 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-02 12:38:35,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:36,577 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-02 12:38:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727495924] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:36,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-02 12:38:36,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682484585] [2024-12-02 12:38:36,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:36,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 12:38:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:36,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 12:38:36,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-12-02 12:38:36,579 INFO L87 Difference]: Start difference. First operand 10613 states and 13490 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-02 12:38:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:37,930 INFO L93 Difference]: Finished difference Result 15323 states and 19254 transitions. [2024-12-02 12:38:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 12:38:37,930 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-02 12:38:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:37,940 INFO L225 Difference]: With dead ends: 15323 [2024-12-02 12:38:37,940 INFO L226 Difference]: Without dead ends: 9611 [2024-12-02 12:38:37,947 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-02 12:38:37,947 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 14806 mSDsluCounter, 10655 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14806 SdHoareTripleChecker+Valid, 12170 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:37,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14806 Valid, 12170 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 12:38:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2024-12-02 12:38:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9519. [2024-12-02 12:38:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9519 states, 9517 states have (on average 1.2688872543868865) internal successors, (12076), 9518 states have internal predecessors, (12076), 0 states have call successors, (0), 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-02 12:38:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9519 states to 9519 states and 12076 transitions. [2024-12-02 12:38:38,479 INFO L78 Accepts]: Start accepts. Automaton has 9519 states and 12076 transitions. Word has length 103 [2024-12-02 12:38:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:38,480 INFO L471 AbstractCegarLoop]: Abstraction has 9519 states and 12076 transitions. [2024-12-02 12:38:38,480 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-02 12:38:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 9519 states and 12076 transitions. [2024-12-02 12:38:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 12:38:38,481 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:38,481 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-02 12:38:38,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-02 12:38:38,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 12:38:38,682 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:38,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 856710688, now seen corresponding path program 1 times [2024-12-02 12:38:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863389988] [2024-12-02 12:38:38,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:39,603 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-02 12:38:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863389988] [2024-12-02 12:38:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863389988] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961809703] [2024-12-02 12:38:39,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:39,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:39,605 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:39,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 12:38:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:39,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 12:38:39,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:41,147 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-02 12:38:41,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:44,506 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-02 12:38:44,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961809703] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:44,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-12-02 12:38:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760204506] [2024-12-02 12:38:44,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:44,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-12-02 12:38:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:44,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-12-02 12:38:44,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2024-12-02 12:38:44,508 INFO L87 Difference]: Start difference. First operand 9519 states and 12076 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-02 12:38:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:38:54,411 INFO L93 Difference]: Finished difference Result 15217 states and 18945 transitions. [2024-12-02 12:38:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-02 12:38:54,412 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-02 12:38:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:38:54,418 INFO L225 Difference]: With dead ends: 15217 [2024-12-02 12:38:54,418 INFO L226 Difference]: Without dead ends: 9687 [2024-12-02 12:38:54,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3017 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1975, Invalid=10907, Unknown=0, NotChecked=0, Total=12882 [2024-12-02 12:38:54,423 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 20388 mSDsluCounter, 29090 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20388 SdHoareTripleChecker+Valid, 30599 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:38:54,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20388 Valid, 30599 Invalid, 2113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 12:38:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2024-12-02 12:38:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 9203. [2024-12-02 12:38:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9203 states, 9201 states have (on average 1.272035648299098) internal successors, (11704), 9202 states have internal predecessors, (11704), 0 states have call successors, (0), 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-02 12:38:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9203 states to 9203 states and 11704 transitions. [2024-12-02 12:38:54,965 INFO L78 Accepts]: Start accepts. Automaton has 9203 states and 11704 transitions. Word has length 104 [2024-12-02 12:38:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:38:54,965 INFO L471 AbstractCegarLoop]: Abstraction has 9203 states and 11704 transitions. [2024-12-02 12:38:54,965 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-02 12:38:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9203 states and 11704 transitions. [2024-12-02 12:38:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 12:38:54,966 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:38:54,967 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-02 12:38:54,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 12:38:55,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 12:38:55,167 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:38:55,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 15634770, now seen corresponding path program 1 times [2024-12-02 12:38:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033675938] [2024-12-02 12:38:55,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:55,811 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-02 12:38:55,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033675938] [2024-12-02 12:38:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033675938] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231896825] [2024-12-02 12:38:55,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:55,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:55,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:55,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 12:38:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:55,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 12:38:55,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:56,890 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-02 12:38:56,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:59,639 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-02 12:38:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231896825] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:59,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2024-12-02 12:38:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774162293] [2024-12-02 12:38:59,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:59,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 12:38:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:59,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 12:38:59,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 12:38:59,641 INFO L87 Difference]: Start difference. First operand 9203 states and 11704 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-02 12:39:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:39:04,937 INFO L93 Difference]: Finished difference Result 20585 states and 25578 transitions. [2024-12-02 12:39:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-12-02 12:39:04,937 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-02 12:39:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:39:04,946 INFO L225 Difference]: With dead ends: 20585 [2024-12-02 12:39:04,946 INFO L226 Difference]: Without dead ends: 13509 [2024-12-02 12:39:04,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1986, Invalid=8726, Unknown=0, NotChecked=0, Total=10712 [2024-12-02 12:39:04,951 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 25681 mSDsluCounter, 8824 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25681 SdHoareTripleChecker+Valid, 10447 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:39:04,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25681 Valid, 10447 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 12:39:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13509 states. [2024-12-02 12:39:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13509 to 5383. [2024-12-02 12:39:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 5381 states have (on average 1.3135104999070806) internal successors, (7068), 5382 states have internal predecessors, (7068), 0 states have call successors, (0), 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-02 12:39:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 7068 transitions. [2024-12-02 12:39:05,302 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 7068 transitions. Word has length 104 [2024-12-02 12:39:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:39:05,302 INFO L471 AbstractCegarLoop]: Abstraction has 5383 states and 7068 transitions. [2024-12-02 12:39:05,302 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-02 12:39:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 7068 transitions. [2024-12-02 12:39:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 12:39:05,303 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:39:05,304 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-02 12:39:05,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 12:39:05,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 12:39:05,504 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:39:05,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:05,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1395528875, now seen corresponding path program 1 times [2024-12-02 12:39:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:05,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860719843] [2024-12-02 12:39:05,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:05,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:06,481 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-02 12:39:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860719843] [2024-12-02 12:39:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860719843] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:39:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427799437] [2024-12-02 12:39:06,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:39:06,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:39:06,483 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:39:06,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 12:39:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:06,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 12:39:06,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:39:07,922 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-02 12:39:07,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:39:11,405 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-02 12:39:11,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427799437] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:39:11,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:39:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 53 [2024-12-02 12:39:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334149336] [2024-12-02 12:39:11,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:39:11,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-12-02 12:39:11,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:11,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-12-02 12:39:11,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2526, Unknown=0, NotChecked=0, Total=2756 [2024-12-02 12:39:11,407 INFO L87 Difference]: Start difference. First operand 5383 states and 7068 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-02 12:39:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:39:52,090 INFO L93 Difference]: Finished difference Result 16426 states and 20245 transitions. [2024-12-02 12:39:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2024-12-02 12:39:52,091 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-02 12:39:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:39:52,100 INFO L225 Difference]: With dead ends: 16426 [2024-12-02 12:39:52,100 INFO L226 Difference]: Without dead ends: 14463 [2024-12-02 12:39:52,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24928 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=12162, Invalid=59930, Unknown=0, NotChecked=0, Total=72092 [2024-12-02 12:39:52,106 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 25591 mSDsluCounter, 37174 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25591 SdHoareTripleChecker+Valid, 38775 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:39:52,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25591 Valid, 38775 Invalid, 3547 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [228 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 12:39:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14463 states. [2024-12-02 12:39:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14463 to 11333. [2024-12-02 12:39:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11333 states, 11331 states have (on average 1.2518753861089047) internal successors, (14185), 11332 states have internal predecessors, (14185), 0 states have call successors, (0), 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-02 12:39:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11333 states to 11333 states and 14185 transitions. [2024-12-02 12:39:52,999 INFO L78 Accepts]: Start accepts. Automaton has 11333 states and 14185 transitions. Word has length 105 [2024-12-02 12:39:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:39:52,999 INFO L471 AbstractCegarLoop]: Abstraction has 11333 states and 14185 transitions. [2024-12-02 12:39:52,999 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-02 12:39:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11333 states and 14185 transitions. [2024-12-02 12:39:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 12:39:53,000 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:39:53,001 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-02 12:39:53,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 12:39:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 12:39:53,201 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:39:53,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1322155965, now seen corresponding path program 1 times [2024-12-02 12:39:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287334079] [2024-12-02 12:39:53,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:53,878 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-02 12:39:53,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287334079] [2024-12-02 12:39:53,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287334079] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:39:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696120003] [2024-12-02 12:39:53,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:53,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:39:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:39:53,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:39:53,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 12:39:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:53,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 12:39:53,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:39:58,773 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-02 12:39:58,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:40:06,672 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-02 12:40:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696120003] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:40:06,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:40:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32, 27] total 76 [2024-12-02 12:40:06,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036666624] [2024-12-02 12:40:06,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:40:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-02 12:40:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:40:06,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-02 12:40:06,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=5073, Unknown=0, NotChecked=0, Total=5700 [2024-12-02 12:40:06,674 INFO L87 Difference]: Start difference. First operand 11333 states and 14185 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-02 12:40:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:40:41,722 INFO L93 Difference]: Finished difference Result 19339 states and 23959 transitions. [2024-12-02 12:40:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-12-02 12:40:41,723 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-02 12:40:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:40:41,734 INFO L225 Difference]: With dead ends: 19339 [2024-12-02 12:40:41,734 INFO L226 Difference]: Without dead ends: 15201 [2024-12-02 12:40:41,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12702 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=6924, Invalid=33276, Unknown=0, NotChecked=0, Total=40200 [2024-12-02 12:40:41,738 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 19179 mSDsluCounter, 37643 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19179 SdHoareTripleChecker+Valid, 39203 SdHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:40:41,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19179 Valid, 39203 Invalid, 3872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [156 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-12-02 12:40:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2024-12-02 12:40:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 14430. [2024-12-02 12:40:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14430 states, 14428 states have (on average 1.2400194067091765) internal successors, (17891), 14429 states have internal predecessors, (17891), 0 states have call successors, (0), 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-02 12:40:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14430 states to 14430 states and 17891 transitions. [2024-12-02 12:40:43,044 INFO L78 Accepts]: Start accepts. Automaton has 14430 states and 17891 transitions. Word has length 105 [2024-12-02 12:40:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:40:43,044 INFO L471 AbstractCegarLoop]: Abstraction has 14430 states and 17891 transitions. [2024-12-02 12:40:43,044 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-02 12:40:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14430 states and 17891 transitions. [2024-12-02 12:40:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 12:40:43,046 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:40:43,046 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-02 12:40:43,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 12:40:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 12:40:43,246 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:40:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:40:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1973850741, now seen corresponding path program 1 times [2024-12-02 12:40:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:40:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959687672] [2024-12-02 12:40:43,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:40:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:40:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:40:44,277 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-02 12:40:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:40:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959687672] [2024-12-02 12:40:44,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959687672] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:40:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415224592] [2024-12-02 12:40:44,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:40:44,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:40:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:40:44,279 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:40:44,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 12:40:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:40:44,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 12:40:44,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:40:46,287 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-02 12:40:46,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:40:49,576 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-02 12:40:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415224592] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:40:49,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:40:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 21] total 59 [2024-12-02 12:40:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011027841] [2024-12-02 12:40:49,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:40:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-02 12:40:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:40:49,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-02 12:40:49,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3177, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 12:40:49,578 INFO L87 Difference]: Start difference. First operand 14430 states and 17891 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-02 12:41:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:06,969 INFO L93 Difference]: Finished difference Result 30706 states and 37321 transitions. [2024-12-02 12:41:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-12-02 12:41:06,970 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-02 12:41:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:06,985 INFO L225 Difference]: With dead ends: 30706 [2024-12-02 12:41:06,985 INFO L226 Difference]: Without dead ends: 22845 [2024-12-02 12:41:06,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5470 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=3809, Invalid=18541, Unknown=0, NotChecked=0, Total=22350 [2024-12-02 12:41:06,991 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 27083 mSDsluCounter, 35632 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27083 SdHoareTripleChecker+Valid, 37251 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:06,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27083 Valid, 37251 Invalid, 3318 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [154 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 12:41:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22845 states. [2024-12-02 12:41:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22845 to 14452. [2024-12-02 12:41:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14452 states, 14450 states have (on average 1.236885813148789) internal successors, (17873), 14451 states have internal predecessors, (17873), 0 states have call successors, (0), 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-02 12:41:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 17873 transitions. [2024-12-02 12:41:08,474 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 17873 transitions. Word has length 105 [2024-12-02 12:41:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:08,474 INFO L471 AbstractCegarLoop]: Abstraction has 14452 states and 17873 transitions. [2024-12-02 12:41:08,475 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-02 12:41:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 17873 transitions. [2024-12-02 12:41:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 12:41:08,475 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:08,475 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-02 12:41:08,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 12:41:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:41:08,676 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:41:08,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:08,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1775421751, now seen corresponding path program 1 times [2024-12-02 12:41:08,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:08,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156703094] [2024-12-02 12:41:08,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:09,077 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-02 12:41:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156703094] [2024-12-02 12:41:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156703094] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:41:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889777566] [2024-12-02 12:41:09,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:09,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:41:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:41:09,079 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:41:09,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 12:41:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:09,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 12:41:09,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:41:11,219 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-02 12:41:11,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:41:13,771 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-02 12:41:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889777566] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:41:13,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:41:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 44 [2024-12-02 12:41:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648532164] [2024-12-02 12:41:13,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:41:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-02 12:41:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-02 12:41:13,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-12-02 12:41:13,772 INFO L87 Difference]: Start difference. First operand 14452 states and 17873 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-02 12:41:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:22,325 INFO L93 Difference]: Finished difference Result 39167 states and 47672 transitions. [2024-12-02 12:41:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-12-02 12:41:22,326 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-02 12:41:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:22,346 INFO L225 Difference]: With dead ends: 39167 [2024-12-02 12:41:22,346 INFO L226 Difference]: Without dead ends: 29530 [2024-12-02 12:41:22,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2529, Invalid=10811, Unknown=0, NotChecked=0, Total=13340 [2024-12-02 12:41:22,353 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 24959 mSDsluCounter, 20915 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24959 SdHoareTripleChecker+Valid, 22488 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:22,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24959 Valid, 22488 Invalid, 1660 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [101 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 12:41:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29530 states. [2024-12-02 12:41:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29530 to 21999. [2024-12-02 12:41:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21999 states, 21997 states have (on average 1.2274855662135746) internal successors, (27001), 21998 states have internal predecessors, (27001), 0 states have call successors, (0), 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-02 12:41:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21999 states to 21999 states and 27001 transitions. [2024-12-02 12:41:24,886 INFO L78 Accepts]: Start accepts. Automaton has 21999 states and 27001 transitions. Word has length 107 [2024-12-02 12:41:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:24,886 INFO L471 AbstractCegarLoop]: Abstraction has 21999 states and 27001 transitions. [2024-12-02 12:41:24,887 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-02 12:41:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21999 states and 27001 transitions. [2024-12-02 12:41:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 12:41:24,888 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:24,888 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-02 12:41:24,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 12:41:25,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:41:25,089 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:41:25,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2088015337, now seen corresponding path program 1 times [2024-12-02 12:41:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:25,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750822812] [2024-12-02 12:41:25,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:25,721 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-02 12:41:25,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:25,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750822812] [2024-12-02 12:41:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750822812] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:41:25,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266317956] [2024-12-02 12:41:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:25,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:41:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:41:25,723 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:41:25,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 12:41:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:25,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 12:41:25,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:41:26,789 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-02 12:41:26,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:41:28,325 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-02 12:41:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266317956] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:41:28,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:41:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 40 [2024-12-02 12:41:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671360558] [2024-12-02 12:41:28,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:41:28,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-02 12:41:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:28,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-02 12:41:28,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 12:41:28,326 INFO L87 Difference]: Start difference. First operand 21999 states and 27001 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-02 12:41:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:33,921 INFO L93 Difference]: Finished difference Result 49728 states and 60384 transitions. [2024-12-02 12:41:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 12:41:33,922 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-02 12:41:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:33,944 INFO L225 Difference]: With dead ends: 49728 [2024-12-02 12:41:33,944 INFO L226 Difference]: Without dead ends: 34435 [2024-12-02 12:41:33,951 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-02 12:41:33,952 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 19608 mSDsluCounter, 19377 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19608 SdHoareTripleChecker+Valid, 20948 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:33,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19608 Valid, 20948 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 12:41:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34435 states. [2024-12-02 12:41:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34435 to 27308. [2024-12-02 12:41:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27308 states, 27306 states have (on average 1.2174979857906687) internal successors, (33245), 27307 states have internal predecessors, (33245), 0 states have call successors, (0), 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-02 12:41:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27308 states to 27308 states and 33245 transitions. [2024-12-02 12:41:37,593 INFO L78 Accepts]: Start accepts. Automaton has 27308 states and 33245 transitions. Word has length 107 [2024-12-02 12:41:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:37,593 INFO L471 AbstractCegarLoop]: Abstraction has 27308 states and 33245 transitions. [2024-12-02 12:41:37,594 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-02 12:41:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27308 states and 33245 transitions. [2024-12-02 12:41:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 12:41:37,595 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:37,595 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-02 12:41:37,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 12:41:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:41:37,796 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:41:37,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 117034249, now seen corresponding path program 1 times [2024-12-02 12:41:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473418882] [2024-12-02 12:41:37,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:39,379 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-02 12:41:39,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473418882] [2024-12-02 12:41:39,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473418882] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:41:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123870204] [2024-12-02 12:41:39,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:39,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:41:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:41:39,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:41:39,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 12:41:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:39,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-12-02 12:41:39,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:41:43,622 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-02 12:41:43,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:41:50,180 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-02 12:41:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123870204] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:41:50,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:41:50,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 23] total 77 [2024-12-02 12:41:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617484879] [2024-12-02 12:41:50,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:41:50,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-12-02 12:41:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:50,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-12-02 12:41:50,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=5434, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 12:41:50,182 INFO L87 Difference]: Start difference. First operand 27308 states and 33245 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-02 12:43:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:43:02,164 INFO L93 Difference]: Finished difference Result 49865 states and 60160 transitions. [2024-12-02 12:43:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-12-02 12:43:02,165 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-02 12:43:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:43:02,199 INFO L225 Difference]: With dead ends: 49865 [2024-12-02 12:43:02,199 INFO L226 Difference]: Without dead ends: 32282 [2024-12-02 12:43:02,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23641 ImplicationChecksByTransitivity, 66.2s TimeCoverageRelationStatistics Valid=9158, Invalid=57664, Unknown=0, NotChecked=0, Total=66822 [2024-12-02 12:43:02,213 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 31191 mSDsluCounter, 43064 mSDsCounter, 0 mSdLazyCounter, 6424 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31191 SdHoareTripleChecker+Valid, 44702 SdHoareTripleChecker+Invalid, 6624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 6424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:43:02,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31191 Valid, 44702 Invalid, 6624 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [200 Valid, 6424 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-12-02 12:43:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32282 states. [2024-12-02 12:43:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32282 to 27603. [2024-12-02 12:43:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27603 states, 27601 states have (on average 1.2155356689975) internal successors, (33550), 27602 states have internal predecessors, (33550), 0 states have call successors, (0), 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-02 12:43:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27603 states to 27603 states and 33550 transitions. [2024-12-02 12:43:05,862 INFO L78 Accepts]: Start accepts. Automaton has 27603 states and 33550 transitions. Word has length 107 [2024-12-02 12:43:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:43:05,862 INFO L471 AbstractCegarLoop]: Abstraction has 27603 states and 33550 transitions. [2024-12-02 12:43:05,862 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-02 12:43:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27603 states and 33550 transitions. [2024-12-02 12:43:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 12:43:05,863 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:43:05,863 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-02 12:43:05,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-02 12:43:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:43:06,064 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:43:06,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:43:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1360080118, now seen corresponding path program 1 times [2024-12-02 12:43:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:43:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257620295] [2024-12-02 12:43:06,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:43:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:43:07,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-02 12:43:07,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:43:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257620295] [2024-12-02 12:43:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257620295] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:43:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136499042] [2024-12-02 12:43:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:43:07,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:43:07,101 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:43:07,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 12:43:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:43:07,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 12:43:07,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:43:10,200 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-02 12:43:10,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:43:18,249 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-02 12:43:18,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136499042] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:43:18,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:43:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 28] total 76 [2024-12-02 12:43:18,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192733043] [2024-12-02 12:43:18,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:43:18,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-02 12:43:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:43:18,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-02 12:43:18,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=5042, Unknown=0, NotChecked=0, Total=5700 [2024-12-02 12:43:18,251 INFO L87 Difference]: Start difference. First operand 27603 states and 33550 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-02 12:44:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:10,761 INFO L93 Difference]: Finished difference Result 49626 states and 59842 transitions. [2024-12-02 12:44:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-12-02 12:44:10,761 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-02 12:44:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:10,786 INFO L225 Difference]: With dead ends: 49626 [2024-12-02 12:44:10,786 INFO L226 Difference]: Without dead ends: 32290 [2024-12-02 12:44:10,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18130 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=9606, Invalid=46326, Unknown=0, NotChecked=0, Total=55932 [2024-12-02 12:44:10,800 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 32281 mSDsluCounter, 27818 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32281 SdHoareTripleChecker+Valid, 29375 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:10,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32281 Valid, 29375 Invalid, 4080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [199 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 12:44:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32290 states. [2024-12-02 12:44:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32290 to 26466. [2024-12-02 12:44:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26466 states, 26464 states have (on average 1.2176541717049576) internal successors, (32224), 26465 states have internal predecessors, (32224), 0 states have call successors, (0), 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-02 12:44:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26466 states to 26466 states and 32224 transitions. [2024-12-02 12:44:14,451 INFO L78 Accepts]: Start accepts. Automaton has 26466 states and 32224 transitions. Word has length 108 [2024-12-02 12:44:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:14,452 INFO L471 AbstractCegarLoop]: Abstraction has 26466 states and 32224 transitions. [2024-12-02 12:44:14,452 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-02 12:44:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26466 states and 32224 transitions. [2024-12-02 12:44:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 12:44:14,452 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:14,452 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-02 12:44:14,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-12-02 12:44:14,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:44:14,653 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:44:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 896728914, now seen corresponding path program 1 times [2024-12-02 12:44:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450203540] [2024-12-02 12:44:14,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:16,049 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-02 12:44:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450203540] [2024-12-02 12:44:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450203540] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:44:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015804832] [2024-12-02 12:44:16,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:16,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:44:16,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:44:16,051 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:44:16,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 12:44:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:16,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-02 12:44:16,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:44:19,113 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-02 12:44:19,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:44:24,818 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-02 12:44:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015804832] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:44:24,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:44:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 26] total 75 [2024-12-02 12:44:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823860594] [2024-12-02 12:44:24,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:44:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-12-02 12:44:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:24,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-12-02 12:44:24,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=5136, Unknown=0, NotChecked=0, Total=5550 [2024-12-02 12:44:24,819 INFO L87 Difference]: Start difference. First operand 26466 states and 32224 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-02 12:45:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:38,443 INFO L93 Difference]: Finished difference Result 38396 states and 46452 transitions. [2024-12-02 12:45:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-12-02 12:45:38,443 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-02 12:45:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:38,463 INFO L225 Difference]: With dead ends: 38396 [2024-12-02 12:45:38,463 INFO L226 Difference]: Without dead ends: 29880 [2024-12-02 12:45:38,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21772 ImplicationChecksByTransitivity, 68.4s TimeCoverageRelationStatistics Valid=9343, Invalid=57997, Unknown=0, NotChecked=0, Total=67340 [2024-12-02 12:45:38,470 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 38052 mSDsluCounter, 31889 mSDsCounter, 0 mSdLazyCounter, 3999 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38052 SdHoareTripleChecker+Valid, 33453 SdHoareTripleChecker+Invalid, 4230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 3999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:38,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38052 Valid, 33453 Invalid, 4230 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [231 Valid, 3999 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-12-02 12:45:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29880 states. [2024-12-02 12:45:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29880 to 27064. [2024-12-02 12:45:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27064 states, 27062 states have (on average 1.2156898972729289) internal successors, (32899), 27063 states have internal predecessors, (32899), 0 states have call successors, (0), 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-02 12:45:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27064 states to 27064 states and 32899 transitions. [2024-12-02 12:45:42,402 INFO L78 Accepts]: Start accepts. Automaton has 27064 states and 32899 transitions. Word has length 108 [2024-12-02 12:45:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:42,402 INFO L471 AbstractCegarLoop]: Abstraction has 27064 states and 32899 transitions. [2024-12-02 12:45:42,402 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-02 12:45:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 27064 states and 32899 transitions. [2024-12-02 12:45:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 12:45:42,403 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:42,403 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-02 12:45:42,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-12-02 12:45:42,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:45:42,604 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:45:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1964330765, now seen corresponding path program 1 times [2024-12-02 12:45:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326579956] [2024-12-02 12:45:42,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:43,923 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-02 12:45:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326579956] [2024-12-02 12:45:43,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326579956] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:45:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056725685] [2024-12-02 12:45:43,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:45:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:45:43,925 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:45:43,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 12:45:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:44,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 12:45:44,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:45:49,762 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-02 12:45:49,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:45:54,149 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-02 12:45:54,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056725685] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:45:54,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:45:54,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2024-12-02 12:45:54,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065570754] [2024-12-02 12:45:54,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:45:54,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-12-02 12:45:54,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:54,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-12-02 12:45:54,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=4884, Unknown=0, NotChecked=0, Total=5256 [2024-12-02 12:45:54,152 INFO L87 Difference]: Start difference. First operand 27064 states and 32899 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-02 12:46:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:46:47,994 INFO L93 Difference]: Finished difference Result 47701 states and 57634 transitions. [2024-12-02 12:46:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-12-02 12:46:47,994 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-02 12:46:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:46:48,014 INFO L225 Difference]: With dead ends: 47701 [2024-12-02 12:46:48,014 INFO L226 Difference]: Without dead ends: 29201 [2024-12-02 12:46:48,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11546 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=5041, Invalid=37601, Unknown=0, NotChecked=0, Total=42642 [2024-12-02 12:46:48,022 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 34644 mSDsluCounter, 38431 mSDsCounter, 0 mSdLazyCounter, 4943 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34644 SdHoareTripleChecker+Valid, 40041 SdHoareTripleChecker+Invalid, 5180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 4943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:46:48,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34644 Valid, 40041 Invalid, 5180 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [237 Valid, 4943 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-12-02 12:46:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29201 states. [2024-12-02 12:46:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29201 to 23209. [2024-12-02 12:46:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23209 states, 23207 states have (on average 1.2214848967983798) internal successors, (28347), 23208 states have internal predecessors, (28347), 0 states have call successors, (0), 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-02 12:46:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23209 states to 23209 states and 28347 transitions. [2024-12-02 12:46:51,758 INFO L78 Accepts]: Start accepts. Automaton has 23209 states and 28347 transitions. Word has length 109 [2024-12-02 12:46:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:46:51,759 INFO L471 AbstractCegarLoop]: Abstraction has 23209 states and 28347 transitions. [2024-12-02 12:46:51,759 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-02 12:46:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 23209 states and 28347 transitions. [2024-12-02 12:46:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-02 12:46:51,761 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:46:51,761 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, 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-02 12:46:51,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-12-02 12:46:51,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-12-02 12:46:51,961 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:46:51,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:46:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -449704013, now seen corresponding path program 1 times [2024-12-02 12:46:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:46:51,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923267048] [2024-12-02 12:46:51,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:46:51,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:46:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:46:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:46:52,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:46:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923267048] [2024-12-02 12:46:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923267048] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:46:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:46:52,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:46:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222966692] [2024-12-02 12:46:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:46:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:46:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:46:52,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:46:52,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:46:52,009 INFO L87 Difference]: Start difference. First operand 23209 states and 28347 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-02 12:46:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:46:58,723 INFO L93 Difference]: Finished difference Result 26217 states and 33179 transitions. [2024-12-02 12:46:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:46:58,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-12-02 12:46:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:46:58,740 INFO L225 Difference]: With dead ends: 26217 [2024-12-02 12:46:58,740 INFO L226 Difference]: Without dead ends: 24713 [2024-12-02 12:46:58,744 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-02 12:46:58,744 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 985 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:46:58,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 653 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-12-02 12:46:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24713 states. [2024-12-02 12:47:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24713 to 24711. [2024-12-02 12:47:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24711 states, 24709 states have (on average 1.2270023068517544) internal successors, (30318), 24710 states have internal predecessors, (30318), 0 states have call successors, (0), 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-02 12:47:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24711 states to 24711 states and 30318 transitions. [2024-12-02 12:47:02,739 INFO L78 Accepts]: Start accepts. Automaton has 24711 states and 30318 transitions. Word has length 138 [2024-12-02 12:47:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:47:02,739 INFO L471 AbstractCegarLoop]: Abstraction has 24711 states and 30318 transitions. [2024-12-02 12:47:02,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-02 12:47:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24711 states and 30318 transitions. [2024-12-02 12:47:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 12:47:02,743 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:47:02,743 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-02 12:47:02,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 12:47:02,743 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:47:02,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 289672907, now seen corresponding path program 1 times [2024-12-02 12:47:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:47:02,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012000900] [2024-12-02 12:47:02,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:47:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:03,319 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-02 12:47:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:47:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012000900] [2024-12-02 12:47:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012000900] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:47:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559816396] [2024-12-02 12:47:03,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:03,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:03,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:03,321 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:03,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 12:47:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:03,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-02 12:47:03,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:05,943 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-02 12:47:05,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:47:12,742 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-02 12:47:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559816396] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:47:12,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:47:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28, 27] total 59 [2024-12-02 12:47:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400975377] [2024-12-02 12:47:12,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:47:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 12:47:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:47:12,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 12:47:12,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 12:47:12,743 INFO L87 Difference]: Start difference. First operand 24711 states and 30318 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-02 12:47:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:47:21,729 INFO L93 Difference]: Finished difference Result 42396 states and 51896 transitions. [2024-12-02 12:47:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-12-02 12:47:21,730 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-02 12:47:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:47:21,753 INFO L225 Difference]: With dead ends: 42396 [2024-12-02 12:47:21,753 INFO L226 Difference]: Without dead ends: 32039 [2024-12-02 12:47:21,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2440, Invalid=9992, Unknown=0, NotChecked=0, Total=12432 [2024-12-02 12:47:21,759 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 19848 mSDsluCounter, 26029 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19848 SdHoareTripleChecker+Valid, 27562 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:47:21,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19848 Valid, 27562 Invalid, 1946 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 12:47:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32039 states. [2024-12-02 12:47:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32039 to 19742. [2024-12-02 12:47:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19742 states, 19740 states have (on average 1.2249746707193516) internal successors, (24181), 19741 states have internal predecessors, (24181), 0 states have call successors, (0), 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-02 12:47:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19742 states to 19742 states and 24181 transitions. [2024-12-02 12:47:24,861 INFO L78 Accepts]: Start accepts. Automaton has 19742 states and 24181 transitions. Word has length 146 [2024-12-02 12:47:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:47:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 19742 states and 24181 transitions. [2024-12-02 12:47:24,861 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-02 12:47:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 19742 states and 24181 transitions. [2024-12-02 12:47:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 12:47:24,863 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:47:24,863 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-02 12:47:24,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-02 12:47:25,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-12-02 12:47:25,063 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:47:25,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 283574013, now seen corresponding path program 1 times [2024-12-02 12:47:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:47:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476528955] [2024-12-02 12:47:25,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:47:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:25,717 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-02 12:47:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:47:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476528955] [2024-12-02 12:47:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476528955] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:47:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246990441] [2024-12-02 12:47:25,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:25,719 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:25,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 12:47:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:25,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 12:47:25,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:27,781 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-02 12:47:27,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:47:33,321 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-02 12:47:33,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246990441] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:47:33,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:47:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 20] total 60 [2024-12-02 12:47:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436223468] [2024-12-02 12:47:33,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:47:33,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 12:47:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:47:33,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 12:47:33,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3223, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 12:47:33,323 INFO L87 Difference]: Start difference. First operand 19742 states and 24181 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-02 12:47:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:47:58,618 INFO L93 Difference]: Finished difference Result 47976 states and 57677 transitions. [2024-12-02 12:47:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-12-02 12:47:58,619 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-02 12:47:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:47:58,645 INFO L225 Difference]: With dead ends: 47976 [2024-12-02 12:47:58,645 INFO L226 Difference]: Without dead ends: 34907 [2024-12-02 12:47:58,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8251 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4683, Invalid=25419, Unknown=0, NotChecked=0, Total=30102 [2024-12-02 12:47:58,652 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 27901 mSDsluCounter, 34626 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27901 SdHoareTripleChecker+Valid, 36149 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 12:47:58,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27901 Valid, 36149 Invalid, 2705 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [192 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 12:47:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34907 states. [2024-12-02 12:48:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34907 to 28733. [2024-12-02 12:48:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28733 states, 28731 states have (on average 1.205840381469493) internal successors, (34645), 28732 states have internal predecessors, (34645), 0 states have call successors, (0), 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-02 12:48:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28733 states to 28733 states and 34645 transitions. [2024-12-02 12:48:04,372 INFO L78 Accepts]: Start accepts. Automaton has 28733 states and 34645 transitions. Word has length 146 [2024-12-02 12:48:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:48:04,372 INFO L471 AbstractCegarLoop]: Abstraction has 28733 states and 34645 transitions. [2024-12-02 12:48:04,373 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-02 12:48:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28733 states and 34645 transitions. [2024-12-02 12:48:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 12:48:04,374 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:48:04,374 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-02 12:48:04,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-02 12:48:04,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 12:48:04,575 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:48:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:48:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1346272192, now seen corresponding path program 1 times [2024-12-02 12:48:04,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:48:04,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000195742] [2024-12-02 12:48:04,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:04,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:48:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:05,838 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-02 12:48:05,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:48:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000195742] [2024-12-02 12:48:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000195742] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:48:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465576885] [2024-12-02 12:48:05,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:05,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:05,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:48:05,840 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:48:05,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-02 12:48:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:05,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 12:48:05,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:48:08,047 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-02 12:48:08,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:48:11,460 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-02 12:48:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465576885] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:48:11,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:48:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 18] total 60 [2024-12-02 12:48:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451433655] [2024-12-02 12:48:11,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:48:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 12:48:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:48:11,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 12:48:11,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3312, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 12:48:11,463 INFO L87 Difference]: Start difference. First operand 28733 states and 34645 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-02 12:48:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:48:50,542 INFO L93 Difference]: Finished difference Result 45722 states and 54665 transitions. [2024-12-02 12:48:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2024-12-02 12:48:50,543 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-02 12:48:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:48:50,563 INFO L225 Difference]: With dead ends: 45722 [2024-12-02 12:48:50,563 INFO L226 Difference]: Without dead ends: 28498 [2024-12-02 12:48:50,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16408 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=8009, Invalid=45583, Unknown=0, NotChecked=0, Total=53592 [2024-12-02 12:48:50,570 INFO L435 NwaCegarLoop]: 1689 mSDtfsCounter, 36435 mSDsluCounter, 42976 mSDsCounter, 0 mSdLazyCounter, 6377 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36435 SdHoareTripleChecker+Valid, 44665 SdHoareTripleChecker+Invalid, 6527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 6377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:48:50,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36435 Valid, 44665 Invalid, 6527 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [150 Valid, 6377 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-12-02 12:48:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28498 states. [2024-12-02 12:48:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28498 to 24289. [2024-12-02 12:48:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24289 states, 24287 states have (on average 1.2108947173384939) internal successors, (29409), 24288 states have internal predecessors, (29409), 0 states have call successors, (0), 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-02 12:48:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24289 states to 24289 states and 29409 transitions. [2024-12-02 12:48:55,061 INFO L78 Accepts]: Start accepts. Automaton has 24289 states and 29409 transitions. Word has length 147 [2024-12-02 12:48:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:48:55,061 INFO L471 AbstractCegarLoop]: Abstraction has 24289 states and 29409 transitions. [2024-12-02 12:48:55,061 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-02 12:48:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 24289 states and 29409 transitions. [2024-12-02 12:48:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-02 12:48:55,063 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:48:55,063 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-02 12:48:55,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-12-02 12:48:55,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 12:48:55,263 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:48:55,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:48:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash -970975155, now seen corresponding path program 1 times [2024-12-02 12:48:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:48:55,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903027407] [2024-12-02 12:48:55,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:48:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:55,425 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-02 12:48:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:48:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903027407] [2024-12-02 12:48:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903027407] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:48:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686837079] [2024-12-02 12:48:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:55,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:55,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:48:55,426 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:48:55,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-12-02 12:48:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:55,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 12:48:55,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:48:55,743 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-02 12:48:55,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:48:56,227 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-02 12:48:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686837079] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:48:56,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:48:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2024-12-02 12:48:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566515943] [2024-12-02 12:48:56,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:48:56,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 12:48:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:48:56,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 12:48:56,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-12-02 12:48:56,228 INFO L87 Difference]: Start difference. First operand 24289 states and 29409 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-02 12:49:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:49:00,420 INFO L93 Difference]: Finished difference Result 49286 states and 60525 transitions. [2024-12-02 12:49:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 12:49:00,420 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-02 12:49:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:49:00,442 INFO L225 Difference]: With dead ends: 49286 [2024-12-02 12:49:00,442 INFO L226 Difference]: Without dead ends: 28744 [2024-12-02 12:49:00,449 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-02 12:49:00,450 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 1611 mSDsluCounter, 10790 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 12362 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:49:00,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 12362 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:49:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28744 states. [2024-12-02 12:49:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28744 to 28740. [2024-12-02 12:49:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28740 states, 28738 states have (on average 1.184807571856079) internal successors, (34049), 28739 states have internal predecessors, (34049), 0 states have call successors, (0), 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-02 12:49:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28740 states to 28740 states and 34049 transitions. [2024-12-02 12:49:04,486 INFO L78 Accepts]: Start accepts. Automaton has 28740 states and 34049 transitions. Word has length 148 [2024-12-02 12:49:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:49:04,487 INFO L471 AbstractCegarLoop]: Abstraction has 28740 states and 34049 transitions. [2024-12-02 12:49:04,487 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-02 12:49:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 28740 states and 34049 transitions. [2024-12-02 12:49:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-02 12:49:04,488 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:49:04,488 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-02 12:49:04,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-12-02 12:49:04,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:49:04,689 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:49:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:49:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash -352711843, now seen corresponding path program 1 times [2024-12-02 12:49:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:49:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798330536] [2024-12-02 12:49:04,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:49:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:49:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:49:05,962 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-02 12:49:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:49:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798330536] [2024-12-02 12:49:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798330536] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:49:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012621838] [2024-12-02 12:49:05,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:49:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:49:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:49:05,963 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:49:05,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-12-02 12:49:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:49:06,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 12:49:06,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:49:08,403 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-02 12:49:08,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:49:11,665 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-02 12:49:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012621838] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:49:11,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:49:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 19] total 62 [2024-12-02 12:49:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358653932] [2024-12-02 12:49:11,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:49:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-02 12:49:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:49:11,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-02 12:49:11,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3490, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 12:49:11,667 INFO L87 Difference]: Start difference. First operand 28740 states and 34049 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-02 12:50:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:50:06,298 INFO L93 Difference]: Finished difference Result 48549 states and 57004 transitions. [2024-12-02 12:50:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2024-12-02 12:50:06,298 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-02 12:50:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:50:06,317 INFO L225 Difference]: With dead ends: 48549 [2024-12-02 12:50:06,318 INFO L226 Difference]: Without dead ends: 27644 [2024-12-02 12:50:06,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25932 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=12437, Invalid=59655, Unknown=0, NotChecked=0, Total=72092 [2024-12-02 12:50:06,326 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 38588 mSDsluCounter, 25551 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38588 SdHoareTripleChecker+Valid, 27119 SdHoareTripleChecker+Invalid, 4192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:50:06,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38588 Valid, 27119 Invalid, 4192 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [156 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-12-02 12:50:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27644 states. [2024-12-02 12:50:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27644 to 18452. [2024-12-02 12:50:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18452 states, 18450 states have (on average 1.1977235772357724) internal successors, (22098), 18451 states have internal predecessors, (22098), 0 states have call successors, (0), 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-02 12:50:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 22098 transitions. [2024-12-02 12:50:08,909 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 22098 transitions. Word has length 148 [2024-12-02 12:50:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:50:08,910 INFO L471 AbstractCegarLoop]: Abstraction has 18452 states and 22098 transitions. [2024-12-02 12:50:08,910 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-02 12:50:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 22098 transitions. [2024-12-02 12:50:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-02 12:50:08,911 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:50:08,911 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-02 12:50:08,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-12-02 12:50:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:50:09,111 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:50:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:50:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 666783477, now seen corresponding path program 1 times [2024-12-02 12:50:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:50:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863554319] [2024-12-02 12:50:09,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:50:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:50:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 12:50:09,141 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 12:50:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 12:50:09,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 12:50:09,208 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 12:50:09,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-12-02 12:50:09,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-02 12:50:09,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 12:50:09,213 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] [2024-12-02 12:50:09,301 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 12:50:09,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:50:09 BoogieIcfgContainer [2024-12-02 12:50:09,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 12:50:09,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 12:50:09,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 12:50:09,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 12:50:09,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:15" (3/4) ... [2024-12-02 12:50:09,306 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 12:50:09,411 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 154. [2024-12-02 12:50:09,499 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 12:50:09,499 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 12:50:09,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 12:50:09,500 INFO L158 Benchmark]: Toolchain (without parser) took 780913.63ms. Allocated memory was 117.4MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 78.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-12-02 12:50:09,500 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:50:09,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1472.24ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 78.5MB in the beginning and 100.0MB in the end (delta: -21.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2024-12-02 12:50:09,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 358.22ms. Allocated memory is still 201.3MB. Free memory was 100.0MB in the beginning and 104.4MB in the end (delta: -4.4MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2024-12-02 12:50:09,501 INFO L158 Benchmark]: Boogie Preprocessor took 519.48ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 104.4MB in the beginning and 248.7MB in the end (delta: -144.3MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-12-02 12:50:09,501 INFO L158 Benchmark]: RCFGBuilder took 4442.89ms. Allocated memory is still 369.1MB. Free memory was 248.7MB in the beginning and 208.5MB in the end (delta: 40.2MB). Peak memory consumption was 185.9MB. Max. memory is 16.1GB. [2024-12-02 12:50:09,501 INFO L158 Benchmark]: TraceAbstraction took 773919.43ms. Allocated memory was 369.1MB in the beginning and 3.5GB in the end (delta: 3.1GB). Free memory was 208.5MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-02 12:50:09,501 INFO L158 Benchmark]: Witness Printer took 194.52ms. Allocated memory is still 3.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-12-02 12:50:09,502 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.23ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1472.24ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 78.5MB in the beginning and 100.0MB in the end (delta: -21.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 358.22ms. Allocated memory is still 201.3MB. Free memory was 100.0MB in the beginning and 104.4MB in the end (delta: -4.4MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 519.48ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 104.4MB in the beginning and 248.7MB in the end (delta: -144.3MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4442.89ms. Allocated memory is still 369.1MB. Free memory was 248.7MB in the beginning and 208.5MB in the end (delta: 40.2MB). Peak memory consumption was 185.9MB. Max. memory is 16.1GB. * TraceAbstraction took 773919.43ms. Allocated memory was 369.1MB in the beginning and 3.5GB in the end (delta: 3.1GB). Free memory was 208.5MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 194.52ms. Allocated memory is still 3.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 501]: 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: 773.8s, OverallIterations: 43, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 562.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 607872 SdHoareTripleChecker+Valid, 55.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 607872 mSDsluCounter, 680391 SdHoareTripleChecker+Invalid, 49.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 617228 mSDsCounter, 3968 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65349 IncrementalHoareTripleChecker+Invalid, 69317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3968 mSolverCounterUnsat, 63163 mSDtfsCounter, 65349 mSolverCounterSat, 1.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7814 GetRequests, 4394 SyntacticMatches, 10 SemanticMatches, 3410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195732 ImplicationChecksByTransitivity, 483.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28740occurred in iteration=41, InterpolantAutomatonStates: 2378, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.4s AutomataMinimizationTime, 42 MinimizatonAttempts, 109047 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 148.1s InterpolantComputationTime, 6091 NumberOfCodeBlocks, 6091 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 8401 ConstructedInterpolants, 10 QuantifiedInterpolants, 194749 SizeOfPredicates, 180 NumberOfNonLiveVariables, 10480 ConjunctsInSsa, 806 ConjunctsInUnsatCore, 92 InterpolantComputations, 17 PerfectInterpolantSequences, 2454/7700 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-02 12:50:09,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ffb552-17fd-439b-a2a3-1224a6720944/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