./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.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_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/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_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/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_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:33:54,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:33:54,424 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 13:33:54,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:33:54,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:33:54,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:33:54,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:33:54,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:33:54,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:33:54,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:33:54,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:33:54,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:33:54,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:33:54,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:33:54,457 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:33:54,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:33:54,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:33:54,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:33:54,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:33:54,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:33:54,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:33:54,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:33:54,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:33:54,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:33:54,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:33:54,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:33:54,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:33:54,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:33:54,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:33:54,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:33:54,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:33:54,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:33:54,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:33:54,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:33:54,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:33:54,461 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_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2024-12-02 13:33:54,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:33:54,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:33:54,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:33:54,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:33:54,708 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:33:54,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-12-02 13:33:57,389 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/data/96218463b/427feaaf41554547b49646fbfd7bae33/FLAGd0bf465e5 [2024-12-02 13:33:57,596 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:33:57,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-12-02 13:33:57,605 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/data/96218463b/427feaaf41554547b49646fbfd7bae33/FLAGd0bf465e5 [2024-12-02 13:33:57,939 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/data/96218463b/427feaaf41554547b49646fbfd7bae33 [2024-12-02 13:33:57,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:33:57,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:33:57,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:33:57,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:33:57,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:33:57,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:33:57" (1/1) ... [2024-12-02 13:33:57,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6351242b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:57, skipping insertion in model container [2024-12-02 13:33:57,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:33:57" (1/1) ... [2024-12-02 13:33:57,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:33:58,147 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_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-12-02 13:33:58,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:33:58,160 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:33:58,196 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_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-12-02 13:33:58,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:33:58,212 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:33:58,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58 WrapperNode [2024-12-02 13:33:58,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:33:58,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:33:58,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:33:58,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:33:58,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,249 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2024-12-02 13:33:58,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:33:58,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:33:58,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:33:58,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:33:58,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,273 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 13:33:58,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:33:58,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:33:58,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:33:58,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:33:58,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (1/1) ... [2024-12-02 13:33:58,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:33:58,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:33:58,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:33:58,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:33:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:33:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 13:33:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:33:58,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:33:58,445 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:33:58,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:33:58,777 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-12-02 13:33:58,777 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:33:58,788 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:33:58,788 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 13:33:58,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:33:58 BoogieIcfgContainer [2024-12-02 13:33:58,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:33:58,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:33:58,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:33:58,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:33:58,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:33:57" (1/3) ... [2024-12-02 13:33:58,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f097da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:33:58, skipping insertion in model container [2024-12-02 13:33:58,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:33:58" (2/3) ... [2024-12-02 13:33:58,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f097da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:33:58, skipping insertion in model container [2024-12-02 13:33:58,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:33:58" (3/3) ... [2024-12-02 13:33:58,798 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-12-02 13:33:58,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:33:58,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 13:33:58,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:33:58,879 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;@9161e6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:33:58,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 13:33:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 57 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 13:33:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 13:33:58,888 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:33:58,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:33:58,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:33:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:33:58,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1507300432, now seen corresponding path program 1 times [2024-12-02 13:33:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:33:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165627952] [2024-12-02 13:33:58,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:33:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:33:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:33:59,066 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 13:33:59,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:33:59,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165627952] [2024-12-02 13:33:59,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165627952] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:33:59,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:33:59,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:33:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567014771] [2024-12-02 13:33:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:33:59,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 13:33:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:33:59,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 13:33:59,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 13:33:59,095 INFO L87 Difference]: Start difference. First operand has 58 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 57 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 13:33:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:33:59,112 INFO L93 Difference]: Finished difference Result 91 states and 149 transitions. [2024-12-02 13:33:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 13:33:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-12-02 13:33:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:33:59,121 INFO L225 Difference]: With dead ends: 91 [2024-12-02 13:33:59,121 INFO L226 Difference]: Without dead ends: 54 [2024-12-02 13:33:59,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 13:33:59,127 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:33:59,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:33:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-12-02 13:33:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-12-02 13:33:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 53 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 13:33:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2024-12-02 13:33:59,154 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 19 [2024-12-02 13:33:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:33:59,154 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 88 transitions. [2024-12-02 13:33:59,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 13:33:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2024-12-02 13:33:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 13:33:59,156 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:33:59,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:33:59,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 13:33:59,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:33:59,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:33:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash 496183182, now seen corresponding path program 1 times [2024-12-02 13:33:59,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:33:59,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519687930] [2024-12-02 13:33:59,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:33:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:33:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:33:59,366 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 13:33:59,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:33:59,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519687930] [2024-12-02 13:33:59,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519687930] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:33:59,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:33:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:33:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758877012] [2024-12-02 13:33:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:33:59,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:33:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:33:59,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:33:59,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:33:59,369 INFO L87 Difference]: Start difference. First operand 54 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 13:33:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:33:59,429 INFO L93 Difference]: Finished difference Result 90 states and 142 transitions. [2024-12-02 13:33:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:33:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-12-02 13:33:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:33:59,430 INFO L225 Difference]: With dead ends: 90 [2024-12-02 13:33:59,430 INFO L226 Difference]: Without dead ends: 54 [2024-12-02 13:33:59,431 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 13:33:59,431 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:33:59,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:33:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-12-02 13:33:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-12-02 13:33:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 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 13:33:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-12-02 13:33:59,437 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 19 [2024-12-02 13:33:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:33:59,437 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-12-02 13:33:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 13:33:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-12-02 13:33:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-02 13:33:59,438 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:33:59,438 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] [2024-12-02 13:33:59,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 13:33:59,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:33:59,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:33:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2010748053, now seen corresponding path program 1 times [2024-12-02 13:33:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:33:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204964025] [2024-12-02 13:33:59,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:33:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:33:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:33:59,571 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 13:33:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:33:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204964025] [2024-12-02 13:33:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204964025] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:33:59,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:33:59,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:33:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428592142] [2024-12-02 13:33:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:33:59,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:33:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:33:59,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:33:59,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:33:59,573 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 13:33:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:33:59,711 INFO L93 Difference]: Finished difference Result 246 states and 372 transitions. [2024-12-02 13:33:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:33:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-12-02 13:33:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:33:59,714 INFO L225 Difference]: With dead ends: 246 [2024-12-02 13:33:59,714 INFO L226 Difference]: Without dead ends: 214 [2024-12-02 13:33:59,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:33:59,715 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 327 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:33:59,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 350 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:33:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-12-02 13:33:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 84. [2024-12-02 13:33:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 13:33:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-12-02 13:33:59,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 34 [2024-12-02 13:33:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:33:59,726 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-12-02 13:33:59,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 13:33:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-12-02 13:33:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 13:33:59,727 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:33:59,728 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] [2024-12-02 13:33:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 13:33:59,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:33:59,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:33:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1009296933, now seen corresponding path program 1 times [2024-12-02 13:33:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:33:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203100833] [2024-12-02 13:33:59,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:33:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:33:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:33:59,821 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 13:33:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:33:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203100833] [2024-12-02 13:33:59,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203100833] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:33:59,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:33:59,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:33:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118300404] [2024-12-02 13:33:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:33:59,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:33:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:33:59,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:33:59,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:33:59,822 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 13:33:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:33:59,850 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2024-12-02 13:33:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:33:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-12-02 13:33:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:33:59,852 INFO L225 Difference]: With dead ends: 197 [2024-12-02 13:33:59,852 INFO L226 Difference]: Without dead ends: 135 [2024-12-02 13:33:59,852 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 13:33:59,853 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:33:59,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:33:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-12-02 13:33:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-12-02 13:33:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 130 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 13:33:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2024-12-02 13:33:59,864 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 36 [2024-12-02 13:33:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:33:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2024-12-02 13:33:59,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 13:33:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2024-12-02 13:33:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 13:33:59,865 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:33:59,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:33:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 13:33:59,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:33:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:33:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -942803421, now seen corresponding path program 1 times [2024-12-02 13:33:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:33:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373763953] [2024-12-02 13:33:59,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:33:59,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:33:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:00,048 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 13:34:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373763953] [2024-12-02 13:34:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373763953] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:34:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602409254] [2024-12-02 13:34:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:34:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:00,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:34:00,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:34:00,050 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 13:34:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:00,126 INFO L93 Difference]: Finished difference Result 242 states and 357 transitions. [2024-12-02 13:34:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:34:00,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-12-02 13:34:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:00,127 INFO L225 Difference]: With dead ends: 242 [2024-12-02 13:34:00,127 INFO L226 Difference]: Without dead ends: 133 [2024-12-02 13:34:00,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:34:00,129 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:00,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 206 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-12-02 13:34:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-12-02 13:34:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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 13:34:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2024-12-02 13:34:00,139 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 36 [2024-12-02 13:34:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2024-12-02 13:34:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 13:34:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2024-12-02 13:34:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 13:34:00,141 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:00,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 13:34:00,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 423141804, now seen corresponding path program 1 times [2024-12-02 13:34:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155822667] [2024-12-02 13:34:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:00,352 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 13:34:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155822667] [2024-12-02 13:34:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155822667] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 13:34:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630467870] [2024-12-02 13:34:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:00,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:34:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:00,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:34:00,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:34:00,354 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:00,402 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2024-12-02 13:34:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 13:34:00,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-12-02 13:34:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:00,404 INFO L225 Difference]: With dead ends: 139 [2024-12-02 13:34:00,404 INFO L226 Difference]: Without dead ends: 137 [2024-12-02 13:34:00,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:34:00,405 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:00,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-12-02 13:34:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-12-02 13:34:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.411764705882353) internal successors, (192), 136 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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 13:34:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-12-02 13:34:00,415 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 37 [2024-12-02 13:34:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:00,415 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-12-02 13:34:00,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-12-02 13:34:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 13:34:00,417 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:00,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 13:34:00,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -107409885, now seen corresponding path program 1 times [2024-12-02 13:34:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209322270] [2024-12-02 13:34:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:00,464 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 13:34:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:00,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209322270] [2024-12-02 13:34:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209322270] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:00,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997371166] [2024-12-02 13:34:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:00,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:00,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:00,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:00,466 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:00,484 INFO L93 Difference]: Finished difference Result 351 states and 504 transitions. [2024-12-02 13:34:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-12-02 13:34:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:00,486 INFO L225 Difference]: With dead ends: 351 [2024-12-02 13:34:00,486 INFO L226 Difference]: Without dead ends: 236 [2024-12-02 13:34:00,486 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 13:34:00,487 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:00,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-12-02 13:34:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-12-02 13:34:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4120171673819744) internal successors, (329), 233 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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 13:34:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 329 transitions. [2024-12-02 13:34:00,501 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 329 transitions. Word has length 38 [2024-12-02 13:34:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:00,501 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 329 transitions. [2024-12-02 13:34:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 329 transitions. [2024-12-02 13:34:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 13:34:00,502 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:00,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:00,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 13:34:00,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1673522979, now seen corresponding path program 1 times [2024-12-02 13:34:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331476506] [2024-12-02 13:34:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:00,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:00,554 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 13:34:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331476506] [2024-12-02 13:34:00,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331476506] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:00,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:00,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399962606] [2024-12-02 13:34:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:00,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:00,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:00,556 INFO L87 Difference]: Start difference. First operand 234 states and 329 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:00,575 INFO L93 Difference]: Finished difference Result 626 states and 887 transitions. [2024-12-02 13:34:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:00,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-12-02 13:34:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:00,578 INFO L225 Difference]: With dead ends: 626 [2024-12-02 13:34:00,578 INFO L226 Difference]: Without dead ends: 414 [2024-12-02 13:34:00,579 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 13:34:00,579 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:00,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-12-02 13:34:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2024-12-02 13:34:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.389294403892944) internal successors, (571), 411 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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 13:34:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 571 transitions. [2024-12-02 13:34:00,596 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 571 transitions. Word has length 38 [2024-12-02 13:34:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:00,596 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 571 transitions. [2024-12-02 13:34:00,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 571 transitions. [2024-12-02 13:34:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-02 13:34:00,597 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:00,597 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] [2024-12-02 13:34:00,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 13:34:00,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:00,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash 913154302, now seen corresponding path program 1 times [2024-12-02 13:34:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:00,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843094599] [2024-12-02 13:34:00,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:00,645 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 13:34:00,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:00,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843094599] [2024-12-02 13:34:00,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843094599] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:00,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:00,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:00,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983913872] [2024-12-02 13:34:00,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:00,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:00,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:00,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:00,647 INFO L87 Difference]: Start difference. First operand 412 states and 571 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:00,673 INFO L93 Difference]: Finished difference Result 835 states and 1177 transitions. [2024-12-02 13:34:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:00,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-12-02 13:34:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:00,677 INFO L225 Difference]: With dead ends: 835 [2024-12-02 13:34:00,677 INFO L226 Difference]: Without dead ends: 600 [2024-12-02 13:34:00,677 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 13:34:00,678 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:00,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-12-02 13:34:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2024-12-02 13:34:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3819095477386936) internal successors, (825), 597 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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 13:34:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 825 transitions. [2024-12-02 13:34:00,701 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 825 transitions. Word has length 40 [2024-12-02 13:34:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:00,701 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 825 transitions. [2024-12-02 13:34:00,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 825 transitions. [2024-12-02 13:34:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 13:34:00,702 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:00,703 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] [2024-12-02 13:34:00,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 13:34:00,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:00,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2071314416, now seen corresponding path program 1 times [2024-12-02 13:34:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011770598] [2024-12-02 13:34:00,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 13:34:00,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011770598] [2024-12-02 13:34:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011770598] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:00,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:34:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306055300] [2024-12-02 13:34:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:00,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:34:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:00,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:34:00,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:34:00,835 INFO L87 Difference]: Start difference. First operand 598 states and 825 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 13:34:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:00,932 INFO L93 Difference]: Finished difference Result 2454 states and 3405 transitions. [2024-12-02 13:34:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:34:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 53 [2024-12-02 13:34:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:00,939 INFO L225 Difference]: With dead ends: 2454 [2024-12-02 13:34:00,939 INFO L226 Difference]: Without dead ends: 1880 [2024-12-02 13:34:00,940 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 13:34:00,941 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 176 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:00,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 281 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2024-12-02 13:34:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1170. [2024-12-02 13:34:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.3798118049615056) internal successors, (1613), 1169 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states 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 13:34:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1613 transitions. [2024-12-02 13:34:00,991 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1613 transitions. Word has length 53 [2024-12-02 13:34:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:00,991 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1613 transitions. [2024-12-02 13:34:00,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 13:34:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1613 transitions. [2024-12-02 13:34:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 13:34:00,993 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:00,993 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] [2024-12-02 13:34:00,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 13:34:00,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:00,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash -442720016, now seen corresponding path program 1 times [2024-12-02 13:34:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486526403] [2024-12-02 13:34:00,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 13:34:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486526403] [2024-12-02 13:34:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486526403] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:01,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:34:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269168901] [2024-12-02 13:34:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:34:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:01,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:34:01,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:34:01,089 INFO L87 Difference]: Start difference. First operand 1170 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 13:34:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:01,212 INFO L93 Difference]: Finished difference Result 3026 states and 4193 transitions. [2024-12-02 13:34:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:34:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 53 [2024-12-02 13:34:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:01,220 INFO L225 Difference]: With dead ends: 3026 [2024-12-02 13:34:01,220 INFO L226 Difference]: Without dead ends: 2452 [2024-12-02 13:34:01,221 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 13:34:01,222 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 177 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:01,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 278 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:34:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2024-12-02 13:34:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2030. [2024-12-02 13:34:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3725973385904386) internal successors, (2785), 2029 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states 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 13:34:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2785 transitions. [2024-12-02 13:34:01,305 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2785 transitions. Word has length 53 [2024-12-02 13:34:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:01,306 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2785 transitions. [2024-12-02 13:34:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 13:34:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2785 transitions. [2024-12-02 13:34:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-02 13:34:01,307 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:01,307 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] [2024-12-02 13:34:01,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 13:34:01,307 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:01,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 614088040, now seen corresponding path program 1 times [2024-12-02 13:34:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409453984] [2024-12-02 13:34:01,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:01,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409453984] [2024-12-02 13:34:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409453984] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942228154] [2024-12-02 13:34:01,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:01,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:01,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:01,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:01,401 INFO L87 Difference]: Start difference. First operand 2030 states and 2785 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:01,451 INFO L93 Difference]: Finished difference Result 3506 states and 4848 transitions. [2024-12-02 13:34:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:01,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-12-02 13:34:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:01,456 INFO L225 Difference]: With dead ends: 3506 [2024-12-02 13:34:01,456 INFO L226 Difference]: Without dead ends: 1500 [2024-12-02 13:34:01,459 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 13:34:01,459 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:01,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-12-02 13:34:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1498. [2024-12-02 13:34:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 1.3740814963259853) internal successors, (2057), 1497 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states 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 13:34:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2057 transitions. [2024-12-02 13:34:01,514 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2057 transitions. Word has length 55 [2024-12-02 13:34:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2057 transitions. [2024-12-02 13:34:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2057 transitions. [2024-12-02 13:34:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-02 13:34:01,515 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:01,515 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] [2024-12-02 13:34:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 13:34:01,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1276832885, now seen corresponding path program 1 times [2024-12-02 13:34:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073972324] [2024-12-02 13:34:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 13:34:01,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:01,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073972324] [2024-12-02 13:34:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073972324] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:34:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743689693] [2024-12-02 13:34:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:01,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:34:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:01,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:34:01,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:34:01,619 INFO L87 Difference]: Start difference. First operand 1498 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:01,738 INFO L93 Difference]: Finished difference Result 2754 states and 3813 transitions. [2024-12-02 13:34:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:34:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-12-02 13:34:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:01,744 INFO L225 Difference]: With dead ends: 2754 [2024-12-02 13:34:01,744 INFO L226 Difference]: Without dead ends: 2336 [2024-12-02 13:34:01,745 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 13:34:01,745 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 171 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:01,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 304 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:34:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2024-12-02 13:34:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1914. [2024-12-02 13:34:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.3763721902770518) internal successors, (2633), 1913 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states 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 13:34:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2633 transitions. [2024-12-02 13:34:01,817 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2633 transitions. Word has length 55 [2024-12-02 13:34:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:01,817 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2633 transitions. [2024-12-02 13:34:01,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2633 transitions. [2024-12-02 13:34:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 13:34:01,818 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:01,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 13:34:01,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -935959243, now seen corresponding path program 1 times [2024-12-02 13:34:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63817760] [2024-12-02 13:34:01,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:01,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63817760] [2024-12-02 13:34:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63817760] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:01,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165347280] [2024-12-02 13:34:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:01,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:01,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:01,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:01,911 INFO L87 Difference]: Start difference. First operand 1914 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:01,957 INFO L93 Difference]: Finished difference Result 2854 states and 3931 transitions. [2024-12-02 13:34:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-12-02 13:34:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:01,960 INFO L225 Difference]: With dead ends: 2854 [2024-12-02 13:34:01,960 INFO L226 Difference]: Without dead ends: 980 [2024-12-02 13:34:01,962 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 13:34:01,962 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:01,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-12-02 13:34:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 978. [2024-12-02 13:34:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.3500511770726715) internal successors, (1319), 977 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states 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 13:34:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1319 transitions. [2024-12-02 13:34:01,988 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1319 transitions. Word has length 56 [2024-12-02 13:34:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:01,988 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1319 transitions. [2024-12-02 13:34:01,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1319 transitions. [2024-12-02 13:34:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 13:34:01,989 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:01,989 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] [2024-12-02 13:34:01,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 13:34:01,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:01,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash 735785191, now seen corresponding path program 1 times [2024-12-02 13:34:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515803259] [2024-12-02 13:34:01,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515803259] [2024-12-02 13:34:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515803259] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:02,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:02,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182926126] [2024-12-02 13:34:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:02,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:02,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:02,054 INFO L87 Difference]: Start difference. First operand 978 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 13:34:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:02,074 INFO L93 Difference]: Finished difference Result 1450 states and 1960 transitions. [2024-12-02 13:34:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2024-12-02 13:34:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:02,077 INFO L225 Difference]: With dead ends: 1450 [2024-12-02 13:34:02,077 INFO L226 Difference]: Without dead ends: 512 [2024-12-02 13:34:02,077 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 13:34:02,078 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:02,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:34:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-12-02 13:34:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2024-12-02 13:34:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.3182711198428292) internal successors, (671), 509 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 13:34:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 671 transitions. [2024-12-02 13:34:02,093 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 671 transitions. Word has length 58 [2024-12-02 13:34:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:02,093 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 671 transitions. [2024-12-02 13:34:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 13:34:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 671 transitions. [2024-12-02 13:34:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 13:34:02,094 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:02,094 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] [2024-12-02 13:34:02,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 13:34:02,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:02,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:02,095 INFO L85 PathProgramCache]: Analyzing trace with hash -967290087, now seen corresponding path program 1 times [2024-12-02 13:34:02,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:02,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411003414] [2024-12-02 13:34:02,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:02,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:02,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411003414] [2024-12-02 13:34:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411003414] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:34:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691481304] [2024-12-02 13:34:02,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:02,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:34:02,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 13:34:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:02,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 13:34:02,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:34:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:03,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:34:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691481304] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:34:04,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:34:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-12-02 13:34:04,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100114158] [2024-12-02 13:34:04,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:34:04,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 13:34:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:04,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 13:34:04,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-12-02 13:34:04,133 INFO L87 Difference]: Start difference. First operand 510 states and 671 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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 13:34:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:04,513 INFO L93 Difference]: Finished difference Result 1452 states and 1934 transitions. [2024-12-02 13:34:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:34:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 0 states have call successors, (0), 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 60 [2024-12-02 13:34:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:04,517 INFO L225 Difference]: With dead ends: 1452 [2024-12-02 13:34:04,517 INFO L226 Difference]: Without dead ends: 982 [2024-12-02 13:34:04,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2024-12-02 13:34:04,519 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 611 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:04,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 368 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:34:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-12-02 13:34:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 978. [2024-12-02 13:34:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.322415557830092) internal successors, (1292), 977 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 13:34:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1292 transitions. [2024-12-02 13:34:04,556 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1292 transitions. Word has length 60 [2024-12-02 13:34:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:04,557 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1292 transitions. [2024-12-02 13:34:04,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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 13:34:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1292 transitions. [2024-12-02 13:34:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 13:34:04,557 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:04,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:04,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 13:34:04,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 13:34:04,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:04,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash 626107023, now seen corresponding path program 1 times [2024-12-02 13:34:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:04,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136627472] [2024-12-02 13:34:04,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136627472] [2024-12-02 13:34:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136627472] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:34:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17044353] [2024-12-02 13:34:05,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:05,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:05,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:05,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:34:05,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 13:34:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 13:34:06,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:34:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:06,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:34:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17044353] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:34:07,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:34:07,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-12-02 13:34:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418229117] [2024-12-02 13:34:07,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:34:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 13:34:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:07,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 13:34:07,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-12-02 13:34:07,161 INFO L87 Difference]: Start difference. First operand 978 states and 1292 transitions. Second operand has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 13:34:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:07,724 INFO L93 Difference]: Finished difference Result 2964 states and 3959 transitions. [2024-12-02 13:34:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 13:34:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 13:34:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:07,730 INFO L225 Difference]: With dead ends: 2964 [2024-12-02 13:34:07,730 INFO L226 Difference]: Without dead ends: 2026 [2024-12-02 13:34:07,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 13:34:07,733 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 720 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:07,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 492 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:34:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2024-12-02 13:34:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1986. [2024-12-02 13:34:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 1.3083123425692695) internal successors, (2597), 1985 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states 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 13:34:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2597 transitions. [2024-12-02 13:34:07,805 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2597 transitions. Word has length 61 [2024-12-02 13:34:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:07,805 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2597 transitions. [2024-12-02 13:34:07,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 13:34:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2597 transitions. [2024-12-02 13:34:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 13:34:07,806 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:07,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:07,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 13:34:08,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 13:34:08,007 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:08,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1076670289, now seen corresponding path program 1 times [2024-12-02 13:34:08,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:08,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790228388] [2024-12-02 13:34:08,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790228388] [2024-12-02 13:34:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790228388] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:34:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566869889] [2024-12-02 13:34:08,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:08,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:34:08,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 13:34:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:08,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 13:34:08,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:34:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:09,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:34:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566869889] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:34:10,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:34:10,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2024-12-02 13:34:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873474648] [2024-12-02 13:34:10,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:34:10,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 13:34:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:10,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 13:34:10,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2024-12-02 13:34:10,641 INFO L87 Difference]: Start difference. First operand 1986 states and 2597 transitions. Second operand has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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 13:34:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:11,990 INFO L93 Difference]: Finished difference Result 8484 states and 11143 transitions. [2024-12-02 13:34:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-12-02 13:34:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 13:34:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:12,001 INFO L225 Difference]: With dead ends: 8484 [2024-12-02 13:34:12,001 INFO L226 Difference]: Without dead ends: 6538 [2024-12-02 13:34:12,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=892, Invalid=2890, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 13:34:12,004 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 909 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:12,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 757 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:34:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2024-12-02 13:34:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 4647. [2024-12-02 13:34:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4647 states, 4646 states have (on average 1.2948773138183383) internal successors, (6016), 4646 states have internal predecessors, (6016), 0 states have call successors, (0), 0 states 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 13:34:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 6016 transitions. [2024-12-02 13:34:12,163 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 6016 transitions. Word has length 61 [2024-12-02 13:34:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:12,163 INFO L471 AbstractCegarLoop]: Abstraction has 4647 states and 6016 transitions. [2024-12-02 13:34:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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 13:34:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 6016 transitions. [2024-12-02 13:34:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 13:34:12,164 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:12,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:12,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 13:34:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 13:34:12,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash -145481317, now seen corresponding path program 1 times [2024-12-02 13:34:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323487688] [2024-12-02 13:34:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323487688] [2024-12-02 13:34:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323487688] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:34:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594215199] [2024-12-02 13:34:13,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:13,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:13,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:34:13,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 13:34:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:13,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 13:34:13,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:34:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:13,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:34:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594215199] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:34:14,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:34:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 34 [2024-12-02 13:34:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543291088] [2024-12-02 13:34:14,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:34:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 13:34:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:14,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 13:34:14,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 13:34:14,454 INFO L87 Difference]: Start difference. First operand 4647 states and 6016 transitions. Second operand has 34 states, 34 states have (on average 4.852941176470588) internal successors, (165), 34 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:18,352 INFO L93 Difference]: Finished difference Result 11120 states and 14450 transitions. [2024-12-02 13:34:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-12-02 13:34:18,352 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.852941176470588) internal successors, (165), 34 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 13:34:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:18,370 INFO L225 Difference]: With dead ends: 11120 [2024-12-02 13:34:18,370 INFO L226 Difference]: Without dead ends: 8245 [2024-12-02 13:34:18,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1644, Invalid=6188, Unknown=0, NotChecked=0, Total=7832 [2024-12-02 13:34:18,374 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2047 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:18,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 1355 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 13:34:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2024-12-02 13:34:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 3932. [2024-12-02 13:34:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3931 states have (on average 1.2887306029000254) internal successors, (5066), 3931 states have internal predecessors, (5066), 0 states have call successors, (0), 0 states 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 13:34:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5066 transitions. [2024-12-02 13:34:18,496 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5066 transitions. Word has length 62 [2024-12-02 13:34:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:18,496 INFO L471 AbstractCegarLoop]: Abstraction has 3932 states and 5066 transitions. [2024-12-02 13:34:18,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.852941176470588) internal successors, (165), 34 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5066 transitions. [2024-12-02 13:34:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 13:34:18,497 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:18,497 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] [2024-12-02 13:34:18,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 13:34:18,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:18,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:18,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1762085537, now seen corresponding path program 1 times [2024-12-02 13:34:18,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817131849] [2024-12-02 13:34:18,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817131849] [2024-12-02 13:34:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817131849] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:34:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674369226] [2024-12-02 13:34:19,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:19,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:19,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:19,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:34:19,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 13:34:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:19,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 13:34:19,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:34:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 13:34:20,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:34:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 13:34:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674369226] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:34:20,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:34:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 4] total 26 [2024-12-02 13:34:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409089499] [2024-12-02 13:34:20,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:34:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 13:34:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:20,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 13:34:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-12-02 13:34:20,181 INFO L87 Difference]: Start difference. First operand 3932 states and 5066 transitions. Second operand has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 13:34:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:34:28,237 INFO L93 Difference]: Finished difference Result 10223 states and 12975 transitions. [2024-12-02 13:34:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-12-02 13:34:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 13:34:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:34:28,246 INFO L225 Difference]: With dead ends: 10223 [2024-12-02 13:34:28,247 INFO L226 Difference]: Without dead ends: 6363 [2024-12-02 13:34:28,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3158, Invalid=13612, Unknown=0, NotChecked=0, Total=16770 [2024-12-02 13:34:28,251 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3390 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:34:28,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 1211 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 13:34:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6363 states. [2024-12-02 13:34:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6363 to 6102. [2024-12-02 13:34:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6102 states, 6101 states have (on average 1.2181609572201277) internal successors, (7432), 6101 states have internal predecessors, (7432), 0 states have call successors, (0), 0 states 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 13:34:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 7432 transitions. [2024-12-02 13:34:28,486 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 7432 transitions. Word has length 63 [2024-12-02 13:34:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:34:28,487 INFO L471 AbstractCegarLoop]: Abstraction has 6102 states and 7432 transitions. [2024-12-02 13:34:28,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 13:34:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 7432 transitions. [2024-12-02 13:34:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 13:34:28,487 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:34:28,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:28,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 13:34:28,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:28,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:34:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -221777393, now seen corresponding path program 1 times [2024-12-02 13:34:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123525855] [2024-12-02 13:34:28,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:29,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123525855] [2024-12-02 13:34:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123525855] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:34:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082085316] [2024-12-02 13:34:29,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:29,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:34:29,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:29,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:34:29,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 13:34:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:29,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 13:34:29,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:34:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:32,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:34:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082085316] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:34:35,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:34:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 20] total 59 [2024-12-02 13:34:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015434431] [2024-12-02 13:34:35,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:34:35,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-02 13:34:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-02 13:34:35,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3037, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 13:34:35,999 INFO L87 Difference]: Start difference. First operand 6102 states and 7432 transitions. Second operand has 59 states, 59 states have (on average 2.8983050847457625) internal successors, (171), 59 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 13:35:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:35:13,433 INFO L93 Difference]: Finished difference Result 10495 states and 12763 transitions. [2024-12-02 13:35:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2024-12-02 13:35:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.8983050847457625) internal successors, (171), 59 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 13:35:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:35:13,453 INFO L225 Difference]: With dead ends: 10495 [2024-12-02 13:35:13,453 INFO L226 Difference]: Without dead ends: 9448 [2024-12-02 13:35:13,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14068 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=6564, Invalid=34442, Unknown=0, NotChecked=0, Total=41006 [2024-12-02 13:35:13,464 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 2631 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 3596 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:35:13,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2631 Valid, 3596 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-02 13:35:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9448 states. [2024-12-02 13:35:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9448 to 6233. [2024-12-02 13:35:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6232 states have (on average 1.2171052631578947) internal successors, (7585), 6232 states have internal predecessors, (7585), 0 states have call successors, (0), 0 states 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 13:35:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 7585 transitions. [2024-12-02 13:35:13,904 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 7585 transitions. Word has length 63 [2024-12-02 13:35:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:35:13,904 INFO L471 AbstractCegarLoop]: Abstraction has 6233 states and 7585 transitions. [2024-12-02 13:35:13,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.8983050847457625) internal successors, (171), 59 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 13:35:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 7585 transitions. [2024-12-02 13:35:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 13:35:13,905 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:35:13,905 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 13:35:13,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 13:35:14,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-02 13:35:14,106 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:35:14,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:35:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1489241715, now seen corresponding path program 1 times [2024-12-02 13:35:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:35:14,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187831283] [2024-12-02 13:35:14,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:35:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:35:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187831283] [2024-12-02 13:35:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187831283] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:35:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296209140] [2024-12-02 13:35:14,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:35:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:35:14,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:35:14,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 13:35:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:14,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-02 13:35:14,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:35:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:15,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:35:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296209140] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:35:16,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:35:16,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2024-12-02 13:35:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775828799] [2024-12-02 13:35:16,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:35:16,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 13:35:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:35:16,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 13:35:16,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 13:35:16,920 INFO L87 Difference]: Start difference. First operand 6233 states and 7585 transitions. Second operand has 36 states, 36 states have (on average 4.222222222222222) internal successors, (152), 36 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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 13:35:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:35:17,878 INFO L93 Difference]: Finished difference Result 7663 states and 9354 transitions. [2024-12-02 13:35:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 13:35:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.222222222222222) internal successors, (152), 36 states have internal predecessors, (152), 0 states have call successors, (0), 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 13:35:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:35:17,885 INFO L225 Difference]: With dead ends: 7663 [2024-12-02 13:35:17,886 INFO L226 Difference]: Without dead ends: 3662 [2024-12-02 13:35:17,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=455, Invalid=1707, Unknown=0, NotChecked=0, Total=2162 [2024-12-02 13:35:17,889 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 718 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:35:17,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 547 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:35:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-12-02 13:35:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3656. [2024-12-02 13:35:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 3655 states have (on average 1.2218878248974008) internal successors, (4466), 3655 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states 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 13:35:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 4466 transitions. [2024-12-02 13:35:18,125 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 4466 transitions. Word has length 64 [2024-12-02 13:35:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:35:18,125 INFO L471 AbstractCegarLoop]: Abstraction has 3656 states and 4466 transitions. [2024-12-02 13:35:18,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.222222222222222) internal successors, (152), 36 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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 13:35:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 4466 transitions. [2024-12-02 13:35:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 13:35:18,127 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:35:18,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:35:18,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 13:35:18,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 13:35:18,327 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:35:18,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:35:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash -564565362, now seen corresponding path program 1 times [2024-12-02 13:35:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:35:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988777543] [2024-12-02 13:35:18,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:18,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:35:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:35:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988777543] [2024-12-02 13:35:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988777543] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:35:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816558016] [2024-12-02 13:35:18,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:18,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:35:18,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:35:18,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:35:18,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 13:35:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:19,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 13:35:19,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:35:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:19,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:35:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:20,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816558016] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:35:20,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:35:20,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-02 13:35:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984639265] [2024-12-02 13:35:20,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:35:20,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 13:35:20,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:35:20,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 13:35:20,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2024-12-02 13:35:20,988 INFO L87 Difference]: Start difference. First operand 3656 states and 4466 transitions. Second operand has 27 states, 27 states have (on average 8.592592592592593) internal successors, (232), 26 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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 13:35:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:35:21,796 INFO L93 Difference]: Finished difference Result 5582 states and 6842 transitions. [2024-12-02 13:35:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 13:35:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.592592592592593) internal successors, (232), 26 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-12-02 13:35:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:35:21,802 INFO L225 Difference]: With dead ends: 5582 [2024-12-02 13:35:21,802 INFO L226 Difference]: Without dead ends: 3702 [2024-12-02 13:35:21,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 13:35:21,804 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 416 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:35:21,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 678 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:35:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2024-12-02 13:35:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3656. [2024-12-02 13:35:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 3655 states have (on average 1.212859097127223) internal successors, (4433), 3655 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states 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 13:35:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 4433 transitions. [2024-12-02 13:35:21,995 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 4433 transitions. Word has length 103 [2024-12-02 13:35:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:35:21,995 INFO L471 AbstractCegarLoop]: Abstraction has 3656 states and 4433 transitions. [2024-12-02 13:35:21,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.592592592592593) internal successors, (232), 26 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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 13:35:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 4433 transitions. [2024-12-02 13:35:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 13:35:21,997 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:35:21,997 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:35:22,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 13:35:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 13:35:22,198 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:35:22,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:35:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 916541582, now seen corresponding path program 1 times [2024-12-02 13:35:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:35:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010891915] [2024-12-02 13:35:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:35:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:35:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010891915] [2024-12-02 13:35:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010891915] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:35:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706712868] [2024-12-02 13:35:23,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:23,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:35:23,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:35:23,060 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:35:23,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 13:35:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:23,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-12-02 13:35:23,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:35:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:24,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:35:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706712868] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:35:28,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:35:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 22] total 60 [2024-12-02 13:35:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803235690] [2024-12-02 13:35:28,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:35:28,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 13:35:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:35:28,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 13:35:28,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=3154, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 13:35:28,252 INFO L87 Difference]: Start difference. First operand 3656 states and 4433 transitions. Second operand has 60 states, 60 states have (on average 4.9) internal successors, (294), 60 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:35:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:35:41,151 INFO L93 Difference]: Finished difference Result 11935 states and 14427 transitions. [2024-12-02 13:35:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-12-02 13:35:41,151 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 4.9) internal successors, (294), 60 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-12-02 13:35:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:35:41,160 INFO L225 Difference]: With dead ends: 11935 [2024-12-02 13:35:41,160 INFO L226 Difference]: Without dead ends: 10551 [2024-12-02 13:35:41,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7297 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=4284, Invalid=19278, Unknown=0, NotChecked=0, Total=23562 [2024-12-02 13:35:41,164 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2680 mSDsluCounter, 2823 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2680 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 13:35:41,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2680 Valid, 2969 Invalid, 2506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 13:35:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10551 states. [2024-12-02 13:35:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10551 to 6997. [2024-12-02 13:35:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6997 states, 6996 states have (on average 1.2104059462550028) internal successors, (8468), 6996 states have internal predecessors, (8468), 0 states have call successors, (0), 0 states 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 13:35:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 8468 transitions. [2024-12-02 13:35:41,731 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 8468 transitions. Word has length 103 [2024-12-02 13:35:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:35:41,731 INFO L471 AbstractCegarLoop]: Abstraction has 6997 states and 8468 transitions. [2024-12-02 13:35:41,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.9) internal successors, (294), 60 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:35:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 8468 transitions. [2024-12-02 13:35:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 13:35:41,733 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:35:41,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:35:41,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 13:35:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 13:35:41,934 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:35:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:35:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2053929322, now seen corresponding path program 1 times [2024-12-02 13:35:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:35:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809094467] [2024-12-02 13:35:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:35:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:42,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:35:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809094467] [2024-12-02 13:35:42,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809094467] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:35:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036239393] [2024-12-02 13:35:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:35:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:35:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:35:42,950 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:35:42,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 13:35:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:35:43,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-12-02 13:35:43,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:35:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:46,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:35:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:35:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036239393] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:35:54,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:35:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 24] total 67 [2024-12-02 13:35:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863553281] [2024-12-02 13:35:54,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:35:54,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-12-02 13:35:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:35:54,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-12-02 13:35:54,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=3854, Unknown=0, NotChecked=0, Total=4422 [2024-12-02 13:35:54,811 INFO L87 Difference]: Start difference. First operand 6997 states and 8468 transitions. Second operand has 67 states, 67 states have (on average 4.2835820895522385) internal successors, (287), 67 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:36:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:36:52,678 INFO L93 Difference]: Finished difference Result 19026 states and 23044 transitions. [2024-12-02 13:36:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2024-12-02 13:36:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.2835820895522385) internal successors, (287), 67 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-12-02 13:36:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:36:52,688 INFO L225 Difference]: With dead ends: 19026 [2024-12-02 13:36:52,688 INFO L226 Difference]: Without dead ends: 13118 [2024-12-02 13:36:52,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22321 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=10819, Invalid=50437, Unknown=0, NotChecked=0, Total=61256 [2024-12-02 13:36:52,693 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 4925 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 3296 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 3584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 3296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-12-02 13:36:52,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 3411 Invalid, 3584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 3296 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-12-02 13:36:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2024-12-02 13:36:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 11867. [2024-12-02 13:36:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11866 states have (on average 1.2148154390696106) internal successors, (14415), 11866 states have internal predecessors, (14415), 0 states have call successors, (0), 0 states 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 13:36:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 14415 transitions. [2024-12-02 13:36:53,613 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 14415 transitions. Word has length 104 [2024-12-02 13:36:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:36:53,614 INFO L471 AbstractCegarLoop]: Abstraction has 11867 states and 14415 transitions. [2024-12-02 13:36:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.2835820895522385) internal successors, (287), 67 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:36:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 14415 transitions. [2024-12-02 13:36:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 13:36:53,615 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:36:53,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:36:53,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 13:36:53,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:36:53,816 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:36:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:36:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1672212738, now seen corresponding path program 1 times [2024-12-02 13:36:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:36:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250507587] [2024-12-02 13:36:53,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:36:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:36:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:36:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:36:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:36:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250507587] [2024-12-02 13:36:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250507587] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:36:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759780084] [2024-12-02 13:36:54,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:36:54,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:36:54,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:36:54,943 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:36:54,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 13:36:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:36:55,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-12-02 13:36:55,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:36:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:36:57,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:37:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:37:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759780084] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:37:00,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:37:00,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18] total 55 [2024-12-02 13:37:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484365912] [2024-12-02 13:37:00,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:37:00,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-12-02 13:37:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:37:00,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-12-02 13:37:00,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 13:37:00,566 INFO L87 Difference]: Start difference. First operand 11867 states and 14415 transitions. Second operand has 55 states, 55 states have (on average 5.3090909090909095) internal successors, (292), 55 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:37:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:37:11,894 INFO L93 Difference]: Finished difference Result 16207 states and 19604 transitions. [2024-12-02 13:37:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-12-02 13:37:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.3090909090909095) internal successors, (292), 55 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-12-02 13:37:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:37:11,954 INFO L225 Difference]: With dead ends: 16207 [2024-12-02 13:37:11,954 INFO L226 Difference]: Without dead ends: 13252 [2024-12-02 13:37:11,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1549, Invalid=8753, Unknown=0, NotChecked=0, Total=10302 [2024-12-02 13:37:11,962 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1696 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 13:37:11,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 1854 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 13:37:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2024-12-02 13:37:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 11877. [2024-12-02 13:37:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11877 states, 11876 states have (on average 1.2147187605254295) internal successors, (14426), 11876 states have internal predecessors, (14426), 0 states have call successors, (0), 0 states 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 13:37:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11877 states to 11877 states and 14426 transitions. [2024-12-02 13:37:13,637 INFO L78 Accepts]: Start accepts. Automaton has 11877 states and 14426 transitions. Word has length 104 [2024-12-02 13:37:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:37:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 11877 states and 14426 transitions. [2024-12-02 13:37:13,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.3090909090909095) internal successors, (292), 55 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:37:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 11877 states and 14426 transitions. [2024-12-02 13:37:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 13:37:13,644 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:37:13,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:37:13,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 13:37:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 13:37:13,845 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:37:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:37:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1315450294, now seen corresponding path program 1 times [2024-12-02 13:37:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:37:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896851918] [2024-12-02 13:37:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:37:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:37:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:37:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:37:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:37:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896851918] [2024-12-02 13:37:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896851918] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:37:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677123562] [2024-12-02 13:37:15,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:37:15,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:37:15,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:37:16,001 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:37:16,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 13:37:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:37:16,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-12-02 13:37:16,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:37:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:37:20,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:37:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:37:29,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677123562] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:37:29,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:37:29,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 30] total 76 [2024-12-02 13:37:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714486207] [2024-12-02 13:37:29,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:37:29,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-02 13:37:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:37:29,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-02 13:37:29,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=5213, Unknown=0, NotChecked=0, Total=5700 [2024-12-02 13:37:29,240 INFO L87 Difference]: Start difference. First operand 11877 states and 14426 transitions. Second operand has 76 states, 76 states have (on average 3.776315789473684) internal successors, (287), 76 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:38:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:38:54,339 INFO L93 Difference]: Finished difference Result 32542 states and 39799 transitions. [2024-12-02 13:38:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2024-12-02 13:38:54,339 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.776315789473684) internal successors, (287), 76 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-12-02 13:38:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:38:54,395 INFO L225 Difference]: With dead ends: 32542 [2024-12-02 13:38:54,396 INFO L226 Difference]: Without dead ends: 23914 [2024-12-02 13:38:54,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23601 ImplicationChecksByTransitivity, 82.9s TimeCoverageRelationStatistics Valid=11368, Invalid=60724, Unknown=0, NotChecked=0, Total=72092 [2024-12-02 13:38:54,408 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 4801 mSDsluCounter, 5951 mSDsCounter, 0 mSdLazyCounter, 5786 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4801 SdHoareTripleChecker+Valid, 6125 SdHoareTripleChecker+Invalid, 6037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 5786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:38:54,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4801 Valid, 6125 Invalid, 6037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 5786 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-12-02 13:38:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23914 states. [2024-12-02 13:38:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23914 to 19356. [2024-12-02 13:38:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19356 states, 19355 states have (on average 1.2194265047791268) internal successors, (23602), 19355 states have internal predecessors, (23602), 0 states have call successors, (0), 0 states 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 13:38:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19356 states to 19356 states and 23602 transitions. [2024-12-02 13:38:56,467 INFO L78 Accepts]: Start accepts. Automaton has 19356 states and 23602 transitions. Word has length 104 [2024-12-02 13:38:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:38:56,467 INFO L471 AbstractCegarLoop]: Abstraction has 19356 states and 23602 transitions. [2024-12-02 13:38:56,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.776315789473684) internal successors, (287), 76 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:38:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 19356 states and 23602 transitions. [2024-12-02 13:38:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 13:38:56,470 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:38:56,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:38:56,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 13:38:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 13:38:56,670 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:38:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:38:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1594512028, now seen corresponding path program 1 times [2024-12-02 13:38:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:38:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168244120] [2024-12-02 13:38:56,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:38:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:38:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:38:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:38:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:38:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168244120] [2024-12-02 13:38:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168244120] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:38:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84041577] [2024-12-02 13:38:58,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:38:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:38:58,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:38:58,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:38:58,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 13:38:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:38:58,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 13:38:58,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:38:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:38:58,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:39:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84041577] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:39:00,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:39:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 12] total 42 [2024-12-02 13:39:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4532562] [2024-12-02 13:39:00,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:39:00,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 13:39:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:00,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 13:39:00,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1549, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 13:39:00,560 INFO L87 Difference]: Start difference. First operand 19356 states and 23602 transitions. Second operand has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 13:39:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:19,103 INFO L93 Difference]: Finished difference Result 70547 states and 86195 transitions. [2024-12-02 13:39:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-12-02 13:39:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-12-02 13:39:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:19,200 INFO L225 Difference]: With dead ends: 70547 [2024-12-02 13:39:19,200 INFO L226 Difference]: Without dead ends: 53786 [2024-12-02 13:39:19,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8112 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=4494, Invalid=22238, Unknown=0, NotChecked=0, Total=26732 [2024-12-02 13:39:19,215 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 2659 mSDsluCounter, 3842 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 4061 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:19,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 4061 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 13:39:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53786 states. [2024-12-02 13:39:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53786 to 27051. [2024-12-02 13:39:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27051 states, 27050 states have (on average 1.2057670979667283) internal successors, (32616), 27050 states have internal predecessors, (32616), 0 states have call successors, (0), 0 states 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 13:39:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27051 states to 27051 states and 32616 transitions. [2024-12-02 13:39:22,172 INFO L78 Accepts]: Start accepts. Automaton has 27051 states and 32616 transitions. Word has length 105 [2024-12-02 13:39:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:22,172 INFO L471 AbstractCegarLoop]: Abstraction has 27051 states and 32616 transitions. [2024-12-02 13:39:22,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 13:39:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27051 states and 32616 transitions. [2024-12-02 13:39:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 13:39:22,174 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:22,174 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:39:22,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 13:39:22,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 13:39:22,375 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:22,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1156908394, now seen corresponding path program 1 times [2024-12-02 13:39:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:22,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185969526] [2024-12-02 13:39:22,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185969526] [2024-12-02 13:39:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185969526] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:39:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748873351] [2024-12-02 13:39:23,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:23,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:39:23,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:39:23,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:39:23,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 13:39:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:23,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 13:39:23,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:39:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:24,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:39:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 23 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748873351] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:39:25,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:39:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 34 [2024-12-02 13:39:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673293346] [2024-12-02 13:39:25,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:39:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 13:39:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:25,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 13:39:25,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 13:39:25,400 INFO L87 Difference]: Start difference. First operand 27051 states and 32616 transitions. Second operand has 34 states, 34 states have (on average 8.0) internal successors, (272), 34 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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 13:39:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:30,412 INFO L93 Difference]: Finished difference Result 55540 states and 67381 transitions. [2024-12-02 13:39:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 13:39:30,413 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.0) internal successors, (272), 34 states have internal predecessors, (272), 0 states have call successors, (0), 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 106 [2024-12-02 13:39:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:30,448 INFO L225 Difference]: With dead ends: 55540 [2024-12-02 13:39:30,448 INFO L226 Difference]: Without dead ends: 30948 [2024-12-02 13:39:30,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2024-12-02 13:39:30,462 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 628 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:30,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1099 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:39:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30948 states. [2024-12-02 13:39:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30948 to 21549. [2024-12-02 13:39:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21549 states, 21548 states have (on average 1.203406348617041) internal successors, (25931), 21548 states have internal predecessors, (25931), 0 states have call successors, (0), 0 states 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 13:39:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21549 states to 21549 states and 25931 transitions. [2024-12-02 13:39:32,941 INFO L78 Accepts]: Start accepts. Automaton has 21549 states and 25931 transitions. Word has length 106 [2024-12-02 13:39:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:32,941 INFO L471 AbstractCegarLoop]: Abstraction has 21549 states and 25931 transitions. [2024-12-02 13:39:32,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.0) internal successors, (272), 34 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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 13:39:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 21549 states and 25931 transitions. [2024-12-02 13:39:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 13:39:32,943 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:32,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:39:32,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 13:39:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 13:39:33,144 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash 207427662, now seen corresponding path program 1 times [2024-12-02 13:39:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576907726] [2024-12-02 13:39:33,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576907726] [2024-12-02 13:39:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576907726] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:39:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085636134] [2024-12-02 13:39:34,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:39:34,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:39:34,041 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:39:34,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 13:39:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:34,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-12-02 13:39:34,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:39:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:36,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:39:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:39:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085636134] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:39:43,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:39:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 26] total 67 [2024-12-02 13:39:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720987020] [2024-12-02 13:39:43,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:39:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-12-02 13:39:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:43,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-12-02 13:39:43,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4026, Unknown=0, NotChecked=0, Total=4422 [2024-12-02 13:39:43,406 INFO L87 Difference]: Start difference. First operand 21549 states and 25931 transitions. Second operand has 67 states, 67 states have (on average 4.253731343283582) internal successors, (285), 67 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:40:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:00,843 INFO L93 Difference]: Finished difference Result 51266 states and 62151 transitions. [2024-12-02 13:40:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-12-02 13:40:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.253731343283582) internal successors, (285), 67 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-12-02 13:40:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:00,873 INFO L225 Difference]: With dead ends: 51266 [2024-12-02 13:40:00,873 INFO L226 Difference]: Without dead ends: 33157 [2024-12-02 13:40:00,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7735 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3785, Invalid=22621, Unknown=0, NotChecked=0, Total=26406 [2024-12-02 13:40:00,883 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2265 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 3535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:00,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 3069 Invalid, 3535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3426 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-12-02 13:40:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33157 states. [2024-12-02 13:40:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33157 to 30938. [2024-12-02 13:40:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30938 states, 30937 states have (on average 1.2130781911626856) internal successors, (37529), 30937 states have internal predecessors, (37529), 0 states have call successors, (0), 0 states 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 13:40:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30938 states to 30938 states and 37529 transitions. [2024-12-02 13:40:04,505 INFO L78 Accepts]: Start accepts. Automaton has 30938 states and 37529 transitions. Word has length 106 [2024-12-02 13:40:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 30938 states and 37529 transitions. [2024-12-02 13:40:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.253731343283582) internal successors, (285), 67 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:40:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30938 states and 37529 transitions. [2024-12-02 13:40:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 13:40:04,507 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:04,507 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:40:04,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 13:40:04,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:40:04,708 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:04,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 514496984, now seen corresponding path program 1 times [2024-12-02 13:40:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908904296] [2024-12-02 13:40:04,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 26 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:40:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908904296] [2024-12-02 13:40:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908904296] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:40:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845660910] [2024-12-02 13:40:05,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:05,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:40:05,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:40:05,929 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:40:05,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 13:40:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:06,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-12-02 13:40:06,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:40:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 26 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:40:09,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:40:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:40:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845660910] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:40:14,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:40:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 23] total 70 [2024-12-02 13:40:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645841957] [2024-12-02 13:40:14,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:40:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-12-02 13:40:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:14,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-12-02 13:40:14,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=4458, Unknown=0, NotChecked=0, Total=4830 [2024-12-02 13:40:14,949 INFO L87 Difference]: Start difference. First operand 30938 states and 37529 transitions. Second operand has 70 states, 70 states have (on average 4.257142857142857) internal successors, (298), 70 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 13:40:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:41,772 INFO L93 Difference]: Finished difference Result 45482 states and 55122 transitions. [2024-12-02 13:40:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-12-02 13:40:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.257142857142857) internal successors, (298), 70 states have internal predecessors, (298), 0 states have call successors, (0), 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 106 [2024-12-02 13:40:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:41,796 INFO L225 Difference]: With dead ends: 45482 [2024-12-02 13:40:41,796 INFO L226 Difference]: Without dead ends: 31235 [2024-12-02 13:40:41,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6909 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=3786, Invalid=22946, Unknown=0, NotChecked=0, Total=26732 [2024-12-02 13:40:41,805 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 3047 mSDsluCounter, 3891 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 3348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:41,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 4008 Invalid, 3348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 13:40:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31235 states. [2024-12-02 13:40:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31235 to 27368. [2024-12-02 13:40:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27368 states, 27367 states have (on average 1.214053422004604) internal successors, (33225), 27367 states have internal predecessors, (33225), 0 states have call successors, (0), 0 states 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 13:40:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27368 states to 27368 states and 33225 transitions. [2024-12-02 13:40:45,329 INFO L78 Accepts]: Start accepts. Automaton has 27368 states and 33225 transitions. Word has length 106 [2024-12-02 13:40:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:45,329 INFO L471 AbstractCegarLoop]: Abstraction has 27368 states and 33225 transitions. [2024-12-02 13:40:45,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.257142857142857) internal successors, (298), 70 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 13:40:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 27368 states and 33225 transitions. [2024-12-02 13:40:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 13:40:45,330 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:45,330 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:40:45,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 13:40:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:40:45,531 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1068786898, now seen corresponding path program 1 times [2024-12-02 13:40:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208072372] [2024-12-02 13:40:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 41 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:40:46,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:46,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208072372] [2024-12-02 13:40:46,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208072372] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:40:46,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671316011] [2024-12-02 13:40:46,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:46,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:40:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:40:46,725 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:40:46,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 13:40:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:46,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-12-02 13:40:46,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:40:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 42 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:40:49,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:40:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 33 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:40:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671316011] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:40:58,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:40:58,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 28] total 75 [2024-12-02 13:40:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705863874] [2024-12-02 13:40:58,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:40:58,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-12-02 13:40:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:58,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-12-02 13:40:58,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=4979, Unknown=0, NotChecked=0, Total=5550 [2024-12-02 13:40:58,631 INFO L87 Difference]: Start difference. First operand 27368 states and 33225 transitions. Second operand has 75 states, 75 states have (on average 3.8933333333333335) internal successors, (292), 75 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:42:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:42:09,940 INFO L93 Difference]: Finished difference Result 78882 states and 95654 transitions. [2024-12-02 13:42:09,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2024-12-02 13:42:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.8933333333333335) internal successors, (292), 75 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-12-02 13:42:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:42:09,990 INFO L225 Difference]: With dead ends: 78882 [2024-12-02 13:42:09,991 INFO L226 Difference]: Without dead ends: 60794 [2024-12-02 13:42:10,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21422 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=9341, Invalid=50929, Unknown=0, NotChecked=0, Total=60270 [2024-12-02 13:42:10,006 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 3947 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 4375 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3947 SdHoareTripleChecker+Valid, 4184 SdHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:42:10,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3947 Valid, 4184 Invalid, 4578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4375 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-12-02 13:42:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60794 states. [2024-12-02 13:42:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60794 to 30124. [2024-12-02 13:42:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30124 states, 30123 states have (on average 1.2175414135378282) internal successors, (36676), 30123 states have internal predecessors, (36676), 0 states have call successors, (0), 0 states 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 13:42:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30124 states to 30124 states and 36676 transitions. [2024-12-02 13:42:14,379 INFO L78 Accepts]: Start accepts. Automaton has 30124 states and 36676 transitions. Word has length 107 [2024-12-02 13:42:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:42:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 30124 states and 36676 transitions. [2024-12-02 13:42:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.8933333333333335) internal successors, (292), 75 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:42:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30124 states and 36676 transitions. [2024-12-02 13:42:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 13:42:14,380 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:42:14,380 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:42:14,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-02 13:42:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:42:14,581 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:42:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:42:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash 190502898, now seen corresponding path program 1 times [2024-12-02 13:42:14,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:42:14,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432286482] [2024-12-02 13:42:14,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:42:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:42:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:42:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:42:16,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:42:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432286482] [2024-12-02 13:42:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432286482] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:42:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660683075] [2024-12-02 13:42:16,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:42:16,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:42:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:42:16,299 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:42:16,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 13:42:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:42:16,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 13:42:16,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:42:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:42:18,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:42:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:42:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660683075] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:42:21,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:42:21,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 19] total 60 [2024-12-02 13:42:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459283062] [2024-12-02 13:42:21,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:42:21,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 13:42:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:42:21,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 13:42:21,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=3279, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 13:42:21,197 INFO L87 Difference]: Start difference. First operand 30124 states and 36676 transitions. Second operand has 60 states, 60 states have (on average 4.95) internal successors, (297), 60 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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 13:42:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:42:41,415 INFO L93 Difference]: Finished difference Result 60070 states and 73055 transitions. [2024-12-02 13:42:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-02 13:42:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 4.95) internal successors, (297), 60 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-12-02 13:42:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:42:41,458 INFO L225 Difference]: With dead ends: 60070 [2024-12-02 13:42:41,458 INFO L226 Difference]: Without dead ends: 57149 [2024-12-02 13:42:41,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1821, Invalid=12699, Unknown=0, NotChecked=0, Total=14520 [2024-12-02 13:42:41,467 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1681 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:42:41,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 3754 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-12-02 13:42:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57149 states. [2024-12-02 13:42:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57149 to 30120. [2024-12-02 13:42:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30120 states, 30119 states have (on average 1.217537102825459) internal successors, (36671), 30119 states have internal predecessors, (36671), 0 states have call successors, (0), 0 states 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 13:42:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30120 states to 30120 states and 36671 transitions. [2024-12-02 13:42:45,976 INFO L78 Accepts]: Start accepts. Automaton has 30120 states and 36671 transitions. Word has length 107 [2024-12-02 13:42:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:42:45,976 INFO L471 AbstractCegarLoop]: Abstraction has 30120 states and 36671 transitions. [2024-12-02 13:42:45,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.95) internal successors, (297), 60 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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 13:42:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 30120 states and 36671 transitions. [2024-12-02 13:42:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-02 13:42:45,978 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:42:45,979 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 13:42:45,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-12-02 13:42:46,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:42:46,179 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:42:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:42:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1598187503, now seen corresponding path program 1 times [2024-12-02 13:42:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:42:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324940565] [2024-12-02 13:42:46,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:42:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:42:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:42:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 67 proven. 170 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 13:42:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:42:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324940565] [2024-12-02 13:42:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324940565] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:42:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749782727] [2024-12-02 13:42:47,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:42:47,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:42:47,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:42:47,091 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:42:47,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 13:42:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:42:47,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-02 13:42:47,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:42:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 71 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:42:48,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:42:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 68 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:42:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749782727] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:42:51,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:42:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 43 [2024-12-02 13:42:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754334784] [2024-12-02 13:42:51,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:42:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-02 13:42:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:42:51,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-02 13:42:51,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2024-12-02 13:42:51,509 INFO L87 Difference]: Start difference. First operand 30120 states and 36671 transitions. Second operand has 44 states, 44 states have (on average 8.227272727272727) internal successors, (362), 43 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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 13:43:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:43:01,455 INFO L93 Difference]: Finished difference Result 67435 states and 82272 transitions. [2024-12-02 13:43:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-12-02 13:43:01,455 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.227272727272727) internal successors, (362), 43 states have internal predecessors, (362), 0 states have call successors, (0), 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 144 [2024-12-02 13:43:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:43:01,485 INFO L225 Difference]: With dead ends: 67435 [2024-12-02 13:43:01,485 INFO L226 Difference]: Without dead ends: 41214 [2024-12-02 13:43:01,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2933 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2412, Invalid=9144, Unknown=0, NotChecked=0, Total=11556 [2024-12-02 13:43:01,497 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1208 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 13:43:01,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1383 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 13:43:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41214 states. [2024-12-02 13:43:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41214 to 24612. [2024-12-02 13:43:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24612 states, 24611 states have (on average 1.1983665840477835) internal successors, (29493), 24611 states have internal predecessors, (29493), 0 states have call successors, (0), 0 states 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 13:43:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24612 states to 24612 states and 29493 transitions. [2024-12-02 13:43:05,387 INFO L78 Accepts]: Start accepts. Automaton has 24612 states and 29493 transitions. Word has length 144 [2024-12-02 13:43:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:43:05,387 INFO L471 AbstractCegarLoop]: Abstraction has 24612 states and 29493 transitions. [2024-12-02 13:43:05,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 8.227272727272727) internal successors, (362), 43 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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 13:43:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24612 states and 29493 transitions. [2024-12-02 13:43:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 13:43:05,389 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:43:05,389 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:43:05,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-12-02 13:43:05,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:43:05,589 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:43:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:43:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1965529385, now seen corresponding path program 1 times [2024-12-02 13:43:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:43:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753807299] [2024-12-02 13:43:05,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:43:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:43:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:43:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 53 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:43:06,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:43:06,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753807299] [2024-12-02 13:43:06,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753807299] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:43:06,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840842035] [2024-12-02 13:43:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:43:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:43:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:43:06,621 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:43:06,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 13:43:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:43:06,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 13:43:06,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:43:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 81 proven. 138 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-02 13:43:07,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:43:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 53 proven. 166 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-02 13:43:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840842035] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:43:09,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:43:09,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 36 [2024-12-02 13:43:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444399820] [2024-12-02 13:43:09,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:43:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 13:43:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:43:09,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 13:43:09,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2024-12-02 13:43:09,907 INFO L87 Difference]: Start difference. First operand 24612 states and 29493 transitions. Second operand has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 36 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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 13:43:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:43:33,180 INFO L93 Difference]: Finished difference Result 135054 states and 163283 transitions. [2024-12-02 13:43:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-12-02 13:43:33,180 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 36 states have internal predecessors, (337), 0 states have call successors, (0), 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 145 [2024-12-02 13:43:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:43:33,273 INFO L225 Difference]: With dead ends: 135054 [2024-12-02 13:43:33,273 INFO L226 Difference]: Without dead ends: 113381 [2024-12-02 13:43:33,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6575 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3701, Invalid=17179, Unknown=0, NotChecked=0, Total=20880 [2024-12-02 13:43:33,292 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 3096 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:43:33,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 1606 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 13:43:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113381 states. [2024-12-02 13:43:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113381 to 33386. [2024-12-02 13:43:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33386 states, 33385 states have (on average 1.1884079676501422) internal successors, (39675), 33385 states have internal predecessors, (39675), 0 states have call successors, (0), 0 states 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 13:43:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33386 states to 33386 states and 39675 transitions. [2024-12-02 13:43:39,150 INFO L78 Accepts]: Start accepts. Automaton has 33386 states and 39675 transitions. Word has length 145 [2024-12-02 13:43:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:43:39,150 INFO L471 AbstractCegarLoop]: Abstraction has 33386 states and 39675 transitions. [2024-12-02 13:43:39,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 36 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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 13:43:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33386 states and 39675 transitions. [2024-12-02 13:43:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 13:43:39,152 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:43:39,152 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 13:43:39,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-12-02 13:43:39,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:43:39,353 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:43:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:43:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash -587582643, now seen corresponding path program 1 times [2024-12-02 13:43:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:43:39,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767580341] [2024-12-02 13:43:39,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:43:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:43:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:43:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 20 proven. 197 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 13:43:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:43:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767580341] [2024-12-02 13:43:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767580341] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:43:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568587272] [2024-12-02 13:43:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:43:39,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:43:39,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:43:39,476 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:43:39,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 13:43:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:43:39,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 13:43:39,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:43:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 199 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-02 13:43:39,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:43:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 132 proven. 94 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 13:43:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568587272] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:43:40,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:43:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 16 [2024-12-02 13:43:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25096043] [2024-12-02 13:43:40,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:43:40,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 13:43:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:43:40,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 13:43:40,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-12-02 13:43:40,246 INFO L87 Difference]: Start difference. First operand 33386 states and 39675 transitions. Second operand has 16 states, 16 states have (on average 18.25) internal successors, (292), 16 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:43:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:43:46,418 INFO L93 Difference]: Finished difference Result 88370 states and 108924 transitions. [2024-12-02 13:43:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 13:43:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.25) internal successors, (292), 16 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-12-02 13:43:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:43:46,466 INFO L225 Difference]: With dead ends: 88370 [2024-12-02 13:43:46,466 INFO L226 Difference]: Without dead ends: 55877 [2024-12-02 13:43:46,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-12-02 13:43:46,482 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 418 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:43:46,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1028 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:43:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55877 states. [2024-12-02 13:43:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55877 to 55869. [2024-12-02 13:43:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55869 states, 55868 states have (on average 1.1729612658409108) internal successors, (65531), 55868 states have internal predecessors, (65531), 0 states have call successors, (0), 0 states 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 13:43:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55869 states to 55869 states and 65531 transitions. [2024-12-02 13:43:53,538 INFO L78 Accepts]: Start accepts. Automaton has 55869 states and 65531 transitions. Word has length 146 [2024-12-02 13:43:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:43:53,538 INFO L471 AbstractCegarLoop]: Abstraction has 55869 states and 65531 transitions. [2024-12-02 13:43:53,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.25) internal successors, (292), 16 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:43:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 55869 states and 65531 transitions. [2024-12-02 13:43:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 13:43:53,540 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:43:53,540 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:43:53,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-02 13:43:53,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-12-02 13:43:53,741 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:43:53,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:43:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -674860223, now seen corresponding path program 1 times [2024-12-02 13:43:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:43:53,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901644775] [2024-12-02 13:43:53,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:43:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:43:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:43:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 13:43:55,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:43:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901644775] [2024-12-02 13:43:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901644775] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:43:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286621458] [2024-12-02 13:43:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:43:55,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:43:55,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:43:55,053 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:43:55,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 13:43:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:43:55,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 13:43:55,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:43:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 147 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-02 13:43:58,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:44:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 147 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-02 13:44:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286621458] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:44:01,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:44:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 20] total 63 [2024-12-02 13:44:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397828826] [2024-12-02 13:44:01,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:44:01,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-12-02 13:44:01,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:44:01,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-12-02 13:44:01,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3560, Unknown=0, NotChecked=0, Total=3906 [2024-12-02 13:44:01,521 INFO L87 Difference]: Start difference. First operand 55869 states and 65531 transitions. Second operand has 63 states, 63 states have (on average 4.904761904761905) internal successors, (309), 63 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:44:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:44:32,220 INFO L93 Difference]: Finished difference Result 83729 states and 98208 transitions. [2024-12-02 13:44:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-12-02 13:44:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.904761904761905) internal successors, (309), 63 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-12-02 13:44:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:44:32,275 INFO L225 Difference]: With dead ends: 83729 [2024-12-02 13:44:32,275 INFO L226 Difference]: Without dead ends: 60662 [2024-12-02 13:44:32,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6862 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=4513, Invalid=20927, Unknown=0, NotChecked=0, Total=25440 [2024-12-02 13:44:32,288 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3072 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3072 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:44:32,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3072 Valid, 2675 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 13:44:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60662 states. [2024-12-02 13:44:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60662 to 55660. [2024-12-02 13:44:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55660 states, 55659 states have (on average 1.1730537738730484) internal successors, (65291), 55659 states have internal predecessors, (65291), 0 states have call successors, (0), 0 states 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 13:44:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55660 states to 55660 states and 65291 transitions. [2024-12-02 13:44:39,502 INFO L78 Accepts]: Start accepts. Automaton has 55660 states and 65291 transitions. Word has length 146 [2024-12-02 13:44:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:44:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 55660 states and 65291 transitions. [2024-12-02 13:44:39,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.904761904761905) internal successors, (309), 63 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:44:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 55660 states and 65291 transitions. [2024-12-02 13:44:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 13:44:39,504 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:44:39,504 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:44:39,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-02 13:44:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 13:44:39,705 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:44:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:44:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -577034655, now seen corresponding path program 1 times [2024-12-02 13:44:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:44:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974863998] [2024-12-02 13:44:39,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:44:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:44:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:44:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 37 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:44:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:44:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974863998] [2024-12-02 13:44:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974863998] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:44:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417260880] [2024-12-02 13:44:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:44:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:44:40,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:44:40,642 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:44:40,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-02 13:44:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:44:40,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-12-02 13:44:40,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:44:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 13:44:44,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:44:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 13:44:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417260880] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:44:48,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:44:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 69 [2024-12-02 13:44:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750473125] [2024-12-02 13:44:48,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:44:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-12-02 13:44:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:44:48,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-12-02 13:44:48,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=4225, Unknown=0, NotChecked=0, Total=4692 [2024-12-02 13:44:48,800 INFO L87 Difference]: Start difference. First operand 55660 states and 65291 transitions. Second operand has 69 states, 69 states have (on average 5.072463768115942) internal successors, (350), 69 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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 13:45:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:45:15,387 INFO L93 Difference]: Finished difference Result 74714 states and 87408 transitions. [2024-12-02 13:45:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2024-12-02 13:45:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 5.072463768115942) internal successors, (350), 69 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-12-02 13:45:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:45:15,442 INFO L225 Difference]: With dead ends: 74714 [2024-12-02 13:45:15,442 INFO L226 Difference]: Without dead ends: 59810 [2024-12-02 13:45:15,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11814 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=7003, Invalid=31217, Unknown=0, NotChecked=0, Total=38220 [2024-12-02 13:45:15,456 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 2933 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2933 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 13:45:15,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2933 Valid, 1984 Invalid, 2645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 13:45:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59810 states. [2024-12-02 13:45:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59810 to 56180. [2024-12-02 13:45:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56180 states, 56179 states have (on average 1.1720037736520763) internal successors, (65842), 56179 states have internal predecessors, (65842), 0 states have call successors, (0), 0 states 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 13:45:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56180 states to 56180 states and 65842 transitions. [2024-12-02 13:45:22,645 INFO L78 Accepts]: Start accepts. Automaton has 56180 states and 65842 transitions. Word has length 146 [2024-12-02 13:45:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:45:22,646 INFO L471 AbstractCegarLoop]: Abstraction has 56180 states and 65842 transitions. [2024-12-02 13:45:22,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 5.072463768115942) internal successors, (350), 69 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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 13:45:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 56180 states and 65842 transitions. [2024-12-02 13:45:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 13:45:22,647 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:45:22,647 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 13:45:22,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-12-02 13:45:22,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-12-02 13:45:22,848 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:45:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:45:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1269619305, now seen corresponding path program 1 times [2024-12-02 13:45:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:45:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838784064] [2024-12-02 13:45:22,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:45:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:45:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:45:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 67 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:45:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:45:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838784064] [2024-12-02 13:45:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838784064] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:45:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933152804] [2024-12-02 13:45:24,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:45:24,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:45:24,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:45:24,073 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:45:24,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-12-02 13:45:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:45:24,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 13:45:24,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:45:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 57 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:45:25,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:45:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 47 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-02 13:45:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933152804] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:45:27,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:45:27,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18, 12] total 55 [2024-12-02 13:45:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262175373] [2024-12-02 13:45:27,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:45:27,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-12-02 13:45:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:45:27,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-12-02 13:45:27,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2774, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 13:45:27,277 INFO L87 Difference]: Start difference. First operand 56180 states and 65842 transitions. Second operand has 55 states, 55 states have (on average 7.163636363636364) internal successors, (394), 55 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 13:46:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:46:11,389 INFO L93 Difference]: Finished difference Result 117580 states and 138420 transitions. [2024-12-02 13:46:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2024-12-02 13:46:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.163636363636364) internal successors, (394), 55 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-12-02 13:46:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:46:11,447 INFO L225 Difference]: With dead ends: 117580 [2024-12-02 13:46:11,447 INFO L226 Difference]: Without dead ends: 68572 [2024-12-02 13:46:11,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21106 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=7837, Invalid=55919, Unknown=0, NotChecked=0, Total=63756 [2024-12-02 13:46:11,466 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 2579 mSDsluCounter, 3842 mSDsCounter, 0 mSdLazyCounter, 4720 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 4849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:46:11,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 3975 Invalid, 4849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4720 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-12-02 13:46:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68572 states. [2024-12-02 13:46:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68572 to 40310. [2024-12-02 13:46:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40310 states, 40309 states have (on average 1.1598402341908756) internal successors, (46752), 40309 states have internal predecessors, (46752), 0 states have call successors, (0), 0 states 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 13:46:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40310 states to 40310 states and 46752 transitions. [2024-12-02 13:46:17,582 INFO L78 Accepts]: Start accepts. Automaton has 40310 states and 46752 transitions. Word has length 147 [2024-12-02 13:46:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:46:17,582 INFO L471 AbstractCegarLoop]: Abstraction has 40310 states and 46752 transitions. [2024-12-02 13:46:17,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.163636363636364) internal successors, (394), 55 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 13:46:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 40310 states and 46752 transitions. [2024-12-02 13:46:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 13:46:17,583 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:46:17,584 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:46:17,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-12-02 13:46:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 13:46:17,784 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:46:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:46:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1256656655, now seen corresponding path program 1 times [2024-12-02 13:46:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:46:17,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324218345] [2024-12-02 13:46:17,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:46:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:46:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 13:46:17,829 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 13:46:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 13:46:17,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 13:46:17,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 13:46:17,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 13:46:17,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 13:46:17,927 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:46:18,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 13:46:18,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:46:18 BoogieIcfgContainer [2024-12-02 13:46:18,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 13:46:18,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 13:46:18,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 13:46:18,103 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 13:46:18,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:33:58" (3/4) ... [2024-12-02 13:46:18,106 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 13:46:18,281 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 152. [2024-12-02 13:46:18,401 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 13:46:18,402 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 13:46:18,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 13:46:18,403 INFO L158 Benchmark]: Toolchain (without parser) took 740460.59ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 116.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-12-02 13:46:18,403 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:46:18,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.70ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 103.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 13:46:18,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.11ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 101.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:46:18,404 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:46:18,404 INFO L158 Benchmark]: RCFGBuilder took 497.43ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 79.8MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:46:18,404 INFO L158 Benchmark]: TraceAbstraction took 739310.91ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 79.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-12-02 13:46:18,404 INFO L158 Benchmark]: Witness Printer took 299.44ms. Allocated memory is still 4.4GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 13:46:18,406 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.70ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 103.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.11ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 101.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 497.43ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 79.8MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 739310.91ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 79.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 299.44ms. Allocated memory is still 4.4GB. Free memory was 2.4GB in the beginning and 2.3GB 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: 287]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] port_t p2 ; [L38] char p2_old ; [L39] char p2_new ; [L40] char id2 ; [L41] char st2 ; [L42] msg_t send2 ; [L43] _Bool mode2 ; [L44] port_t p3 ; [L45] char p3_old ; [L46] char p3_new ; [L47] char id3 ; [L48] char st3 ; [L49] msg_t send3 ; [L50] _Bool mode3 ; VAL [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] [L235] int c1 ; [L236] int i2 ; [L239] c1 = 0 [L240] r1 = __VERIFIER_nondet_uchar() [L241] id1 = __VERIFIER_nondet_char() [L242] st1 = __VERIFIER_nondet_char() [L243] send1 = __VERIFIER_nondet_char() [L244] mode1 = __VERIFIER_nondet_bool() [L245] id2 = __VERIFIER_nondet_char() [L246] st2 = __VERIFIER_nondet_char() [L247] send2 = __VERIFIER_nondet_char() [L248] mode2 = __VERIFIER_nondet_bool() [L249] id3 = __VERIFIER_nondet_char() [L250] st3 = __VERIFIER_nondet_char() [L251] send3 = __VERIFIER_nondet_char() [L252] mode3 = __VERIFIER_nondet_bool() [L253] CALL, EXPR init() [L134] int tmp ; VAL [id1=5, id2=4, 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, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L137] COND TRUE (int )r1 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L138] COND TRUE (int )id1 >= 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L139] COND TRUE (int )st1 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE (int )send1 == (int )id1 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L141] COND TRUE (int )mode1 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L142] COND TRUE (int )id2 >= 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L143] COND TRUE (int )st2 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L144] COND TRUE (int )send2 == (int )id2 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L145] COND TRUE (int )mode2 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L146] COND TRUE (int )id3 >= 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L147] COND TRUE (int )st3 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L148] COND TRUE (int )send3 == (int )id3 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L149] COND TRUE (int )mode3 == 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L150] COND TRUE (int )id1 != (int )id2 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L151] COND TRUE (int )id1 != (int )id3 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L152] COND TRUE (int )id2 != (int )id3 [L153] tmp = 1 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0, tmp=1] [L202] return (tmp); VAL [\result=1, id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L253] RET, EXPR init() [L253] i2 = init() [L254] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L254] RET assume_abort_if_not(i2) [L255] p1_old = nomsg [L256] p1_new = nomsg [L257] p2_old = nomsg [L258] p2_new = nomsg [L259] p3_old = nomsg [L260] p3_new = nomsg [L261] i2 = 0 VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [id1=5, id2=4, 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=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); VAL [\result=1, id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L58] COND FALSE !(r1 == 255) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg VAL [id1=5, id2=4, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L64] COND TRUE (int )m1 != (int )nomsg VAL [id1=5, id2=4, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L65] COND FALSE !((int )m1 > (int )id1) VAL [id1=5, id2=4, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L74] mode1 = (_Bool)0 VAL [id1=5, id2=4, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg VAL [id1=5, id2=4, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg VAL [id1=5, id2=4, id3=0, m2=5, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L91] COND TRUE (int )m2 != (int )nomsg VAL [id1=5, id2=4, id3=0, m2=5, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 VAL [id1=5, id2=4, 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=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L99] mode2 = (_Bool)0 VAL [id1=5, id2=4, 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=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg VAL [id1=5, id2=4, 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=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg VAL [id1=5, id2=4, id3=0, m3=4, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L116] COND TRUE (int )m3 != (int )nomsg VAL [id1=5, id2=4, id3=0, m3=4, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L124] mode3 = (_Bool)0 VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); VAL [\result=1, id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [id1=5, id2=4, 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=5, send3=4, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); VAL [\result=1, id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L58] COND FALSE !(r1 == 255) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg VAL [id1=5, id2=4, id3=0, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L64] COND TRUE (int )m1 != (int )nomsg VAL [id1=5, id2=4, id3=0, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L65] COND FALSE !((int )m1 > (int )id1) VAL [id1=5, id2=4, id3=0, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L74] mode1 = (_Bool)0 VAL [id1=5, id2=4, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg VAL [id1=5, id2=4, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg VAL [id1=5, id2=4, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L91] COND TRUE (int )m2 != (int )nomsg VAL [id1=5, id2=4, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 > (int )id2) VAL [id1=5, id2=4, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L95] COND FALSE !((int )m2 == (int )id2) VAL [id1=5, id2=4, 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=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L99] mode2 = (_Bool)0 VAL [id1=5, id2=4, 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=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg VAL [id1=5, id2=4, 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=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg VAL [id1=5, id2=4, id3=0, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L116] COND TRUE (int )m3 != (int )nomsg VAL [id1=5, id2=4, id3=0, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L124] mode3 = (_Bool)0 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); VAL [\result=1, id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=5, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); VAL [\result=1, id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L58] COND FALSE !(r1 == 255) VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg VAL [id1=5, id2=4, id3=0, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L64] COND TRUE (int )m1 != (int )nomsg VAL [id1=5, id2=4, id3=0, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L65] COND FALSE !((int )m1 > (int )id1) VAL [id1=5, id2=4, id3=0, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 == (int )id1 [L69] st1 = (char)1 VAL [id1=5, id2=4, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L74] mode1 = (_Bool)0 VAL [id1=5, id2=4, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg VAL [id1=5, id2=4, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg VAL [id1=5, id2=4, id3=0, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L91] COND TRUE (int )m2 != (int )nomsg VAL [id1=5, id2=4, id3=0, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L92] COND FALSE !((int )m2 > (int )id2) VAL [id1=5, id2=4, id3=0, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L95] COND TRUE (int )m2 == (int )id2 [L96] st2 = (char)1 VAL [id1=5, id2=4, 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=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L99] mode2 = (_Bool)0 VAL [id1=5, id2=4, 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=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg VAL [id1=5, id2=4, 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=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg VAL [id1=5, id2=4, id3=0, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L116] COND TRUE (int )m3 != (int )nomsg VAL [id1=5, id2=4, id3=0, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L124] mode3 = (_Bool)0 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L210] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L228] tmp = 0 VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0, tmp=0] [L230] return (tmp); VAL [\result=0, id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND TRUE ! arg VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L287] reach_error() VAL [id1=5, id2=4, 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=4, send2=5, send3=5, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 739.1s, OverallIterations: 40, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 522.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54196 SdHoareTripleChecker+Valid, 45.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54196 mSDsluCounter, 59458 SdHoareTripleChecker+Invalid, 40.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55573 mSDsCounter, 2568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53562 IncrementalHoareTripleChecker+Invalid, 56130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2568 mSolverCounterUnsat, 3885 mSDtfsCounter, 53562 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7525 GetRequests, 4317 SyntacticMatches, 6 SemanticMatches, 3202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177232 ImplicationChecksByTransitivity, 425.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56180occurred in iteration=38, InterpolantAutomatonStates: 2233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 255634 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 140.9s InterpolantComputationTime, 5700 NumberOfCodeBlocks, 5700 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 7929 ConstructedInterpolants, 94 QuantifiedInterpolants, 177184 SizeOfPredicates, 170 NumberOfNonLiveVariables, 9579 ConjunctsInSsa, 763 ConjunctsInUnsatCore, 87 InterpolantComputations, 15 PerfectInterpolantSequences, 3075/7821 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 13:46:18,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6a5217c-8936-4a9d-8fd6-56c99155ddd9/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