./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/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_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/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_a0c77dca-eab7-47df-919a-deaf8fe66045/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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:07:14,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:07:14,485 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:07:14,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:07:14,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:07:14,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:07:14,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:07:14,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:07:14,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:07:14,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:07:14,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:07:14,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:07:14,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:07:14,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:07:14,511 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:07:14,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:07:14,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:07:14,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:07:14,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:07:14,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:07:14,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:07:14,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:07:14,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:07:14,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:07:14,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:07:14,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:07:14,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:07:14,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:07:14,514 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_a0c77dca-eab7-47df-919a-deaf8fe66045/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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-12-02 14:07:14,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:07:14,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:07:14,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:07:14,760 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:07:14,761 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:07:14,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-12-02 14:07:17,388 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/data/3339f3410/63818cfccfb84cd88e1cceeffa71eda4/FLAG42c20ef75 [2024-12-02 14:07:17,563 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:07:17,564 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-12-02 14:07:17,571 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/data/3339f3410/63818cfccfb84cd88e1cceeffa71eda4/FLAG42c20ef75 [2024-12-02 14:07:17,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/data/3339f3410/63818cfccfb84cd88e1cceeffa71eda4 [2024-12-02 14:07:17,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:07:17,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:07:17,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:07:17,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:07:17,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:07:17,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb171db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17, skipping insertion in model container [2024-12-02 14:07:17,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:07:17,760 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_a0c77dca-eab7-47df-919a-deaf8fe66045/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-12-02 14:07:17,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:07:17,771 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:07:17,806 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_a0c77dca-eab7-47df-919a-deaf8fe66045/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-12-02 14:07:17,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:07:17,819 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:07:17,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17 WrapperNode [2024-12-02 14:07:17,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:07:17,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:07:17,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:07:17,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:07:17,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,859 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-12-02 14:07:17,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:07:17,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:07:17,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:07:17,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:07:17,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,883 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 14:07:17,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:07:17,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:07:17,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:07:17,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:07:17,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (1/1) ... [2024-12-02 14:07:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:07:17,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:07:17,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:07:17,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:07:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:07:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:07:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:07:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:07:18,008 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:07:18,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:07:18,312 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-12-02 14:07:18,312 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:07:18,320 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:07:18,320 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 14:07:18,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:07:18 BoogieIcfgContainer [2024-12-02 14:07:18,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:07:18,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:07:18,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:07:18,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:07:18,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:07:17" (1/3) ... [2024-12-02 14:07:18,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed1dba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:07:18, skipping insertion in model container [2024-12-02 14:07:18,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:17" (2/3) ... [2024-12-02 14:07:18,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed1dba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:07:18, skipping insertion in model container [2024-12-02 14:07:18,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:07:18" (3/3) ... [2024-12-02 14:07:18,329 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-12-02 14:07:18,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:07:18,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c that has 1 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 14:07:18,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:07:18,399 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;@28e35c32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:07:18,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:07:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 66 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 14:07:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 14:07:18,407 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:18,408 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] [2024-12-02 14:07:18,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 3396944, now seen corresponding path program 1 times [2024-12-02 14:07:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357961868] [2024-12-02 14:07:18,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:18,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:18,745 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 14:07:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357961868] [2024-12-02 14:07:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357961868] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:18,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:07:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988197186] [2024-12-02 14:07:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:18,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:07:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:18,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:07:18,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:07:18,767 INFO L87 Difference]: Start difference. First operand has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 66 states have internal predecessors, (110), 0 states have call successors, (0), 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 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 14:07:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:18,856 INFO L93 Difference]: Finished difference Result 155 states and 250 transitions. [2024-12-02 14:07:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:07:18,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-12-02 14:07:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:18,866 INFO L225 Difference]: With dead ends: 155 [2024-12-02 14:07:18,866 INFO L226 Difference]: Without dead ends: 103 [2024-12-02 14:07:18,868 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 14:07:18,871 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 62 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:18,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 387 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:07:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-12-02 14:07:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2024-12-02 14:07:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 14:07:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-12-02 14:07:18,901 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 26 [2024-12-02 14:07:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:18,901 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-12-02 14:07:18,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 14:07:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-12-02 14:07:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:07:18,903 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:18,903 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] [2024-12-02 14:07:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:07:18,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:18,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1598475046, now seen corresponding path program 1 times [2024-12-02 14:07:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812444960] [2024-12-02 14:07:18,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:19,015 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 14:07:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:19,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812444960] [2024-12-02 14:07:19,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812444960] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:19,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:19,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444904591] [2024-12-02 14:07:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:19,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:19,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:19,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:19,018 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 14:07:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:19,045 INFO L93 Difference]: Finished difference Result 135 states and 198 transitions. [2024-12-02 14:07:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:19,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-12-02 14:07:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:19,046 INFO L225 Difference]: With dead ends: 135 [2024-12-02 14:07:19,046 INFO L226 Difference]: Without dead ends: 95 [2024-12-02 14:07:19,047 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 14:07:19,048 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 42 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:19,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-12-02 14:07:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-12-02 14:07:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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 14:07:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-12-02 14:07:19,057 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 42 [2024-12-02 14:07:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:19,057 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-12-02 14:07:19,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 14:07:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-12-02 14:07:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:07:19,058 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:19,058 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] [2024-12-02 14:07:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:07:19,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1802236571, now seen corresponding path program 1 times [2024-12-02 14:07:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:19,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738169239] [2024-12-02 14:07:19,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:19,209 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 14:07:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:19,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738169239] [2024-12-02 14:07:19,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738169239] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:19,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:19,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:07:19,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377065298] [2024-12-02 14:07:19,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:19,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:07:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:19,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:07:19,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:07:19,212 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 14:07:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:19,298 INFO L93 Difference]: Finished difference Result 373 states and 573 transitions. [2024-12-02 14:07:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:07:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-12-02 14:07:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:19,300 INFO L225 Difference]: With dead ends: 373 [2024-12-02 14:07:19,301 INFO L226 Difference]: Without dead ends: 303 [2024-12-02 14:07:19,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:07:19,302 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 310 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:19,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 359 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-12-02 14:07:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 161. [2024-12-02 14:07:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.4875) internal successors, (238), 160 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 14:07:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2024-12-02 14:07:19,318 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 42 [2024-12-02 14:07:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:19,318 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2024-12-02 14:07:19,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 14:07:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2024-12-02 14:07:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-02 14:07:19,320 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:19,320 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] [2024-12-02 14:07:19,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:07:19,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:19,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash -348564613, now seen corresponding path program 1 times [2024-12-02 14:07:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:19,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930549921] [2024-12-02 14:07:19,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:19,548 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 14:07:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930549921] [2024-12-02 14:07:19,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930549921] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:19,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:19,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:07:19,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701375978] [2024-12-02 14:07:19,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:19,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:07:19,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:19,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:07:19,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:07:19,550 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 14:07:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:19,578 INFO L93 Difference]: Finished difference Result 175 states and 255 transitions. [2024-12-02 14:07:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:07:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-12-02 14:07:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:19,579 INFO L225 Difference]: With dead ends: 175 [2024-12-02 14:07:19,579 INFO L226 Difference]: Without dead ends: 173 [2024-12-02 14:07:19,580 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 14:07:19,580 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:19,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-12-02 14:07:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-12-02 14:07:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 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 14:07:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-12-02 14:07:19,591 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 43 [2024-12-02 14:07:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:19,591 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-12-02 14:07:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 14:07:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-12-02 14:07:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:07:19,592 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:19,593 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] [2024-12-02 14:07:19,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:07:19,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:19,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2131977331, now seen corresponding path program 1 times [2024-12-02 14:07:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:19,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598867776] [2024-12-02 14:07:19,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:19,678 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 14:07:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598867776] [2024-12-02 14:07:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598867776] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:19,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106268198] [2024-12-02 14:07:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:19,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:19,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:19,680 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 14:07:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:19,704 INFO L93 Difference]: Finished difference Result 443 states and 654 transitions. [2024-12-02 14:07:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:19,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-12-02 14:07:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:19,707 INFO L225 Difference]: With dead ends: 443 [2024-12-02 14:07:19,707 INFO L226 Difference]: Without dead ends: 293 [2024-12-02 14:07:19,707 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 14:07:19,708 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:19,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-12-02 14:07:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-12-02 14:07:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4551724137931035) internal successors, (422), 290 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 14:07:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 422 transitions. [2024-12-02 14:07:19,727 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 422 transitions. Word has length 44 [2024-12-02 14:07:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 422 transitions. [2024-12-02 14:07:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 14:07:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 422 transitions. [2024-12-02 14:07:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:07:19,729 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:19,729 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] [2024-12-02 14:07:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:07:19,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1708095991, now seen corresponding path program 1 times [2024-12-02 14:07:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611976753] [2024-12-02 14:07:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:19,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 14:07:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611976753] [2024-12-02 14:07:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611976753] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:19,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899466765] [2024-12-02 14:07:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:19,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:19,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:19,803 INFO L87 Difference]: Start difference. First operand 291 states and 422 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 14:07:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:19,832 INFO L93 Difference]: Finished difference Result 566 states and 832 transitions. [2024-12-02 14:07:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-12-02 14:07:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:19,835 INFO L225 Difference]: With dead ends: 566 [2024-12-02 14:07:19,835 INFO L226 Difference]: Without dead ends: 416 [2024-12-02 14:07:19,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:19,836 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:19,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-12-02 14:07:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-12-02 14:07:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.450363196125908) internal successors, (599), 413 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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 14:07:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 599 transitions. [2024-12-02 14:07:19,857 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 599 transitions. Word has length 44 [2024-12-02 14:07:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 599 transitions. [2024-12-02 14:07:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 14:07:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 599 transitions. [2024-12-02 14:07:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-02 14:07:19,859 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:19,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, 1, 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 14:07:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:07:19,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1168011820, now seen corresponding path program 1 times [2024-12-02 14:07:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614106016] [2024-12-02 14:07:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:19,928 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 14:07:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614106016] [2024-12-02 14:07:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614106016] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:19,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:19,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081194507] [2024-12-02 14:07:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:19,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:19,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:19,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:19,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:19,930 INFO L87 Difference]: Start difference. First operand 414 states and 599 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 14:07:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:19,962 INFO L93 Difference]: Finished difference Result 1094 states and 1577 transitions. [2024-12-02 14:07:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-12-02 14:07:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:19,966 INFO L225 Difference]: With dead ends: 1094 [2024-12-02 14:07:19,966 INFO L226 Difference]: Without dead ends: 706 [2024-12-02 14:07:19,967 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 14:07:19,967 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:19,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-12-02 14:07:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2024-12-02 14:07:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.4096728307254622) internal successors, (991), 703 states have internal predecessors, (991), 0 states have call successors, (0), 0 states 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 14:07:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 991 transitions. [2024-12-02 14:07:20,003 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 991 transitions. Word has length 45 [2024-12-02 14:07:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:20,004 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 991 transitions. [2024-12-02 14:07:20,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 14:07:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 991 transitions. [2024-12-02 14:07:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:07:20,005 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:20,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:20,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:07:20,006 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:20,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash 936276697, now seen corresponding path program 1 times [2024-12-02 14:07:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704848707] [2024-12-02 14:07:20,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:20,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704848707] [2024-12-02 14:07:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704848707] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:20,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512847109] [2024-12-02 14:07:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:20,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:20,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:20,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:20,148 INFO L87 Difference]: Start difference. First operand 704 states and 991 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 14:07:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:20,180 INFO L93 Difference]: Finished difference Result 1384 states and 1957 transitions. [2024-12-02 14:07:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 14:07:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:20,183 INFO L225 Difference]: With dead ends: 1384 [2024-12-02 14:07:20,183 INFO L226 Difference]: Without dead ends: 706 [2024-12-02 14:07:20,184 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 14:07:20,185 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:20,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-12-02 14:07:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2024-12-02 14:07:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.3926031294452348) internal successors, (979), 703 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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 14:07:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 979 transitions. [2024-12-02 14:07:20,220 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 979 transitions. Word has length 64 [2024-12-02 14:07:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:20,220 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 979 transitions. [2024-12-02 14:07:20,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 14:07:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 979 transitions. [2024-12-02 14:07:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:07:20,221 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:20,221 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] [2024-12-02 14:07:20,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:07:20,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:20,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash -548746792, now seen corresponding path program 1 times [2024-12-02 14:07:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547425081] [2024-12-02 14:07:20,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 14:07:20,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547425081] [2024-12-02 14:07:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547425081] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:07:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612484946] [2024-12-02 14:07:20,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:07:20,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:07:20,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:07:20,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:07:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:20,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 14:07:20,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:07:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:20,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:07:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612484946] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:07:21,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:07:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 8] total 13 [2024-12-02 14:07:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339820862] [2024-12-02 14:07:21,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:07:21,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:07:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:21,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:07:21,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:07:21,362 INFO L87 Difference]: Start difference. First operand 704 states and 979 transitions. Second operand has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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 14:07:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:22,095 INFO L93 Difference]: Finished difference Result 2938 states and 4114 transitions. [2024-12-02 14:07:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 14:07:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 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 14:07:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:22,105 INFO L225 Difference]: With dead ends: 2938 [2024-12-02 14:07:22,105 INFO L226 Difference]: Without dead ends: 2464 [2024-12-02 14:07:22,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 14:07:22,107 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 579 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:22,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 810 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:07:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-12-02 14:07:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2452. [2024-12-02 14:07:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2451 states have (on average 1.3818849449204407) internal successors, (3387), 2451 states have internal predecessors, (3387), 0 states have call successors, (0), 0 states 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 14:07:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3387 transitions. [2024-12-02 14:07:22,199 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3387 transitions. Word has length 64 [2024-12-02 14:07:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:22,200 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3387 transitions. [2024-12-02 14:07:22,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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 14:07:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3387 transitions. [2024-12-02 14:07:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 14:07:22,201 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:22,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:22,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:07:22,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:07:22,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:22,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1814113776, now seen corresponding path program 1 times [2024-12-02 14:07:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166346237] [2024-12-02 14:07:22,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 14:07:22,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:22,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166346237] [2024-12-02 14:07:22,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166346237] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:22,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:22,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:07:22,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680131486] [2024-12-02 14:07:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:07:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:22,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:07:22,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:07:22,508 INFO L87 Difference]: Start difference. First operand 2452 states and 3387 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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 14:07:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:22,631 INFO L93 Difference]: Finished difference Result 6104 states and 8497 transitions. [2024-12-02 14:07:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:07:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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 65 [2024-12-02 14:07:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:22,647 INFO L225 Difference]: With dead ends: 6104 [2024-12-02 14:07:22,648 INFO L226 Difference]: Without dead ends: 4818 [2024-12-02 14:07:22,650 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 14:07:22,651 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 215 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:22,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 381 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2024-12-02 14:07:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3652. [2024-12-02 14:07:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 3651 states have (on average 1.376883045740893) internal successors, (5027), 3651 states have internal predecessors, (5027), 0 states have call successors, (0), 0 states 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 14:07:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5027 transitions. [2024-12-02 14:07:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5027 transitions. Word has length 65 [2024-12-02 14:07:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:22,795 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 5027 transitions. [2024-12-02 14:07:22,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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 14:07:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5027 transitions. [2024-12-02 14:07:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 14:07:22,796 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:22,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:22,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:07:22,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:22,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash 301231570, now seen corresponding path program 1 times [2024-12-02 14:07:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:22,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103826204] [2024-12-02 14:07:22,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 14:07:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103826204] [2024-12-02 14:07:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103826204] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:07:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800686642] [2024-12-02 14:07:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:07:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:22,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:07:22,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:07:22,892 INFO L87 Difference]: Start difference. First operand 3652 states and 5027 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:07:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:23,043 INFO L93 Difference]: Finished difference Result 7304 states and 10137 transitions. [2024-12-02 14:07:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:07:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 14:07:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:23,061 INFO L225 Difference]: With dead ends: 7304 [2024-12-02 14:07:23,061 INFO L226 Difference]: Without dead ends: 6018 [2024-12-02 14:07:23,063 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 14:07:23,063 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 223 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:23,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 370 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2024-12-02 14:07:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 4852. [2024-12-02 14:07:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4851 states have (on average 1.3743558029272316) internal successors, (6667), 4851 states have internal predecessors, (6667), 0 states have call successors, (0), 0 states 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 14:07:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6667 transitions. [2024-12-02 14:07:23,226 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6667 transitions. Word has length 65 [2024-12-02 14:07:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 6667 transitions. [2024-12-02 14:07:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:07:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6667 transitions. [2024-12-02 14:07:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 14:07:23,227 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:23,228 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, 1, 1, 1, 1] [2024-12-02 14:07:23,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:07:23,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:23,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1117470959, now seen corresponding path program 1 times [2024-12-02 14:07:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:23,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784315062] [2024-12-02 14:07:23,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 14:07:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784315062] [2024-12-02 14:07:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784315062] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:07:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139814028] [2024-12-02 14:07:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:23,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:07:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:23,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:07:23,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:07:23,327 INFO L87 Difference]: Start difference. First operand 4852 states and 6667 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 14:07:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:23,485 INFO L93 Difference]: Finished difference Result 8192 states and 11323 transitions. [2024-12-02 14:07:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:07:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 65 [2024-12-02 14:07:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:23,504 INFO L225 Difference]: With dead ends: 8192 [2024-12-02 14:07:23,504 INFO L226 Difference]: Without dead ends: 7106 [2024-12-02 14:07:23,507 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 14:07:23,507 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:23,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 401 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2024-12-02 14:07:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 5940. [2024-12-02 14:07:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5940 states, 5939 states have (on average 1.371443003872706) internal successors, (8145), 5939 states have internal predecessors, (8145), 0 states have call successors, (0), 0 states 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 14:07:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5940 states to 5940 states and 8145 transitions. [2024-12-02 14:07:23,762 INFO L78 Accepts]: Start accepts. Automaton has 5940 states and 8145 transitions. Word has length 65 [2024-12-02 14:07:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:23,762 INFO L471 AbstractCegarLoop]: Abstraction has 5940 states and 8145 transitions. [2024-12-02 14:07:23,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 14:07:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5940 states and 8145 transitions. [2024-12-02 14:07:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 14:07:23,763 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:23,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:23,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:07:23,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1810346494, now seen corresponding path program 1 times [2024-12-02 14:07:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680684104] [2024-12-02 14:07:23,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680684104] [2024-12-02 14:07:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680684104] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893151072] [2024-12-02 14:07:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:23,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:23,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:23,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:23,870 INFO L87 Difference]: Start difference. First operand 5940 states and 8145 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:07:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:23,953 INFO L93 Difference]: Finished difference Result 8519 states and 11639 transitions. [2024-12-02 14:07:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:23,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-12-02 14:07:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:23,960 INFO L225 Difference]: With dead ends: 8519 [2024-12-02 14:07:23,960 INFO L226 Difference]: Without dead ends: 2605 [2024-12-02 14:07:23,965 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 14:07:23,965 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:23,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2024-12-02 14:07:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2083. [2024-12-02 14:07:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.3592699327569644) internal successors, (2830), 2082 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states 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 14:07:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2830 transitions. [2024-12-02 14:07:24,031 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2830 transitions. Word has length 68 [2024-12-02 14:07:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:24,031 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 2830 transitions. [2024-12-02 14:07:24,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:07:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2830 transitions. [2024-12-02 14:07:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 14:07:24,032 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:24,032 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:07:24,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash 670844669, now seen corresponding path program 1 times [2024-12-02 14:07:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721642010] [2024-12-02 14:07:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721642010] [2024-12-02 14:07:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721642010] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:07:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264729837] [2024-12-02 14:07:24,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:07:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:07:24,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:07:24,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:07:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:24,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 14:07:24,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:07:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:25,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:07:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264729837] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:07:26,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:07:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 14:07:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872877113] [2024-12-02 14:07:26,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:07:26,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:07:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:26,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:07:26,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:07:26,471 INFO L87 Difference]: Start difference. First operand 2083 states and 2830 transitions. Second operand has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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 14:07:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:34,779 INFO L93 Difference]: Finished difference Result 26458 states and 36856 transitions. [2024-12-02 14:07:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-12-02 14:07:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 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 68 [2024-12-02 14:07:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:34,809 INFO L225 Difference]: With dead ends: 26458 [2024-12-02 14:07:34,809 INFO L226 Difference]: Without dead ends: 24441 [2024-12-02 14:07:34,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8013 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3753, Invalid=18299, Unknown=0, NotChecked=0, Total=22052 [2024-12-02 14:07:34,816 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 6292 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6292 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:34,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6292 Valid, 1501 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 14:07:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24441 states. [2024-12-02 14:07:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24441 to 12297. [2024-12-02 14:07:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12296 states have (on average 1.3648340923877684) internal successors, (16782), 12296 states have internal predecessors, (16782), 0 states have call successors, (0), 0 states 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 14:07:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16782 transitions. [2024-12-02 14:07:35,221 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16782 transitions. Word has length 68 [2024-12-02 14:07:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:35,222 INFO L471 AbstractCegarLoop]: Abstraction has 12297 states and 16782 transitions. [2024-12-02 14:07:35,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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 14:07:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16782 transitions. [2024-12-02 14:07:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 14:07:35,223 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:35,223 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:35,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 14:07:35,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-12-02 14:07:35,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:35,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1260630787, now seen corresponding path program 1 times [2024-12-02 14:07:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492200373] [2024-12-02 14:07:35,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492200373] [2024-12-02 14:07:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492200373] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:35,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410280236] [2024-12-02 14:07:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:35,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:35,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:35,463 INFO L87 Difference]: Start difference. First operand 12297 states and 16782 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:07:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:35,869 INFO L93 Difference]: Finished difference Result 25890 states and 35135 transitions. [2024-12-02 14:07:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-12-02 14:07:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:35,890 INFO L225 Difference]: With dead ends: 25890 [2024-12-02 14:07:35,890 INFO L226 Difference]: Without dead ends: 13742 [2024-12-02 14:07:35,900 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 14:07:35,900 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:35,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13742 states. [2024-12-02 14:07:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13742 to 10135. [2024-12-02 14:07:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10135 states, 10134 states have (on average 1.3415235839747386) internal successors, (13595), 10134 states have internal predecessors, (13595), 0 states have call successors, (0), 0 states 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 14:07:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10135 states to 10135 states and 13595 transitions. [2024-12-02 14:07:36,213 INFO L78 Accepts]: Start accepts. Automaton has 10135 states and 13595 transitions. Word has length 68 [2024-12-02 14:07:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 10135 states and 13595 transitions. [2024-12-02 14:07:36,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:07:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10135 states and 13595 transitions. [2024-12-02 14:07:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 14:07:36,215 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:36,215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:36,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:07:36,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash -867529701, now seen corresponding path program 1 times [2024-12-02 14:07:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159995102] [2024-12-02 14:07:36,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:36,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159995102] [2024-12-02 14:07:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159995102] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:07:36,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:07:36,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:07:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514043465] [2024-12-02 14:07:36,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:07:36,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:07:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:36,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:07:36,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:07:36,266 INFO L87 Difference]: Start difference. First operand 10135 states and 13595 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 14:07:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:07:36,630 INFO L93 Difference]: Finished difference Result 24081 states and 32161 transitions. [2024-12-02 14:07:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:07:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-12-02 14:07:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:07:36,659 INFO L225 Difference]: With dead ends: 24081 [2024-12-02 14:07:36,659 INFO L226 Difference]: Without dead ends: 14147 [2024-12-02 14:07:36,666 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 14:07:36,667 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:07:36,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:07:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2024-12-02 14:07:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 14145. [2024-12-02 14:07:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14145 states, 14144 states have (on average 1.3120757918552035) internal successors, (18558), 14144 states have internal predecessors, (18558), 0 states have call successors, (0), 0 states 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 14:07:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 18558 transitions. [2024-12-02 14:07:37,064 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 18558 transitions. Word has length 69 [2024-12-02 14:07:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:07:37,064 INFO L471 AbstractCegarLoop]: Abstraction has 14145 states and 18558 transitions. [2024-12-02 14:07:37,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 14:07:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 18558 transitions. [2024-12-02 14:07:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 14:07:37,065 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:07:37,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:07:37,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:07:37,065 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:07:37,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:07:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash 872422127, now seen corresponding path program 1 times [2024-12-02 14:07:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:07:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855820785] [2024-12-02 14:07:37,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:07:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:38,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:07:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855820785] [2024-12-02 14:07:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855820785] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:07:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11294591] [2024-12-02 14:07:38,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:07:38,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:07:38,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:07:38,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:07:38,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:07:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:07:38,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-02 14:07:38,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:07:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:41,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:07:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:07:44,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11294591] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:07:44,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:07:44,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 54 [2024-12-02 14:07:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906869713] [2024-12-02 14:07:44,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:07:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-12-02 14:07:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:07:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-12-02 14:07:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2559, Unknown=0, NotChecked=0, Total=2862 [2024-12-02 14:07:44,873 INFO L87 Difference]: Start difference. First operand 14145 states and 18558 transitions. Second operand has 54 states, 54 states have (on average 3.5925925925925926) internal successors, (194), 54 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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 14:10:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:19,923 INFO L93 Difference]: Finished difference Result 119673 states and 153499 transitions. [2024-12-02 14:10:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 518 states. [2024-12-02 14:10:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.5925925925925926) internal successors, (194), 54 states have internal predecessors, (194), 0 states have call successors, (0), 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 70 [2024-12-02 14:10:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:20,052 INFO L225 Difference]: With dead ends: 119673 [2024-12-02 14:10:20,052 INFO L226 Difference]: Without dead ends: 105585 [2024-12-02 14:10:20,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153587 ImplicationChecksByTransitivity, 142.8s TimeCoverageRelationStatistics Valid=60728, Invalid=263602, Unknown=0, NotChecked=0, Total=324330 [2024-12-02 14:10:20,108 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 10278 mSDsluCounter, 5928 mSDsCounter, 0 mSdLazyCounter, 7154 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10278 SdHoareTripleChecker+Valid, 6028 SdHoareTripleChecker+Invalid, 7696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 7154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:20,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10278 Valid, 6028 Invalid, 7696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [542 Valid, 7154 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-12-02 14:10:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105585 states. [2024-12-02 14:10:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105585 to 31084. [2024-12-02 14:10:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31084 states, 31083 states have (on average 1.2967216806614548) internal successors, (40306), 31083 states have internal predecessors, (40306), 0 states have call successors, (0), 0 states 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 14:10:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31084 states to 31084 states and 40306 transitions. [2024-12-02 14:10:21,907 INFO L78 Accepts]: Start accepts. Automaton has 31084 states and 40306 transitions. Word has length 70 [2024-12-02 14:10:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:21,907 INFO L471 AbstractCegarLoop]: Abstraction has 31084 states and 40306 transitions. [2024-12-02 14:10:21,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.5925925925925926) internal successors, (194), 54 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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 14:10:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 31084 states and 40306 transitions. [2024-12-02 14:10:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 14:10:21,909 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:21,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:21,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 14:10:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 14:10:22,110 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:22,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -756654483, now seen corresponding path program 1 times [2024-12-02 14:10:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890362292] [2024-12-02 14:10:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890362292] [2024-12-02 14:10:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890362292] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:10:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963295386] [2024-12-02 14:10:22,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:10:22,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:10:22,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:10:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:22,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:10:22,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:10:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:22,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:10:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963295386] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:10:22,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:10:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:10:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108087967] [2024-12-02 14:10:22,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:10:22,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:10:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:10:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:10:22,651 INFO L87 Difference]: Start difference. First operand 31084 states and 40306 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 14:10:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:24,331 INFO L93 Difference]: Finished difference Result 56484 states and 73573 transitions. [2024-12-02 14:10:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:10:24,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 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 70 [2024-12-02 14:10:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:24,364 INFO L225 Difference]: With dead ends: 56484 [2024-12-02 14:10:24,364 INFO L226 Difference]: Without dead ends: 29406 [2024-12-02 14:10:24,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-12-02 14:10:24,383 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 435 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:24,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 285 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:10:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29406 states. [2024-12-02 14:10:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29406 to 26252. [2024-12-02 14:10:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26252 states, 26251 states have (on average 1.2761799550493313) internal successors, (33501), 26251 states have internal predecessors, (33501), 0 states have call successors, (0), 0 states 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 14:10:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26252 states to 26252 states and 33501 transitions. [2024-12-02 14:10:25,664 INFO L78 Accepts]: Start accepts. Automaton has 26252 states and 33501 transitions. Word has length 70 [2024-12-02 14:10:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 26252 states and 33501 transitions. [2024-12-02 14:10:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 14:10:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 26252 states and 33501 transitions. [2024-12-02 14:10:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 14:10:25,666 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:25,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:25,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:10:25,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 14:10:25,867 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:25,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2087162715, now seen corresponding path program 1 times [2024-12-02 14:10:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191113020] [2024-12-02 14:10:25,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191113020] [2024-12-02 14:10:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191113020] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:10:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:10:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:10:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978792800] [2024-12-02 14:10:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:10:25,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:10:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:25,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:10:25,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:10:25,916 INFO L87 Difference]: Start difference. First operand 26252 states and 33501 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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 14:10:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:28,017 INFO L93 Difference]: Finished difference Result 72811 states and 92764 transitions. [2024-12-02 14:10:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:10:28,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-12-02 14:10:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:28,055 INFO L225 Difference]: With dead ends: 72811 [2024-12-02 14:10:28,055 INFO L226 Difference]: Without dead ends: 47007 [2024-12-02 14:10:28,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:10:28,071 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 28 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:28,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:10:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47007 states. [2024-12-02 14:10:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47007 to 38327. [2024-12-02 14:10:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38327 states, 38326 states have (on average 1.2530397119448937) internal successors, (48024), 38326 states have internal predecessors, (48024), 0 states have call successors, (0), 0 states 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 14:10:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38327 states to 38327 states and 48024 transitions. [2024-12-02 14:10:30,166 INFO L78 Accepts]: Start accepts. Automaton has 38327 states and 48024 transitions. Word has length 72 [2024-12-02 14:10:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:30,166 INFO L471 AbstractCegarLoop]: Abstraction has 38327 states and 48024 transitions. [2024-12-02 14:10:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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 14:10:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 38327 states and 48024 transitions. [2024-12-02 14:10:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 14:10:30,182 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:30,182 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:30,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 14:10:30,182 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:30,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1098493017, now seen corresponding path program 1 times [2024-12-02 14:10:30,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108307944] [2024-12-02 14:10:30,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:30,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 14:10:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:30,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108307944] [2024-12-02 14:10:30,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108307944] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:10:30,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:10:30,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:10:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76273808] [2024-12-02 14:10:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:10:30,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:10:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:30,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:10:30,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:10:30,291 INFO L87 Difference]: Start difference. First operand 38327 states and 48024 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 14:10:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:31,767 INFO L93 Difference]: Finished difference Result 45411 states and 56579 transitions. [2024-12-02 14:10:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:10:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 110 [2024-12-02 14:10:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:31,793 INFO L225 Difference]: With dead ends: 45411 [2024-12-02 14:10:31,793 INFO L226 Difference]: Without dead ends: 29476 [2024-12-02 14:10:31,805 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 14:10:31,806 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:31,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:10:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29476 states. [2024-12-02 14:10:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29476 to 29474. [2024-12-02 14:10:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29474 states, 29473 states have (on average 1.2274963525938996) internal successors, (36178), 29473 states have internal predecessors, (36178), 0 states have call successors, (0), 0 states 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 14:10:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29474 states to 29474 states and 36178 transitions. [2024-12-02 14:10:33,141 INFO L78 Accepts]: Start accepts. Automaton has 29474 states and 36178 transitions. Word has length 110 [2024-12-02 14:10:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 29474 states and 36178 transitions. [2024-12-02 14:10:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 14:10:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29474 states and 36178 transitions. [2024-12-02 14:10:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:10:33,149 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:33,149 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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 14:10:33,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 14:10:33,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1551555846, now seen corresponding path program 1 times [2024-12-02 14:10:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362247850] [2024-12-02 14:10:33,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 77 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 14:10:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362247850] [2024-12-02 14:10:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362247850] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:10:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157402241] [2024-12-02 14:10:33,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:33,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:33,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:10:33,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:10:33,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:10:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:33,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:10:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:10:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 14:10:33,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:10:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 14:10:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157402241] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:10:33,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:10:33,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-12-02 14:10:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564342510] [2024-12-02 14:10:33,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:10:33,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 14:10:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:33,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 14:10:33,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:10:33,856 INFO L87 Difference]: Start difference. First operand 29474 states and 36178 transitions. Second operand has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 14:10:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:35,258 INFO L93 Difference]: Finished difference Result 57300 states and 70144 transitions. [2024-12-02 14:10:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:10:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 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 112 [2024-12-02 14:10:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:35,288 INFO L225 Difference]: With dead ends: 57300 [2024-12-02 14:10:35,288 INFO L226 Difference]: Without dead ends: 34347 [2024-12-02 14:10:35,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-12-02 14:10:35,303 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 315 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:35,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 364 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:10:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2024-12-02 14:10:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 30017. [2024-12-02 14:10:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30017 states, 30016 states have (on average 1.2120868869936035) internal successors, (36382), 30016 states have internal predecessors, (36382), 0 states have call successors, (0), 0 states 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 14:10:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30017 states to 30017 states and 36382 transitions. [2024-12-02 14:10:36,756 INFO L78 Accepts]: Start accepts. Automaton has 30017 states and 36382 transitions. Word has length 112 [2024-12-02 14:10:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:36,756 INFO L471 AbstractCegarLoop]: Abstraction has 30017 states and 36382 transitions. [2024-12-02 14:10:36,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 14:10:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 30017 states and 36382 transitions. [2024-12-02 14:10:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:10:36,763 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:36,763 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-12-02 14:10:36,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:10:36,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:36,964 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:36,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1546189703, now seen corresponding path program 1 times [2024-12-02 14:10:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:36,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083872540] [2024-12-02 14:10:36,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 14:10:37,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083872540] [2024-12-02 14:10:37,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083872540] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:10:37,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:10:37,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:10:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963874177] [2024-12-02 14:10:37,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:10:37,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:10:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:37,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:10:37,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:10:37,074 INFO L87 Difference]: Start difference. First operand 30017 states and 36382 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 14:10:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:37,832 INFO L93 Difference]: Finished difference Result 45577 states and 55534 transitions. [2024-12-02 14:10:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:10:37,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 112 [2024-12-02 14:10:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:37,849 INFO L225 Difference]: With dead ends: 45577 [2024-12-02 14:10:37,849 INFO L226 Difference]: Without dead ends: 17300 [2024-12-02 14:10:37,859 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 14:10:37,861 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:37,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:10:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17300 states. [2024-12-02 14:10:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17300 to 15463. [2024-12-02 14:10:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15463 states, 15462 states have (on average 1.2026904669512353) internal successors, (18596), 15462 states have internal predecessors, (18596), 0 states have call successors, (0), 0 states 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 14:10:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15463 states to 15463 states and 18596 transitions. [2024-12-02 14:10:38,532 INFO L78 Accepts]: Start accepts. Automaton has 15463 states and 18596 transitions. Word has length 112 [2024-12-02 14:10:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:38,532 INFO L471 AbstractCegarLoop]: Abstraction has 15463 states and 18596 transitions. [2024-12-02 14:10:38,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 14:10:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 15463 states and 18596 transitions. [2024-12-02 14:10:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:10:38,536 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:38,536 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:38,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 14:10:38,536 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:38,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1433700341, now seen corresponding path program 1 times [2024-12-02 14:10:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:38,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103917796] [2024-12-02 14:10:38,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-02 14:10:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:38,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103917796] [2024-12-02 14:10:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103917796] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:10:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:10:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:10:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929147836] [2024-12-02 14:10:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:10:38,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:10:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:38,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:10:38,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:10:38,608 INFO L87 Difference]: Start difference. First operand 15463 states and 18596 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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 14:10:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:39,228 INFO L93 Difference]: Finished difference Result 20933 states and 25063 transitions. [2024-12-02 14:10:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:10:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 112 [2024-12-02 14:10:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:39,241 INFO L225 Difference]: With dead ends: 20933 [2024-12-02 14:10:39,241 INFO L226 Difference]: Without dead ends: 13432 [2024-12-02 14:10:39,246 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 14:10:39,246 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 24 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:39,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 208 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:10:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2024-12-02 14:10:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 12358. [2024-12-02 14:10:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12358 states, 12357 states have (on average 1.1766610018612933) internal successors, (14540), 12357 states have internal predecessors, (14540), 0 states have call successors, (0), 0 states 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 14:10:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12358 states to 12358 states and 14540 transitions. [2024-12-02 14:10:40,130 INFO L78 Accepts]: Start accepts. Automaton has 12358 states and 14540 transitions. Word has length 112 [2024-12-02 14:10:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:40,130 INFO L471 AbstractCegarLoop]: Abstraction has 12358 states and 14540 transitions. [2024-12-02 14:10:40,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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 14:10:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12358 states and 14540 transitions. [2024-12-02 14:10:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:10:40,136 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:40,136 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:40,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 14:10:40,136 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:40,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 535754931, now seen corresponding path program 1 times [2024-12-02 14:10:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:40,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756243132] [2024-12-02 14:10:40,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:10:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756243132] [2024-12-02 14:10:40,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756243132] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:10:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529338711] [2024-12-02 14:10:40,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:40,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:10:40,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:10:40,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:10:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:40,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 14:10:40,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:10:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:41,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:10:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 34 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529338711] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:10:44,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:10:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2024-12-02 14:10:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058795556] [2024-12-02 14:10:44,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:10:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 14:10:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:44,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 14:10:44,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-12-02 14:10:44,167 INFO L87 Difference]: Start difference. First operand 12358 states and 14540 transitions. Second operand has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 26 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 14:10:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:47,758 INFO L93 Difference]: Finished difference Result 57644 states and 68299 transitions. [2024-12-02 14:10:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-12-02 14:10:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 26 states have internal predecessors, (262), 0 states have call successors, (0), 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 112 [2024-12-02 14:10:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:47,797 INFO L225 Difference]: With dead ends: 57644 [2024-12-02 14:10:47,797 INFO L226 Difference]: Without dead ends: 47168 [2024-12-02 14:10:47,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2024-12-02 14:10:47,810 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1936 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:47,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 921 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 14:10:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47168 states. [2024-12-02 14:10:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47168 to 32119. [2024-12-02 14:10:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32119 states, 32118 states have (on average 1.185970483840837) internal successors, (38091), 32118 states have internal predecessors, (38091), 0 states have call successors, (0), 0 states 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 14:10:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32119 states to 32119 states and 38091 transitions. [2024-12-02 14:10:49,430 INFO L78 Accepts]: Start accepts. Automaton has 32119 states and 38091 transitions. Word has length 112 [2024-12-02 14:10:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:49,430 INFO L471 AbstractCegarLoop]: Abstraction has 32119 states and 38091 transitions. [2024-12-02 14:10:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 26 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 14:10:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32119 states and 38091 transitions. [2024-12-02 14:10:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 14:10:49,434 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:49,434 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:49,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:10:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 14:10:49,635 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -226666205, now seen corresponding path program 1 times [2024-12-02 14:10:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321990110] [2024-12-02 14:10:49,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321990110] [2024-12-02 14:10:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321990110] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:10:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867437756] [2024-12-02 14:10:50,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:50,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:50,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:10:50,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:10:50,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:10:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:50,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 14:10:50,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:10:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 49 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:51,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:10:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:10:54,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867437756] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:10:54,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:10:54,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 38 [2024-12-02 14:10:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476804904] [2024-12-02 14:10:54,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:10:54,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 14:10:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:54,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 14:10:54,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 14:10:54,064 INFO L87 Difference]: Start difference. First operand 32119 states and 38091 transitions. Second operand has 38 states, 38 states have (on average 8.342105263157896) internal successors, (317), 38 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 14:11:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:11:08,000 INFO L93 Difference]: Finished difference Result 67215 states and 79592 transitions. [2024-12-02 14:11:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-12-02 14:11:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.342105263157896) internal successors, (317), 38 states have internal predecessors, (317), 0 states have call successors, (0), 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 113 [2024-12-02 14:11:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:11:08,035 INFO L225 Difference]: With dead ends: 67215 [2024-12-02 14:11:08,035 INFO L226 Difference]: Without dead ends: 44991 [2024-12-02 14:11:08,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5791 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3379, Invalid=16081, Unknown=0, NotChecked=0, Total=19460 [2024-12-02 14:11:08,047 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 3495 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:11:08,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 2126 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 14:11:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44991 states. [2024-12-02 14:11:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44991 to 19640. [2024-12-02 14:11:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19640 states, 19639 states have (on average 1.1713427363918734) internal successors, (23004), 19639 states have internal predecessors, (23004), 0 states have call successors, (0), 0 states 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 14:11:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19640 states to 19640 states and 23004 transitions. [2024-12-02 14:11:09,272 INFO L78 Accepts]: Start accepts. Automaton has 19640 states and 23004 transitions. Word has length 113 [2024-12-02 14:11:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:11:09,273 INFO L471 AbstractCegarLoop]: Abstraction has 19640 states and 23004 transitions. [2024-12-02 14:11:09,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.342105263157896) internal successors, (317), 38 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 14:11:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19640 states and 23004 transitions. [2024-12-02 14:11:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 14:11:09,276 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:11:09,276 INFO L218 NwaCegarLoop]: trace histogram [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, 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 14:11:09,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:11:09,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 14:11:09,477 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:11:09,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:11:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 314862106, now seen corresponding path program 1 times [2024-12-02 14:11:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:11:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497705590] [2024-12-02 14:11:09,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:11:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:11:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497705590] [2024-12-02 14:11:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497705590] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:11:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285057545] [2024-12-02 14:11:10,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:10,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:11:10,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:11:10,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:11:10,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:11:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:10,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 14:11:10,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:11:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:13,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:11:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285057545] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:11:17,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:11:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2024-12-02 14:11:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027468934] [2024-12-02 14:11:17,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:11:17,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-12-02 14:11:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:11:17,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-12-02 14:11:17,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2305, Unknown=0, NotChecked=0, Total=2550 [2024-12-02 14:11:17,294 INFO L87 Difference]: Start difference. First operand 19640 states and 23004 transitions. Second operand has 51 states, 51 states have (on average 6.117647058823529) internal successors, (312), 51 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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 14:11:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:11:29,060 INFO L93 Difference]: Finished difference Result 31412 states and 36700 transitions. [2024-12-02 14:11:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-12-02 14:11:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.117647058823529) internal successors, (312), 51 states have internal predecessors, (312), 0 states have call successors, (0), 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 114 [2024-12-02 14:11:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:11:29,083 INFO L225 Difference]: With dead ends: 31412 [2024-12-02 14:11:29,083 INFO L226 Difference]: Without dead ends: 26676 [2024-12-02 14:11:29,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4510 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2891, Invalid=12859, Unknown=0, NotChecked=0, Total=15750 [2024-12-02 14:11:29,089 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 3050 mSDsluCounter, 3923 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:11:29,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 4133 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 14:11:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26676 states. [2024-12-02 14:11:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26676 to 23055. [2024-12-02 14:11:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23055 states, 23054 states have (on average 1.1682137590006072) internal successors, (26932), 23054 states have internal predecessors, (26932), 0 states have call successors, (0), 0 states 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 14:11:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23055 states to 23055 states and 26932 transitions. [2024-12-02 14:11:30,777 INFO L78 Accepts]: Start accepts. Automaton has 23055 states and 26932 transitions. Word has length 114 [2024-12-02 14:11:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:11:30,777 INFO L471 AbstractCegarLoop]: Abstraction has 23055 states and 26932 transitions. [2024-12-02 14:11:30,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.117647058823529) internal successors, (312), 51 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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 14:11:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23055 states and 26932 transitions. [2024-12-02 14:11:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 14:11:30,782 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:11:30,782 INFO L218 NwaCegarLoop]: trace histogram [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, 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 14:11:30,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:11:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 14:11:30,983 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:11:30,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:11:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1817882397, now seen corresponding path program 1 times [2024-12-02 14:11:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:11:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493952890] [2024-12-02 14:11:30,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:11:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 47 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:11:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493952890] [2024-12-02 14:11:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493952890] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:11:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857782335] [2024-12-02 14:11:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:11:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:11:31,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:11:31,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:11:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:32,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 14:11:32,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:11:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 50 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:33,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:11:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:36,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857782335] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:11:36,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:11:36,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2024-12-02 14:11:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58742806] [2024-12-02 14:11:36,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:11:36,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 14:11:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:11:36,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 14:11:36,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 14:11:36,268 INFO L87 Difference]: Start difference. First operand 23055 states and 26932 transitions. Second operand has 42 states, 42 states have (on average 7.5) internal successors, (315), 42 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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 14:11:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:11:46,843 INFO L93 Difference]: Finished difference Result 66611 states and 77870 transitions. [2024-12-02 14:11:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-12-02 14:11:46,844 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.5) internal successors, (315), 42 states have internal predecessors, (315), 0 states have call successors, (0), 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 114 [2024-12-02 14:11:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:11:46,905 INFO L225 Difference]: With dead ends: 66611 [2024-12-02 14:11:46,905 INFO L226 Difference]: Without dead ends: 54162 [2024-12-02 14:11:46,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2288, Invalid=8424, Unknown=0, NotChecked=0, Total=10712 [2024-12-02 14:11:46,920 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 3106 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:11:46,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3106 Valid, 2947 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 14:11:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54162 states. [2024-12-02 14:11:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54162 to 27057. [2024-12-02 14:11:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27057 states, 27056 states have (on average 1.1652128917800118) internal successors, (31526), 27056 states have internal predecessors, (31526), 0 states have call successors, (0), 0 states 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 14:11:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27057 states to 27057 states and 31526 transitions. [2024-12-02 14:11:49,551 INFO L78 Accepts]: Start accepts. Automaton has 27057 states and 31526 transitions. Word has length 114 [2024-12-02 14:11:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:11:49,551 INFO L471 AbstractCegarLoop]: Abstraction has 27057 states and 31526 transitions. [2024-12-02 14:11:49,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.5) internal successors, (315), 42 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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 14:11:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27057 states and 31526 transitions. [2024-12-02 14:11:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-02 14:11:49,556 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:11:49,556 INFO L218 NwaCegarLoop]: trace histogram [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, 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 14:11:49,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:11:49,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 14:11:49,757 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:11:49,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:11:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1555553588, now seen corresponding path program 1 times [2024-12-02 14:11:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:11:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021590139] [2024-12-02 14:11:49,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:11:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:11:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021590139] [2024-12-02 14:11:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021590139] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:11:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208748896] [2024-12-02 14:11:50,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:50,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:11:50,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:11:50,637 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:11:50,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:11:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:50,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 14:11:50,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:11:51,812 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 14:11:51,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:11:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:11:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208748896] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:11:53,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:11:53,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 36 [2024-12-02 14:11:53,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043174923] [2024-12-02 14:11:53,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:11:53,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 14:11:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:11:53,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 14:11:53,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 14:11:53,409 INFO L87 Difference]: Start difference. First operand 27057 states and 31526 transitions. Second operand has 36 states, 36 states have (on average 8.805555555555555) internal successors, (317), 36 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 14:12:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:12:06,901 INFO L93 Difference]: Finished difference Result 69346 states and 80795 transitions. [2024-12-02 14:12:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-12-02 14:12:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.805555555555555) internal successors, (317), 36 states have internal predecessors, (317), 0 states have call successors, (0), 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 115 [2024-12-02 14:12:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:12:06,972 INFO L225 Difference]: With dead ends: 69346 [2024-12-02 14:12:06,972 INFO L226 Difference]: Without dead ends: 48679 [2024-12-02 14:12:06,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3923 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2753, Invalid=12009, Unknown=0, NotChecked=0, Total=14762 [2024-12-02 14:12:06,993 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1599 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:12:06,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 2610 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 14:12:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48679 states. [2024-12-02 14:12:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48679 to 29270. [2024-12-02 14:12:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29270 states, 29269 states have (on average 1.1592811507055245) internal successors, (33931), 29269 states have internal predecessors, (33931), 0 states have call successors, (0), 0 states 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 14:12:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29270 states to 29270 states and 33931 transitions. [2024-12-02 14:12:09,820 INFO L78 Accepts]: Start accepts. Automaton has 29270 states and 33931 transitions. Word has length 115 [2024-12-02 14:12:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:12:09,820 INFO L471 AbstractCegarLoop]: Abstraction has 29270 states and 33931 transitions. [2024-12-02 14:12:09,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.805555555555555) internal successors, (317), 36 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 14:12:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 29270 states and 33931 transitions. [2024-12-02 14:12:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-02 14:12:09,827 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:12:09,827 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:12:09,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:12:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 14:12:10,027 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:12:10,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:12:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash 449994666, now seen corresponding path program 1 times [2024-12-02 14:12:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:12:10,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734958905] [2024-12-02 14:12:10,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:12:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 14:12:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:12:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734958905] [2024-12-02 14:12:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734958905] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:12:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:12:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:12:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125200491] [2024-12-02 14:12:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:12:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:12:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:12:10,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:12:10,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:12:10,079 INFO L87 Difference]: Start difference. First operand 29270 states and 33931 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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 14:12:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:12:11,686 INFO L93 Difference]: Finished difference Result 34892 states and 40335 transitions. [2024-12-02 14:12:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:12:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 115 [2024-12-02 14:12:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:12:11,706 INFO L225 Difference]: With dead ends: 34892 [2024-12-02 14:12:11,706 INFO L226 Difference]: Without dead ends: 20570 [2024-12-02 14:12:11,714 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 14:12:11,714 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:12:11,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 190 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:12:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2024-12-02 14:12:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 19109. [2024-12-02 14:12:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19109 states, 19108 states have (on average 1.1308352522503664) internal successors, (21608), 19108 states have internal predecessors, (21608), 0 states have call successors, (0), 0 states 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 14:12:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19109 states to 19109 states and 21608 transitions. [2024-12-02 14:12:13,729 INFO L78 Accepts]: Start accepts. Automaton has 19109 states and 21608 transitions. Word has length 115 [2024-12-02 14:12:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:12:13,729 INFO L471 AbstractCegarLoop]: Abstraction has 19109 states and 21608 transitions. [2024-12-02 14:12:13,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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 14:12:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 19109 states and 21608 transitions. [2024-12-02 14:12:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-02 14:12:13,735 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:12:13,735 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-12-02 14:12:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 14:12:13,735 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:12:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:12:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1594503668, now seen corresponding path program 1 times [2024-12-02 14:12:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:12:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636995874] [2024-12-02 14:12:13,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:12:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-02 14:12:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:12:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636995874] [2024-12-02 14:12:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636995874] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:12:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188242365] [2024-12-02 14:12:14,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:12:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:12:14,586 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:12:14,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:12:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:14,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 14:12:14,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:12:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:12:16,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:12:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:12:19,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188242365] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:12:19,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:12:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2024-12-02 14:12:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394713976] [2024-12-02 14:12:19,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:12:19,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 14:12:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:12:19,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 14:12:19,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 14:12:19,905 INFO L87 Difference]: Start difference. First operand 19109 states and 21608 transitions. Second operand has 38 states, 38 states have (on average 7.2368421052631575) internal successors, (275), 38 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 14:12:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:12:25,659 INFO L93 Difference]: Finished difference Result 26982 states and 30557 transitions. [2024-12-02 14:12:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 14:12:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.2368421052631575) internal successors, (275), 38 states have internal predecessors, (275), 0 states have call successors, (0), 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 115 [2024-12-02 14:12:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:12:25,682 INFO L225 Difference]: With dead ends: 26982 [2024-12-02 14:12:25,682 INFO L226 Difference]: Without dead ends: 22600 [2024-12-02 14:12:25,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1090, Invalid=3466, Unknown=0, NotChecked=0, Total=4556 [2024-12-02 14:12:25,689 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2636 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:12:25,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2636 Valid, 1165 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 14:12:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22600 states. [2024-12-02 14:12:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22600 to 19046. [2024-12-02 14:12:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19046 states, 19045 states have (on average 1.1302179049619323) internal successors, (21525), 19045 states have internal predecessors, (21525), 0 states have call successors, (0), 0 states 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 14:12:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19046 states to 19046 states and 21525 transitions. [2024-12-02 14:12:27,370 INFO L78 Accepts]: Start accepts. Automaton has 19046 states and 21525 transitions. Word has length 115 [2024-12-02 14:12:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:12:27,370 INFO L471 AbstractCegarLoop]: Abstraction has 19046 states and 21525 transitions. [2024-12-02 14:12:27,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.2368421052631575) internal successors, (275), 38 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 14:12:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 19046 states and 21525 transitions. [2024-12-02 14:12:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 14:12:27,373 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:12:27,373 INFO L218 NwaCegarLoop]: trace histogram [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, 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 14:12:27,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:12:27,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:12:27,574 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:12:27,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:12:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2092934777, now seen corresponding path program 1 times [2024-12-02 14:12:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:12:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24809913] [2024-12-02 14:12:27,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:12:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:12:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:12:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24809913] [2024-12-02 14:12:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24809913] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:12:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50186500] [2024-12-02 14:12:28,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:28,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:12:28,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:12:28,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:12:28,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:12:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:28,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 14:12:28,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:12:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:12:30,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:12:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:12:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50186500] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:12:34,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:12:34,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 49 [2024-12-02 14:12:34,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925520777] [2024-12-02 14:12:34,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:12:34,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-12-02 14:12:34,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:12:34,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-12-02 14:12:34,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2024-12-02 14:12:34,870 INFO L87 Difference]: Start difference. First operand 19046 states and 21525 transitions. Second operand has 49 states, 49 states have (on average 6.020408163265306) internal successors, (295), 49 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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 14:12:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:12:48,196 INFO L93 Difference]: Finished difference Result 32300 states and 36544 transitions. [2024-12-02 14:12:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-12-02 14:12:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.020408163265306) internal successors, (295), 49 states have internal predecessors, (295), 0 states have call successors, (0), 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 116 [2024-12-02 14:12:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:12:48,219 INFO L225 Difference]: With dead ends: 32300 [2024-12-02 14:12:48,219 INFO L226 Difference]: Without dead ends: 27859 [2024-12-02 14:12:48,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4407 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3055, Invalid=12445, Unknown=0, NotChecked=0, Total=15500 [2024-12-02 14:12:48,225 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 2818 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2818 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:12:48,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2818 Valid, 3107 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 14:12:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27859 states. [2024-12-02 14:12:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27859 to 23527. [2024-12-02 14:12:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23527 states, 23526 states have (on average 1.1309614894159654) internal successors, (26607), 23526 states have internal predecessors, (26607), 0 states have call successors, (0), 0 states 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 14:12:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23527 states to 23527 states and 26607 transitions. [2024-12-02 14:12:50,421 INFO L78 Accepts]: Start accepts. Automaton has 23527 states and 26607 transitions. Word has length 116 [2024-12-02 14:12:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:12:50,422 INFO L471 AbstractCegarLoop]: Abstraction has 23527 states and 26607 transitions. [2024-12-02 14:12:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.020408163265306) internal successors, (295), 49 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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 14:12:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23527 states and 26607 transitions. [2024-12-02 14:12:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 14:12:50,424 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:12:50,424 INFO L218 NwaCegarLoop]: trace histogram [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, 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 14:12:50,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 14:12:50,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-12-02 14:12:50,625 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:12:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:12:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2119610480, now seen corresponding path program 1 times [2024-12-02 14:12:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:12:50,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775794701] [2024-12-02 14:12:50,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:12:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 65 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 14:12:51,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:12:51,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775794701] [2024-12-02 14:12:51,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775794701] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:12:51,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519516241] [2024-12-02 14:12:51,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:12:51,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:12:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:12:51,349 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:12:51,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 14:12:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:12:51,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-02 14:12:51,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:12:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 24 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:12:53,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:12:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:12:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519516241] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:12:55,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:12:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 15] total 41 [2024-12-02 14:12:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148213645] [2024-12-02 14:12:55,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:12:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-12-02 14:12:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:12:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-12-02 14:12:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 14:12:55,768 INFO L87 Difference]: Start difference. First operand 23527 states and 26607 transitions. Second operand has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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 14:13:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:13:15,436 INFO L93 Difference]: Finished difference Result 62017 states and 70197 transitions. [2024-12-02 14:13:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-12-02 14:13:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 0 states have call successors, (0), 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 117 [2024-12-02 14:13:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:13:15,479 INFO L225 Difference]: With dead ends: 62017 [2024-12-02 14:13:15,479 INFO L226 Difference]: Without dead ends: 51452 [2024-12-02 14:13:15,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8238 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=4568, Invalid=20872, Unknown=0, NotChecked=0, Total=25440 [2024-12-02 14:13:15,488 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 4370 mSDsluCounter, 4087 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4370 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:13:15,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4370 Valid, 4233 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 14:13:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51452 states. [2024-12-02 14:13:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51452 to 27505. [2024-12-02 14:13:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27505 states, 27504 states have (on average 1.1317990110529377) internal successors, (31129), 27504 states have internal predecessors, (31129), 0 states have call successors, (0), 0 states 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 14:13:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27505 states to 27505 states and 31129 transitions. [2024-12-02 14:13:18,415 INFO L78 Accepts]: Start accepts. Automaton has 27505 states and 31129 transitions. Word has length 117 [2024-12-02 14:13:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:13:18,416 INFO L471 AbstractCegarLoop]: Abstraction has 27505 states and 31129 transitions. [2024-12-02 14:13:18,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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 14:13:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27505 states and 31129 transitions. [2024-12-02 14:13:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 14:13:18,418 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:13:18,418 INFO L218 NwaCegarLoop]: trace histogram [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, 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 14:13:18,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 14:13:18,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:13:18,619 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:13:18,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:13:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1574055556, now seen corresponding path program 1 times [2024-12-02 14:13:18,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:13:18,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107608775] [2024-12-02 14:13:18,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:13:18,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:13:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:13:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:13:19,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:13:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107608775] [2024-12-02 14:13:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107608775] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:13:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292649333] [2024-12-02 14:13:19,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:13:19,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:13:19,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:13:19,804 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:13:19,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 14:13:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:13:19,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 14:13:19,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:13:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:13:22,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:13:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:13:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292649333] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:13:30,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:13:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 22] total 62 [2024-12-02 14:13:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812360406] [2024-12-02 14:13:30,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:13:30,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-02 14:13:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:13:30,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-02 14:13:30,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=3473, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 14:13:30,577 INFO L87 Difference]: Start difference. First operand 27505 states and 31129 transitions. Second operand has 62 states, 62 states have (on average 5.403225806451613) internal successors, (335), 62 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 14:16:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:16:18,817 INFO L93 Difference]: Finished difference Result 76143 states and 86277 transitions. [2024-12-02 14:16:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 549 states. [2024-12-02 14:16:18,818 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 5.403225806451613) internal successors, (335), 62 states have internal predecessors, (335), 0 states have call successors, (0), 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 117 [2024-12-02 14:16:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:16:18,865 INFO L225 Difference]: With dead ends: 76143 [2024-12-02 14:16:18,866 INFO L226 Difference]: Without dead ends: 62775 [2024-12-02 14:16:18,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 603 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162285 ImplicationChecksByTransitivity, 153.7s TimeCoverageRelationStatistics Valid=49926, Invalid=315494, Unknown=0, NotChecked=0, Total=365420 [2024-12-02 14:16:18,884 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 8937 mSDsluCounter, 10420 mSDsCounter, 0 mSdLazyCounter, 9715 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8937 SdHoareTripleChecker+Valid, 10820 SdHoareTripleChecker+Invalid, 10194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 9715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:16:18,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8937 Valid, 10820 Invalid, 10194 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [479 Valid, 9715 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2024-12-02 14:16:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62775 states. [2024-12-02 14:16:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62775 to 40252. [2024-12-02 14:16:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40252 states, 40251 states have (on average 1.1335618990832526) internal successors, (45627), 40251 states have internal predecessors, (45627), 0 states have call successors, (0), 0 states 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 14:16:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40252 states to 40252 states and 45627 transitions. [2024-12-02 14:16:23,067 INFO L78 Accepts]: Start accepts. Automaton has 40252 states and 45627 transitions. Word has length 117 [2024-12-02 14:16:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:16:23,068 INFO L471 AbstractCegarLoop]: Abstraction has 40252 states and 45627 transitions. [2024-12-02 14:16:23,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 5.403225806451613) internal successors, (335), 62 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 14:16:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 40252 states and 45627 transitions. [2024-12-02 14:16:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 14:16:23,072 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:16:23,072 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 14:16:23,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-12-02 14:16:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:16:23,273 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:16:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:16:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1472242076, now seen corresponding path program 1 times [2024-12-02 14:16:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:16:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550743722] [2024-12-02 14:16:23,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:16:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:16:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:16:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-12-02 14:16:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:16:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550743722] [2024-12-02 14:16:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550743722] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:16:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477334503] [2024-12-02 14:16:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:16:23,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:16:23,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:16:23,377 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:16:23,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 14:16:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:16:23,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:16:23,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:16:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-12-02 14:16:23,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:16:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-12-02 14:16:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477334503] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:16:23,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:16:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-12-02 14:16:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499715630] [2024-12-02 14:16:23,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:16:23,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 14:16:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:16:23,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 14:16:23,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-12-02 14:16:23,740 INFO L87 Difference]: Start difference. First operand 40252 states and 45627 transitions. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 14:16:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:16:27,977 INFO L93 Difference]: Finished difference Result 40256 states and 45629 transitions. [2024-12-02 14:16:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 14:16:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 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 150 [2024-12-02 14:16:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:16:28,016 INFO L225 Difference]: With dead ends: 40256 [2024-12-02 14:16:28,017 INFO L226 Difference]: Without dead ends: 39473 [2024-12-02 14:16:28,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:16:28,024 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 395 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:16:28,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 433 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:16:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2024-12-02 14:16:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39471. [2024-12-02 14:16:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39471 states, 39470 states have (on average 1.1337978211299722) internal successors, (44751), 39470 states have internal predecessors, (44751), 0 states have call successors, (0), 0 states 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 14:16:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39471 states to 39471 states and 44751 transitions. [2024-12-02 14:16:32,439 INFO L78 Accepts]: Start accepts. Automaton has 39471 states and 44751 transitions. Word has length 150 [2024-12-02 14:16:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:16:32,440 INFO L471 AbstractCegarLoop]: Abstraction has 39471 states and 44751 transitions. [2024-12-02 14:16:32,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 14:16:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 39471 states and 44751 transitions. [2024-12-02 14:16:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 14:16:32,443 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:16:32,443 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:16:32,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 14:16:32,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:16:32,644 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:16:32,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:16:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash -259314656, now seen corresponding path program 1 times [2024-12-02 14:16:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:16:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547894609] [2024-12-02 14:16:32,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:16:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:16:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:16:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 148 proven. 59 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-02 14:16:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:16:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547894609] [2024-12-02 14:16:33,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547894609] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:16:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639758902] [2024-12-02 14:16:33,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:16:33,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:16:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:16:33,247 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:16:33,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 14:16:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:16:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 14:16:33,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:16:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-02 14:16:34,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:16:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-02 14:16:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639758902] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:16:35,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:16:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2024-12-02 14:16:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739439288] [2024-12-02 14:16:35,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:16:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 14:16:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:16:35,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 14:16:35,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-12-02 14:16:35,733 INFO L87 Difference]: Start difference. First operand 39471 states and 44751 transitions. Second operand has 29 states, 29 states have (on average 9.413793103448276) internal successors, (273), 29 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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 14:16:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:16:43,909 INFO L93 Difference]: Finished difference Result 56015 states and 63718 transitions. [2024-12-02 14:16:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-12-02 14:16:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.413793103448276) internal successors, (273), 29 states have internal predecessors, (273), 0 states have call successors, (0), 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 150 [2024-12-02 14:16:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:16:43,948 INFO L225 Difference]: With dead ends: 56015 [2024-12-02 14:16:43,948 INFO L226 Difference]: Without dead ends: 50983 [2024-12-02 14:16:43,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1197, Invalid=5283, Unknown=0, NotChecked=0, Total=6480 [2024-12-02 14:16:43,956 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1415 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:16:43,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1591 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 14:16:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50983 states. [2024-12-02 14:16:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50983 to 38329. [2024-12-02 14:16:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38329 states, 38328 states have (on average 1.1321488207054895) internal successors, (43393), 38328 states have internal predecessors, (43393), 0 states have call successors, (0), 0 states 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 14:16:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38329 states to 38329 states and 43393 transitions. [2024-12-02 14:16:48,606 INFO L78 Accepts]: Start accepts. Automaton has 38329 states and 43393 transitions. Word has length 150 [2024-12-02 14:16:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:16:48,606 INFO L471 AbstractCegarLoop]: Abstraction has 38329 states and 43393 transitions. [2024-12-02 14:16:48,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.413793103448276) internal successors, (273), 29 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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 14:16:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38329 states and 43393 transitions. [2024-12-02 14:16:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 14:16:48,610 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:16:48,610 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:16:48,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 14:16:48,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-12-02 14:16:48,810 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:16:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:16:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1468757340, now seen corresponding path program 1 times [2024-12-02 14:16:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:16:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814545692] [2024-12-02 14:16:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:16:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:16:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:16:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 14:16:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:16:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814545692] [2024-12-02 14:16:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814545692] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:16:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58135983] [2024-12-02 14:16:49,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:16:49,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:16:49,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:16:49,615 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:16:49,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 14:16:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:16:49,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 14:16:49,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:16:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-02 14:16:51,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:16:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 14:16:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58135983] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:16:53,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:16:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 21] total 49 [2024-12-02 14:16:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052184351] [2024-12-02 14:16:53,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:16:53,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-12-02 14:16:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:16:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-12-02 14:16:53,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2024-12-02 14:16:53,297 INFO L87 Difference]: Start difference. First operand 38329 states and 43393 transitions. Second operand has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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 14:17:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:17:00,131 INFO L93 Difference]: Finished difference Result 45407 states and 51300 transitions. [2024-12-02 14:17:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-12-02 14:17:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 0 states have call successors, (0), 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 150 [2024-12-02 14:17:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:17:00,164 INFO L225 Difference]: With dead ends: 45407 [2024-12-02 14:17:00,164 INFO L226 Difference]: Without dead ends: 41433 [2024-12-02 14:17:00,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1488, Invalid=4992, Unknown=0, NotChecked=0, Total=6480 [2024-12-02 14:17:00,172 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1969 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:17:00,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 2392 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 14:17:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41433 states. [2024-12-02 14:17:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41433 to 39724. [2024-12-02 14:17:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39724 states, 39723 states have (on average 1.12992472874657) internal successors, (44884), 39723 states have internal predecessors, (44884), 0 states have call successors, (0), 0 states 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 14:17:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39724 states to 39724 states and 44884 transitions. [2024-12-02 14:17:04,589 INFO L78 Accepts]: Start accepts. Automaton has 39724 states and 44884 transitions. Word has length 150 [2024-12-02 14:17:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:17:04,589 INFO L471 AbstractCegarLoop]: Abstraction has 39724 states and 44884 transitions. [2024-12-02 14:17:04,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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 14:17:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 39724 states and 44884 transitions. [2024-12-02 14:17:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 14:17:04,593 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:17:04,593 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:17:04,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 14:17:04,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:17:04,794 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:17:04,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:17:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2033963842, now seen corresponding path program 1 times [2024-12-02 14:17:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:17:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887448473] [2024-12-02 14:17:04,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:17:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:17:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:17:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-12-02 14:17:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:17:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887448473] [2024-12-02 14:17:04,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887448473] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:17:04,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:17:04,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:17:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797038641] [2024-12-02 14:17:04,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:17:04,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:17:04,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:17:04,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:17:04,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:17:04,877 INFO L87 Difference]: Start difference. First operand 39724 states and 44884 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 14:17:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:17:08,880 INFO L93 Difference]: Finished difference Result 39730 states and 44887 transitions. [2024-12-02 14:17:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:17:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 150 [2024-12-02 14:17:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:17:08,908 INFO L225 Difference]: With dead ends: 39730 [2024-12-02 14:17:08,908 INFO L226 Difference]: Without dead ends: 38916 [2024-12-02 14:17:08,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:17:08,914 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 176 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:17:08,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 223 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:17:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38916 states. [2024-12-02 14:17:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38916 to 38912. [2024-12-02 14:17:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38912 states, 38911 states have (on average 1.1307856390223845) internal successors, (44000), 38911 states have internal predecessors, (44000), 0 states have call successors, (0), 0 states 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 14:17:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38912 states to 38912 states and 44000 transitions. [2024-12-02 14:17:13,202 INFO L78 Accepts]: Start accepts. Automaton has 38912 states and 44000 transitions. Word has length 150 [2024-12-02 14:17:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:17:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 38912 states and 44000 transitions. [2024-12-02 14:17:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 14:17:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38912 states and 44000 transitions. [2024-12-02 14:17:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 14:17:13,206 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:17:13,206 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:17:13,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 14:17:13,206 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:17:13,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:17:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1602722759, now seen corresponding path program 1 times [2024-12-02 14:17:13,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:17:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536620152] [2024-12-02 14:17:13,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:17:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:17:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:17:13,232 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:17:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:17:13,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:17:13,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:17:13,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 14:17:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 14:17:13,303 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] [2024-12-02 14:17:13,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:17:13,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:17:13 BoogieIcfgContainer [2024-12-02 14:17:13,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:17:13,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:17:13,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:17:13,417 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:17:13,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:07:18" (3/4) ... [2024-12-02 14:17:13,418 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:17:13,536 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 147. [2024-12-02 14:17:13,636 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:17:13,636 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:17:13,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:17:13,637 INFO L158 Benchmark]: Toolchain (without parser) took 596050.31ms. Allocated memory was 117.4MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 92.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 581.1MB. Max. memory is 16.1GB. [2024-12-02 14:17:13,637 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:17:13,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.68ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 78.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:17:13,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.12ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 75.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:17:13,638 INFO L158 Benchmark]: Boogie Preprocessor took 39.27ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:17:13,638 INFO L158 Benchmark]: RCFGBuilder took 421.19ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 52.2MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:17:13,638 INFO L158 Benchmark]: TraceAbstraction took 595094.38ms. Allocated memory was 117.4MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 51.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 505.6MB. Max. memory is 16.1GB. [2024-12-02 14:17:13,639 INFO L158 Benchmark]: Witness Printer took 219.23ms. Allocated memory is still 4.1GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 14:17:13,639 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.33ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.68ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 78.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.12ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 75.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.27ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 421.19ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 52.2MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 595094.38ms. Allocated memory was 117.4MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 51.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 505.6MB. Max. memory is 16.1GB. * Witness Printer took 219.23ms. Allocated memory is still 4.1GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 306]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, 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] [L250] int c1 ; [L251] int i2 ; [L254] c1 = 0 [L255] r1 = __VERIFIER_nondet_char() [L256] id1 = __VERIFIER_nondet_char() [L257] st1 = __VERIFIER_nondet_char() [L258] send1 = __VERIFIER_nondet_char() [L259] mode1 = __VERIFIER_nondet_bool() [L260] alive1 = __VERIFIER_nondet_bool() [L261] id2 = __VERIFIER_nondet_char() [L262] st2 = __VERIFIER_nondet_char() [L263] send2 = __VERIFIER_nondet_char() [L264] mode2 = __VERIFIER_nondet_bool() [L265] alive2 = __VERIFIER_nondet_bool() [L266] id3 = __VERIFIER_nondet_char() [L267] st3 = __VERIFIER_nondet_char() [L268] send3 = __VERIFIER_nondet_char() [L269] mode3 = __VERIFIER_nondet_bool() [L270] alive3 = __VERIFIER_nondet_bool() [L271] CALL, EXPR init() [L153] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L156] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L157] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L158] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L159] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L160] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L161] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L162] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L163] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L164] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L165] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L166] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L167] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L168] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L169] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L170] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L171] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id2 != (int )id3 [L173] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L225] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L271] RET, EXPR init() [L271] i2 = init() [L272] COND FALSE !(!(i2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L273] p1_old = nomsg [L274] p1_new = nomsg [L275] p2_old = nomsg [L276] p2_new = nomsg [L277] p3_old = nomsg [L278] p3_new = nomsg [L279] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, i2=0, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=0, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=2, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=2, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=2, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=3, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=3, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=4, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=4, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=5, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=5, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L237] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L240] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=0] [L245] return (tmp); VAL [\result=0, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L306] reach_error() VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, 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=0, send2=2, send3=0, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 594.9s, OverallIterations: 38, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 460.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55263 SdHoareTripleChecker+Valid, 38.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55263 mSDsluCounter, 50267 SdHoareTripleChecker+Invalid, 33.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45886 mSDsCounter, 2326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39117 IncrementalHoareTripleChecker+Invalid, 41443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2326 mSolverCounterUnsat, 4381 mSDtfsCounter, 39117 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5922 GetRequests, 3409 SyntacticMatches, 11 SemanticMatches, 2502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359062 ImplicationChecksByTransitivity, 374.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40252occurred in iteration=33, InterpolantAutomatonStates: 2020, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 274276 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 75.2s InterpolantComputationTime, 5305 NumberOfCodeBlocks, 5305 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6951 ConstructedInterpolants, 48 QuantifiedInterpolants, 107396 SizeOfPredicates, 89 NumberOfNonLiveVariables, 7052 ConjunctsInSsa, 396 ConjunctsInUnsatCore, 71 InterpolantComputations, 20 PerfectInterpolantSequences, 3777/5938 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 14:17:13,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c77dca-eab7-47df-919a-deaf8fe66045/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