./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/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_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/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_51f87574-01a5-4889-b00e-f50a16fcbcc9/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 d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:13:23,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:13:23,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 11:13:23,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:13:23,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:13:23,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:13:23,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:13:23,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:13:23,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:13:23,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:13:23,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:13:23,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:13:23,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:13:23,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:13:23,280 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:13:23,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:13:23,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:13:23,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:13:23,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:13:23,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:13:23,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:13:23,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:13:23,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:13:23,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:13:23,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:13:23,283 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_51f87574-01a5-4889-b00e-f50a16fcbcc9/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 -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2024-12-02 11:13:23,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:13:23,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:13:23,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:13:23,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:13:23,482 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:13:23,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-12-02 11:13:26,077 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/data/7a6c8bab6/340b4368cbfe494b9c6c58576b4a0e52/FLAGadcc05add [2024-12-02 11:13:26,279 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:13:26,279 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-12-02 11:13:26,288 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/data/7a6c8bab6/340b4368cbfe494b9c6c58576b4a0e52/FLAGadcc05add [2024-12-02 11:13:26,638 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/data/7a6c8bab6/340b4368cbfe494b9c6c58576b4a0e52 [2024-12-02 11:13:26,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:13:26,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:13:26,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:13:26,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:13:26,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:13:26,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ce8002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26, skipping insertion in model container [2024-12-02 11:13:26,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:13:26,825 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_51f87574-01a5-4889-b00e-f50a16fcbcc9/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2024-12-02 11:13:26,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:13:26,851 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:13:26,878 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_51f87574-01a5-4889-b00e-f50a16fcbcc9/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2024-12-02 11:13:26,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:13:26,901 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:13:26,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26 WrapperNode [2024-12-02 11:13:26,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:13:26,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:13:26,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:13:26,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:13:26,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,936 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 291 [2024-12-02 11:13:26,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:13:26,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:13:26,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:13:26,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:13:26,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,960 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 11:13:26,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:13:26,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:13:26,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:13:26,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:13:26,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (1/1) ... [2024-12-02 11:13:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:13:26,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:13:27,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:13:27,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:13:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:13:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:13:27,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:13:27,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:13:27,119 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:13:27,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:13:27,388 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-12-02 11:13:27,388 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:13:27,397 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:13:27,397 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 11:13:27,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:13:27 BoogieIcfgContainer [2024-12-02 11:13:27,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:13:27,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:13:27,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:13:27,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:13:27,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:13:26" (1/3) ... [2024-12-02 11:13:27,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fb16b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:13:27, skipping insertion in model container [2024-12-02 11:13:27,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:13:26" (2/3) ... [2024-12-02 11:13:27,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fb16b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:13:27, skipping insertion in model container [2024-12-02 11:13:27,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:13:27" (3/3) ... [2024-12-02 11:13:27,405 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-12-02 11:13:27,416 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:13:27,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 64 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 11:13:27,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:13:27,469 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;@3146b09b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:13:27,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:13:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 11:13:27,477 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:27,477 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 11:13:27,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash -976687966, now seen corresponding path program 1 times [2024-12-02 11:13:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089806952] [2024-12-02 11:13:27,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089806952] [2024-12-02 11:13:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089806952] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:27,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:13:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297824455] [2024-12-02 11:13:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:27,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:13:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:27,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:13:27,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:13:27,766 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 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 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:27,804 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2024-12-02 11:13:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:13:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-12-02 11:13:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:27,811 INFO L225 Difference]: With dead ends: 146 [2024-12-02 11:13:27,811 INFO L226 Difference]: Without dead ends: 95 [2024-12-02 11:13:27,814 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 11:13:27,816 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:27,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-12-02 11:13:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-12-02 11:13:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-12-02 11:13:27,847 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2024-12-02 11:13:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:27,848 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-12-02 11:13:27,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-12-02 11:13:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 11:13:27,849 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:27,849 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 11:13:27,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:13:27,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:27,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1572742836, now seen corresponding path program 1 times [2024-12-02 11:13:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:27,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507188289] [2024-12-02 11:13:27,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:27,961 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 11:13:27,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:27,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507188289] [2024-12-02 11:13:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507188289] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:27,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:13:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254054597] [2024-12-02 11:13:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:27,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:13:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:27,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:13:27,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:13:27,963 INFO L87 Difference]: Start difference. First operand 93 states and 136 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 11:13:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:27,991 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2024-12-02 11:13:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:13:27,992 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 11:13:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:27,993 INFO L225 Difference]: With dead ends: 225 [2024-12-02 11:13:27,993 INFO L226 Difference]: Without dead ends: 151 [2024-12-02 11:13:27,993 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 11:13:27,994 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:27,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-12-02 11:13:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-12-02 11:13:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2024-12-02 11:13:28,005 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 38 [2024-12-02 11:13:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:28,005 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2024-12-02 11:13:28,005 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 11:13:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2024-12-02 11:13:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 11:13:28,006 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:28,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:28,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:13:28,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1624580866, now seen corresponding path program 1 times [2024-12-02 11:13:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147675792] [2024-12-02 11:13:28,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:28,136 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 11:13:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147675792] [2024-12-02 11:13:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147675792] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:28,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:13:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031860609] [2024-12-02 11:13:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:28,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:28,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:28,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:28,138 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:28,281 INFO L93 Difference]: Finished difference Result 929 states and 1454 transitions. [2024-12-02 11:13:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:13:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-12-02 11:13:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:28,286 INFO L225 Difference]: With dead ends: 929 [2024-12-02 11:13:28,286 INFO L226 Difference]: Without dead ends: 799 [2024-12-02 11:13:28,287 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 11:13:28,288 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 410 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:28,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 575 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:13:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-12-02 11:13:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 277. [2024-12-02 11:13:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2024-12-02 11:13:28,313 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 39 [2024-12-02 11:13:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:28,314 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2024-12-02 11:13:28,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2024-12-02 11:13:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 11:13:28,315 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:28,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:28,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:13:28,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:28,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1224060410, now seen corresponding path program 1 times [2024-12-02 11:13:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:28,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38040628] [2024-12-02 11:13:28,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:28,387 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 11:13:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38040628] [2024-12-02 11:13:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38040628] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:13:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434923868] [2024-12-02 11:13:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:28,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:13:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:13:28,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:13:28,389 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:28,416 INFO L93 Difference]: Finished difference Result 749 states and 1146 transitions. [2024-12-02 11:13:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:13:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-12-02 11:13:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:28,419 INFO L225 Difference]: With dead ends: 749 [2024-12-02 11:13:28,419 INFO L226 Difference]: Without dead ends: 491 [2024-12-02 11:13:28,420 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 11:13:28,420 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 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 11:13:28,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-12-02 11:13:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2024-12-02 11:13:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 716 transitions. [2024-12-02 11:13:28,439 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 716 transitions. Word has length 41 [2024-12-02 11:13:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:28,439 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 716 transitions. [2024-12-02 11:13:28,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 716 transitions. [2024-12-02 11:13:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 11:13:28,440 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:28,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:28,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:13:28,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:28,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1245063065, now seen corresponding path program 1 times [2024-12-02 11:13:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:28,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473066808] [2024-12-02 11:13:28,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:28,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:28,610 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 11:13:28,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:28,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473066808] [2024-12-02 11:13:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473066808] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:28,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:28,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:13:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019845099] [2024-12-02 11:13:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:28,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:28,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:28,611 INFO L87 Difference]: Start difference. First operand 481 states and 716 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:28,685 INFO L93 Difference]: Finished difference Result 945 states and 1414 transitions. [2024-12-02 11:13:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:28,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-12-02 11:13:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:28,688 INFO L225 Difference]: With dead ends: 945 [2024-12-02 11:13:28,688 INFO L226 Difference]: Without dead ends: 483 [2024-12-02 11:13:28,688 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 11:13:28,689 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 266 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 11:13:28,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 266 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-12-02 11:13:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2024-12-02 11:13:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 708 transitions. [2024-12-02 11:13:28,703 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 708 transitions. Word has length 41 [2024-12-02 11:13:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:28,703 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 708 transitions. [2024-12-02 11:13:28,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 708 transitions. [2024-12-02 11:13:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 11:13:28,704 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:28,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:28,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:13:28,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:28,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash -59660072, now seen corresponding path program 1 times [2024-12-02 11:13:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425674023] [2024-12-02 11:13:28,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:28,797 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 11:13:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425674023] [2024-12-02 11:13:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425674023] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:28,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:13:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320809654] [2024-12-02 11:13:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:28,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:28,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:28,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:28,799 INFO L87 Difference]: Start difference. First operand 481 states and 708 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:28,906 INFO L93 Difference]: Finished difference Result 1201 states and 1794 transitions. [2024-12-02 11:13:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 11:13:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:28,909 INFO L225 Difference]: With dead ends: 1201 [2024-12-02 11:13:28,909 INFO L226 Difference]: Without dead ends: 739 [2024-12-02 11:13:28,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:13:28,910 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 353 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:28,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 93 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:13:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-12-02 11:13:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2024-12-02 11:13:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1088 transitions. [2024-12-02 11:13:28,931 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1088 transitions. Word has length 42 [2024-12-02 11:13:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1088 transitions. [2024-12-02 11:13:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1088 transitions. [2024-12-02 11:13:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 11:13:28,932 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:28,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:28,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:13:28,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash 68425235, now seen corresponding path program 1 times [2024-12-02 11:13:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128631955] [2024-12-02 11:13:28,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:29,024 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 11:13:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128631955] [2024-12-02 11:13:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128631955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:13:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598483496] [2024-12-02 11:13:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:29,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:29,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:29,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:29,026 INFO L87 Difference]: Start difference. First operand 737 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:29,096 INFO L93 Difference]: Finished difference Result 1455 states and 2157 transitions. [2024-12-02 11:13:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:29,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 11:13:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:29,100 INFO L225 Difference]: With dead ends: 1455 [2024-12-02 11:13:29,100 INFO L226 Difference]: Without dead ends: 737 [2024-12-02 11:13:29,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:13:29,101 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 209 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:29,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-12-02 11:13:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-12-02 11:13:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1076 transitions. [2024-12-02 11:13:29,127 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1076 transitions. Word has length 42 [2024-12-02 11:13:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1076 transitions. [2024-12-02 11:13:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1076 transitions. [2024-12-02 11:13:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 11:13:29,128 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:29,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:29,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:13:29,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 933957624, now seen corresponding path program 1 times [2024-12-02 11:13:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514549570] [2024-12-02 11:13:29,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:29,367 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 11:13:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514549570] [2024-12-02 11:13:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514549570] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:13:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554257229] [2024-12-02 11:13:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:29,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:29,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:29,368 INFO L87 Difference]: Start difference. First operand 737 states and 1076 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:29,394 INFO L93 Difference]: Finished difference Result 771 states and 1125 transitions. [2024-12-02 11:13:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 11:13:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:29,399 INFO L225 Difference]: With dead ends: 771 [2024-12-02 11:13:29,399 INFO L226 Difference]: Without dead ends: 769 [2024-12-02 11:13:29,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:13:29,399 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:29,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-12-02 11:13:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2024-12-02 11:13:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1104 transitions. [2024-12-02 11:13:29,411 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1104 transitions. Word has length 42 [2024-12-02 11:13:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:29,412 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1104 transitions. [2024-12-02 11:13:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1104 transitions. [2024-12-02 11:13:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 11:13:29,412 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:29,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:29,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:13:29,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash 883353381, now seen corresponding path program 1 times [2024-12-02 11:13:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677564147] [2024-12-02 11:13:29,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:29,449 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 11:13:29,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:29,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677564147] [2024-12-02 11:13:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677564147] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:29,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:13:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526231361] [2024-12-02 11:13:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:29,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:13:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:29,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:13:29,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:13:29,451 INFO L87 Difference]: Start difference. First operand 769 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:29,469 INFO L93 Difference]: Finished difference Result 1704 states and 2478 transitions. [2024-12-02 11:13:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:13:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 11:13:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:29,473 INFO L225 Difference]: With dead ends: 1704 [2024-12-02 11:13:29,473 INFO L226 Difference]: Without dead ends: 1157 [2024-12-02 11:13:29,474 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 11:13:29,474 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:29,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-12-02 11:13:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1155. [2024-12-02 11:13:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1650 transitions. [2024-12-02 11:13:29,489 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1650 transitions. Word has length 42 [2024-12-02 11:13:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:29,489 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1650 transitions. [2024-12-02 11:13:29,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1650 transitions. [2024-12-02 11:13:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 11:13:29,490 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:29,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:29,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:13:29,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:29,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1515661308, now seen corresponding path program 1 times [2024-12-02 11:13:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171735624] [2024-12-02 11:13:29,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 11:13:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171735624] [2024-12-02 11:13:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171735624] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:13:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033391276] [2024-12-02 11:13:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:29,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:29,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:29,580 INFO L87 Difference]: Start difference. First operand 1155 states and 1650 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 11:13:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:29,649 INFO L93 Difference]: Finished difference Result 4923 states and 7048 transitions. [2024-12-02 11:13:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:29,650 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 61 [2024-12-02 11:13:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:29,657 INFO L225 Difference]: With dead ends: 4923 [2024-12-02 11:13:29,657 INFO L226 Difference]: Without dead ends: 3789 [2024-12-02 11:13:29,659 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 11:13:29,659 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 229 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:29,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 339 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2024-12-02 11:13:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 2287. [2024-12-02 11:13:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 3258 transitions. [2024-12-02 11:13:29,698 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 3258 transitions. Word has length 61 [2024-12-02 11:13:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:29,698 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 3258 transitions. [2024-12-02 11:13:29,699 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 11:13:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 3258 transitions. [2024-12-02 11:13:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 11:13:29,700 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:29,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:29,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:13:29,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1625359882, now seen corresponding path program 1 times [2024-12-02 11:13:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101099767] [2024-12-02 11:13:29,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 11:13:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101099767] [2024-12-02 11:13:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101099767] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:13:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800322209] [2024-12-02 11:13:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:29,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:29,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:29,785 INFO L87 Difference]: Start difference. First operand 2287 states and 3258 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:29,866 INFO L93 Difference]: Finished difference Result 6055 states and 8656 transitions. [2024-12-02 11:13:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 11:13:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:29,876 INFO L225 Difference]: With dead ends: 6055 [2024-12-02 11:13:29,876 INFO L226 Difference]: Without dead ends: 4921 [2024-12-02 11:13:29,878 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 11:13:29,879 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 219 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:29,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 384 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2024-12-02 11:13:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 3987. [2024-12-02 11:13:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 5652 transitions. [2024-12-02 11:13:29,936 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 5652 transitions. Word has length 61 [2024-12-02 11:13:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:29,936 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 5652 transitions. [2024-12-02 11:13:29,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 5652 transitions. [2024-12-02 11:13:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 11:13:29,938 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:29,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:13:29,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2114297975, now seen corresponding path program 1 times [2024-12-02 11:13:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008257504] [2024-12-02 11:13:29,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 11:13:30,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008257504] [2024-12-02 11:13:30,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008257504] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:30,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:30,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:13:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269825423] [2024-12-02 11:13:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:13:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:30,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:13:30,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:13:30,016 INFO L87 Difference]: Start difference. First operand 3987 states and 5652 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:30,089 INFO L93 Difference]: Finished difference Result 6779 states and 9712 transitions. [2024-12-02 11:13:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:13:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 11:13:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:30,100 INFO L225 Difference]: With dead ends: 6779 [2024-12-02 11:13:30,100 INFO L226 Difference]: Without dead ends: 5849 [2024-12-02 11:13:30,102 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 11:13:30,102 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 215 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:30,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 348 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5849 states. [2024-12-02 11:13:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5849 to 4915. [2024-12-02 11:13:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4915 states, 4914 states have (on average 1.422059422059422) internal successors, (6988), 4914 states have internal predecessors, (6988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 6988 transitions. [2024-12-02 11:13:30,217 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 6988 transitions. Word has length 62 [2024-12-02 11:13:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:30,217 INFO L471 AbstractCegarLoop]: Abstraction has 4915 states and 6988 transitions. [2024-12-02 11:13:30,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 6988 transitions. [2024-12-02 11:13:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 11:13:30,219 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:30,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:30,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:13:30,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -344216809, now seen corresponding path program 1 times [2024-12-02 11:13:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758878205] [2024-12-02 11:13:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758878205] [2024-12-02 11:13:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758878205] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:30,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:30,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:13:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103264545] [2024-12-02 11:13:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:13:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:30,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:13:30,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:13:30,306 INFO L87 Difference]: Start difference. First operand 4915 states and 6988 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:30,351 INFO L93 Difference]: Finished difference Result 9121 states and 13033 transitions. [2024-12-02 11:13:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:13:30,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 11:13:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:30,363 INFO L225 Difference]: With dead ends: 9121 [2024-12-02 11:13:30,363 INFO L226 Difference]: Without dead ends: 4227 [2024-12-02 11:13:30,367 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 11:13:30,368 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:30,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2024-12-02 11:13:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4225. [2024-12-02 11:13:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4225 states, 4224 states have (on average 1.418560606060606) internal successors, (5992), 4224 states have internal predecessors, (5992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 5992 transitions. [2024-12-02 11:13:30,457 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 5992 transitions. Word has length 63 [2024-12-02 11:13:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:30,457 INFO L471 AbstractCegarLoop]: Abstraction has 4225 states and 5992 transitions. [2024-12-02 11:13:30,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 5992 transitions. [2024-12-02 11:13:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 11:13:30,458 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:30,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:30,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:13:30,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:30,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2058333971, now seen corresponding path program 1 times [2024-12-02 11:13:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466554536] [2024-12-02 11:13:30,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466554536] [2024-12-02 11:13:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466554536] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:13:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122527084] [2024-12-02 11:13:30,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:30,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:13:30,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:13:30,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:13:30,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:13:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:31,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 11:13:31,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:13:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:31,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:13:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122527084] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:13:32,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:13:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2024-12-02 11:13:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692889388] [2024-12-02 11:13:32,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:13:32,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 11:13:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:32,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 11:13:32,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-12-02 11:13:32,255 INFO L87 Difference]: Start difference. First operand 4225 states and 5992 transitions. Second operand has 28 states, 28 states have (on average 5.678571428571429) internal successors, (159), 27 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 11:13:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:33,063 INFO L93 Difference]: Finished difference Result 13058 states and 18371 transitions. [2024-12-02 11:13:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-12-02 11:13:33,064 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.678571428571429) internal successors, (159), 27 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 63 [2024-12-02 11:13:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:33,085 INFO L225 Difference]: With dead ends: 13058 [2024-12-02 11:13:33,085 INFO L226 Difference]: Without dead ends: 8880 [2024-12-02 11:13:33,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=523, Invalid=1829, Unknown=0, NotChecked=0, Total=2352 [2024-12-02 11:13:33,091 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1488 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:33,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 536 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:13:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2024-12-02 11:13:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 7146. [2024-12-02 11:13:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7146 states, 7145 states have (on average 1.4090972708187544) internal successors, (10068), 7145 states have internal predecessors, (10068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 10068 transitions. [2024-12-02 11:13:33,232 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 10068 transitions. Word has length 63 [2024-12-02 11:13:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:33,233 INFO L471 AbstractCegarLoop]: Abstraction has 7146 states and 10068 transitions. [2024-12-02 11:13:33,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.678571428571429) internal successors, (159), 27 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 11:13:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 10068 transitions. [2024-12-02 11:13:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:13:33,234 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:33,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:33,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-12-02 11:13:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-12-02 11:13:33,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -377166044, now seen corresponding path program 1 times [2024-12-02 11:13:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031161651] [2024-12-02 11:13:33,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031161651] [2024-12-02 11:13:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031161651] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:13:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:13:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:13:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888407061] [2024-12-02 11:13:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:13:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:13:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:33,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:13:33,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:13:33,533 INFO L87 Difference]: Start difference. First operand 7146 states and 10068 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:33,559 INFO L93 Difference]: Finished difference Result 11038 states and 15542 transitions. [2024-12-02 11:13:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:13:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-12-02 11:13:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:33,568 INFO L225 Difference]: With dead ends: 11038 [2024-12-02 11:13:33,568 INFO L226 Difference]: Without dead ends: 3962 [2024-12-02 11:13:33,573 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 11:13:33,574 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:33,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:13:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-12-02 11:13:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3960. [2024-12-02 11:13:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3959 states have (on average 1.374589542813842) internal successors, (5442), 3959 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5442 transitions. [2024-12-02 11:13:33,629 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5442 transitions. Word has length 64 [2024-12-02 11:13:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:33,630 INFO L471 AbstractCegarLoop]: Abstraction has 3960 states and 5442 transitions. [2024-12-02 11:13:33,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5442 transitions. [2024-12-02 11:13:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:13:33,631 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:33,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:33,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:13:33,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 794642143, now seen corresponding path program 1 times [2024-12-02 11:13:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286531349] [2024-12-02 11:13:33,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286531349] [2024-12-02 11:13:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286531349] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:13:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794038965] [2024-12-02 11:13:33,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:33,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:13:33,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:13:33,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:13:33,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:13:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:34,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 11:13:34,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:13:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:34,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:13:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:35,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794038965] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:13:35,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:13:35,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 11:13:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482331671] [2024-12-02 11:13:35,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:13:35,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 11:13:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:35,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 11:13:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-12-02 11:13:35,653 INFO L87 Difference]: Start difference. First operand 3960 states and 5442 transitions. Second operand has 32 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:49,218 INFO L93 Difference]: Finished difference Result 52489 states and 71692 transitions. [2024-12-02 11:13:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2024-12-02 11:13:49,218 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 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 11:13:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:49,277 INFO L225 Difference]: With dead ends: 52489 [2024-12-02 11:13:49,277 INFO L226 Difference]: Without dead ends: 48575 [2024-12-02 11:13:49,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34837 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=9372, Invalid=71000, Unknown=0, NotChecked=0, Total=80372 [2024-12-02 11:13:49,293 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 8217 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8217 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:49,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8217 Valid, 1899 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-12-02 11:13:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48575 states. [2024-12-02 11:13:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48575 to 8662. [2024-12-02 11:13:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8662 states, 8661 states have (on average 1.3673940653504215) internal successors, (11843), 8661 states have internal predecessors, (11843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 11843 transitions. [2024-12-02 11:13:49,604 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 11843 transitions. Word has length 64 [2024-12-02 11:13:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:49,604 INFO L471 AbstractCegarLoop]: Abstraction has 8662 states and 11843 transitions. [2024-12-02 11:13:49,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 11843 transitions. [2024-12-02 11:13:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:13:49,605 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:49,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:49,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 11:13:49,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 11:13:49,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:49,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -511261406, now seen corresponding path program 1 times [2024-12-02 11:13:49,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:49,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774352497] [2024-12-02 11:13:49,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774352497] [2024-12-02 11:13:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774352497] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:13:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256923472] [2024-12-02 11:13:50,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:13:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:13:50,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:13:50,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 11:13:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:50,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 11:13:50,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:13:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:50,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:13:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256923472] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:13:50,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:13:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2024-12-02 11:13:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807088760] [2024-12-02 11:13:50,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:13:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 11:13:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:13:50,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 11:13:50,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-12-02 11:13:50,640 INFO L87 Difference]: Start difference. First operand 8662 states and 11843 transitions. Second operand has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:13:53,407 INFO L93 Difference]: Finished difference Result 85222 states and 115987 transitions. [2024-12-02 11:13:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-12-02 11:13:53,408 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 11:13:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:13:53,468 INFO L225 Difference]: With dead ends: 85222 [2024-12-02 11:13:53,468 INFO L226 Difference]: Without dead ends: 75641 [2024-12-02 11:13:53,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3342 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1509, Invalid=7803, Unknown=0, NotChecked=0, Total=9312 [2024-12-02 11:13:53,486 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1605 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:13:53,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 1186 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 11:13:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75641 states. [2024-12-02 11:13:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75641 to 61982. [2024-12-02 11:13:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61982 states, 61981 states have (on average 1.3280198770590987) internal successors, (82312), 61981 states have internal predecessors, (82312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61982 states to 61982 states and 82312 transitions. [2024-12-02 11:13:54,222 INFO L78 Accepts]: Start accepts. Automaton has 61982 states and 82312 transitions. Word has length 65 [2024-12-02 11:13:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:13:54,222 INFO L471 AbstractCegarLoop]: Abstraction has 61982 states and 82312 transitions. [2024-12-02 11:13:54,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:13:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 61982 states and 82312 transitions. [2024-12-02 11:13:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:13:54,224 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:13:54,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:13:54,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 11:13:54,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 11:13:54,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:13:54,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:13:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 76199226, now seen corresponding path program 1 times [2024-12-02 11:13:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:13:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538155739] [2024-12-02 11:13:54,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:13:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:13:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538155739] [2024-12-02 11:13:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538155739] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:13:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122975475] [2024-12-02 11:13:54,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:13:54,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:13:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:13:54,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:13:54,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 11:13:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:13:55,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 11:13:55,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:13:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:13:58,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:14:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122975475] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:14:00,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:14:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 46 [2024-12-02 11:14:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272750008] [2024-12-02 11:14:00,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:14:00,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-12-02 11:14:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:00,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-12-02 11:14:00,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 11:14:00,297 INFO L87 Difference]: Start difference. First operand 61982 states and 82312 transitions. Second operand has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:32,905 INFO L93 Difference]: Finished difference Result 222327 states and 295622 transitions. [2024-12-02 11:14:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2024-12-02 11:14:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 11:14:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:33,045 INFO L225 Difference]: With dead ends: 222327 [2024-12-02 11:14:33,045 INFO L226 Difference]: Without dead ends: 182539 [2024-12-02 11:14:33,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31761 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=10256, Invalid=72400, Unknown=0, NotChecked=0, Total=82656 [2024-12-02 11:14:33,084 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 5024 mSDsluCounter, 4486 mSDsCounter, 0 mSdLazyCounter, 3486 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5024 SdHoareTripleChecker+Valid, 4653 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:33,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5024 Valid, 4653 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3486 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 11:14:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182539 states. [2024-12-02 11:14:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182539 to 113163. [2024-12-02 11:14:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113163 states, 113162 states have (on average 1.3350948198158392) internal successors, (151082), 113162 states have internal predecessors, (151082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113163 states to 113163 states and 151082 transitions. [2024-12-02 11:14:34,267 INFO L78 Accepts]: Start accepts. Automaton has 113163 states and 151082 transitions. Word has length 65 [2024-12-02 11:14:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:34,267 INFO L471 AbstractCegarLoop]: Abstraction has 113163 states and 151082 transitions. [2024-12-02 11:14:34,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 113163 states and 151082 transitions. [2024-12-02 11:14:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 11:14:34,269 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:34,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:14:34,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 11:14:34,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 11:14:34,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 200966917, now seen corresponding path program 1 times [2024-12-02 11:14:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577626072] [2024-12-02 11:14:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 11:14:34,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577626072] [2024-12-02 11:14:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577626072] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:14:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:14:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:14:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850950240] [2024-12-02 11:14:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:14:34,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:14:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:34,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:14:34,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:14:34,500 INFO L87 Difference]: Start difference. First operand 113163 states and 151082 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:34,819 INFO L93 Difference]: Finished difference Result 194845 states and 260260 transitions. [2024-12-02 11:14:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:14:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 66 [2024-12-02 11:14:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:34,889 INFO L225 Difference]: With dead ends: 194845 [2024-12-02 11:14:34,889 INFO L226 Difference]: Without dead ends: 83027 [2024-12-02 11:14:34,933 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 11:14:34,933 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 53 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:34,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 100 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:14:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83027 states. [2024-12-02 11:14:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83027 to 83027. [2024-12-02 11:14:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83027 states, 83026 states have (on average 1.321224676607328) internal successors, (109696), 83026 states have internal predecessors, (109696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83027 states to 83027 states and 109696 transitions. [2024-12-02 11:14:35,868 INFO L78 Accepts]: Start accepts. Automaton has 83027 states and 109696 transitions. Word has length 66 [2024-12-02 11:14:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:35,868 INFO L471 AbstractCegarLoop]: Abstraction has 83027 states and 109696 transitions. [2024-12-02 11:14:35,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 83027 states and 109696 transitions. [2024-12-02 11:14:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 11:14:35,870 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:35,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:14:35,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:14:35,870 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:35,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 852456662, now seen corresponding path program 1 times [2024-12-02 11:14:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:35,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114869894] [2024-12-02 11:14:35,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 11:14:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114869894] [2024-12-02 11:14:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114869894] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:14:35,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:14:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:14:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563724703] [2024-12-02 11:14:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:14:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:14:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:35,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:14:35,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:14:35,906 INFO L87 Difference]: Start difference. First operand 83027 states and 109696 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:36,419 INFO L93 Difference]: Finished difference Result 129902 states and 172392 transitions. [2024-12-02 11:14:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:14:36,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-12-02 11:14:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:36,450 INFO L225 Difference]: With dead ends: 129902 [2024-12-02 11:14:36,450 INFO L226 Difference]: Without dead ends: 46944 [2024-12-02 11:14:36,467 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 11:14:36,468 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:36,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:14:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46944 states. [2024-12-02 11:14:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46944 to 45641. [2024-12-02 11:14:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45641 states, 45640 states have (on average 1.3196538124452235) internal successors, (60229), 45640 states have internal predecessors, (60229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45641 states to 45641 states and 60229 transitions. [2024-12-02 11:14:36,799 INFO L78 Accepts]: Start accepts. Automaton has 45641 states and 60229 transitions. Word has length 67 [2024-12-02 11:14:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:36,800 INFO L471 AbstractCegarLoop]: Abstraction has 45641 states and 60229 transitions. [2024-12-02 11:14:36,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45641 states and 60229 transitions. [2024-12-02 11:14:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 11:14:36,800 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:36,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:14:36,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 11:14:36,800 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:36,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:36,801 INFO L85 PathProgramCache]: Analyzing trace with hash -765294079, now seen corresponding path program 1 times [2024-12-02 11:14:36,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:36,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068215767] [2024-12-02 11:14:36,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:36,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 11:14:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068215767] [2024-12-02 11:14:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068215767] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:14:36,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:14:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:14:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904953912] [2024-12-02 11:14:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:14:36,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:14:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:36,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:14:36,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:14:36,838 INFO L87 Difference]: Start difference. First operand 45641 states and 60229 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:37,156 INFO L93 Difference]: Finished difference Result 84033 states and 111063 transitions. [2024-12-02 11:14:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:14:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-12-02 11:14:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:37,203 INFO L225 Difference]: With dead ends: 84033 [2024-12-02 11:14:37,203 INFO L226 Difference]: Without dead ends: 38702 [2024-12-02 11:14:37,225 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 11:14:37,226 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 51 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:37,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:14:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38702 states. [2024-12-02 11:14:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38702 to 38702. [2024-12-02 11:14:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38702 states, 38701 states have (on average 1.3001214438903388) internal successors, (50316), 38701 states have internal predecessors, (50316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38702 states to 38702 states and 50316 transitions. [2024-12-02 11:14:37,666 INFO L78 Accepts]: Start accepts. Automaton has 38702 states and 50316 transitions. Word has length 67 [2024-12-02 11:14:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:37,666 INFO L471 AbstractCegarLoop]: Abstraction has 38702 states and 50316 transitions. [2024-12-02 11:14:37,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 38702 states and 50316 transitions. [2024-12-02 11:14:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-02 11:14:37,668 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:37,668 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2024-12-02 11:14:37,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 11:14:37,669 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1357881450, now seen corresponding path program 1 times [2024-12-02 11:14:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971697651] [2024-12-02 11:14:37,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:37,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:37,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971697651] [2024-12-02 11:14:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971697651] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:14:37,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543420982] [2024-12-02 11:14:37,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:37,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:14:37,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:14:37,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:14:37,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 11:14:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:37,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 11:14:37,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:14:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:38,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:14:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543420982] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:14:38,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:14:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 11:14:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097463056] [2024-12-02 11:14:38,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:14:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 11:14:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:38,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 11:14:38,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 11:14:38,239 INFO L87 Difference]: Start difference. First operand 38702 states and 50316 transitions. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:38,442 INFO L93 Difference]: Finished difference Result 66074 states and 86016 transitions. [2024-12-02 11:14:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:14:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 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 88 [2024-12-02 11:14:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:38,469 INFO L225 Difference]: With dead ends: 66074 [2024-12-02 11:14:38,469 INFO L226 Difference]: Without dead ends: 36726 [2024-12-02 11:14:38,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-12-02 11:14:38,485 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 163 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:38,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 266 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:14:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36726 states. [2024-12-02 11:14:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36726 to 36724. [2024-12-02 11:14:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36724 states, 36723 states have (on average 1.2775100073523404) internal successors, (46914), 36723 states have internal predecessors, (46914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36724 states to 36724 states and 46914 transitions. [2024-12-02 11:14:38,877 INFO L78 Accepts]: Start accepts. Automaton has 36724 states and 46914 transitions. Word has length 88 [2024-12-02 11:14:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:38,878 INFO L471 AbstractCegarLoop]: Abstraction has 36724 states and 46914 transitions. [2024-12-02 11:14:38,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36724 states and 46914 transitions. [2024-12-02 11:14:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 11:14:38,881 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:38,881 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:14:38,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 11:14:39,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:14:39,082 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -781261245, now seen corresponding path program 1 times [2024-12-02 11:14:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795641248] [2024-12-02 11:14:39,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-02 11:14:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:39,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795641248] [2024-12-02 11:14:39,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795641248] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:14:39,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:14:39,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:14:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690681211] [2024-12-02 11:14:39,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:14:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:14:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:39,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:14:39,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:14:39,209 INFO L87 Difference]: Start difference. First operand 36724 states and 46914 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:39,315 INFO L93 Difference]: Finished difference Result 51688 states and 66248 transitions. [2024-12-02 11:14:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:14:39,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-12-02 11:14:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:39,437 INFO L225 Difference]: With dead ends: 51688 [2024-12-02 11:14:39,437 INFO L226 Difference]: Without dead ends: 15504 [2024-12-02 11:14:39,442 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 11:14:39,442 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:39,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:14:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15504 states. [2024-12-02 11:14:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15504 to 15502. [2024-12-02 11:14:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15502 states, 15501 states have (on average 1.2661118637507258) internal successors, (19626), 15501 states have internal predecessors, (19626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15502 states to 15502 states and 19626 transitions. [2024-12-02 11:14:39,540 INFO L78 Accepts]: Start accepts. Automaton has 15502 states and 19626 transitions. Word has length 110 [2024-12-02 11:14:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 15502 states and 19626 transitions. [2024-12-02 11:14:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15502 states and 19626 transitions. [2024-12-02 11:14:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 11:14:39,541 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:39,541 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:14:39,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 11:14:39,541 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:39,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash -539067345, now seen corresponding path program 1 times [2024-12-02 11:14:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427013698] [2024-12-02 11:14:39,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427013698] [2024-12-02 11:14:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427013698] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:14:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857290272] [2024-12-02 11:14:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:39,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:14:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:14:39,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:14:39,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 11:14:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:40,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 11:14:40,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:14:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 40 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:40,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:14:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857290272] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:14:41,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:14:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-12-02 11:14:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417113020] [2024-12-02 11:14:41,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:14:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 11:14:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:41,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 11:14:41,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2024-12-02 11:14:41,829 INFO L87 Difference]: Start difference. First operand 15502 states and 19626 transitions. Second operand has 32 states, 32 states have (on average 9.3125) internal successors, (298), 31 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 11:14:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:14:43,655 INFO L93 Difference]: Finished difference Result 29000 states and 36647 transitions. [2024-12-02 11:14:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-12-02 11:14:43,655 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.3125) internal successors, (298), 31 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 110 [2024-12-02 11:14:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:14:43,663 INFO L225 Difference]: With dead ends: 29000 [2024-12-02 11:14:43,663 INFO L226 Difference]: Without dead ends: 13912 [2024-12-02 11:14:43,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=826, Invalid=3596, Unknown=0, NotChecked=0, Total=4422 [2024-12-02 11:14:43,669 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1122 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:14:43,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1050 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 11:14:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13912 states. [2024-12-02 11:14:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13912 to 11066. [2024-12-02 11:14:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11065 states have (on average 1.2129236330772706) internal successors, (13421), 11065 states have internal predecessors, (13421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:14:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 13421 transitions. [2024-12-02 11:14:43,778 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 13421 transitions. Word has length 110 [2024-12-02 11:14:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:14:43,778 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 13421 transitions. [2024-12-02 11:14:43,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.3125) internal successors, (298), 31 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 11:14:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 13421 transitions. [2024-12-02 11:14:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 11:14:43,779 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:14:43,779 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:14:43,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 11:14:43,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 11:14:43,980 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:14:43,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:14:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash -440818926, now seen corresponding path program 1 times [2024-12-02 11:14:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:14:43,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672085692] [2024-12-02 11:14:43,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:14:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:14:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672085692] [2024-12-02 11:14:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672085692] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:14:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722739691] [2024-12-02 11:14:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:14:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:14:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:14:44,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:14:44,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 11:14:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:14:44,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 11:14:44,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:14:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:47,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:14:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:14:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722739691] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:14:50,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:14:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24, 25] total 57 [2024-12-02 11:14:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846432522] [2024-12-02 11:14:50,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:14:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-12-02 11:14:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:14:50,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-12-02 11:14:50,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2972, Unknown=0, NotChecked=0, Total=3192 [2024-12-02 11:14:50,403 INFO L87 Difference]: Start difference. First operand 11066 states and 13421 transitions. Second operand has 57 states, 57 states have (on average 5.456140350877193) internal successors, (311), 57 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:15:26,787 INFO L93 Difference]: Finished difference Result 21980 states and 26886 transitions. [2024-12-02 11:15:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2024-12-02 11:15:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.456140350877193) internal successors, (311), 57 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-12-02 11:15:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:15:26,797 INFO L225 Difference]: With dead ends: 21980 [2024-12-02 11:15:26,797 INFO L226 Difference]: Without dead ends: 16084 [2024-12-02 11:15:26,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10645 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=4746, Invalid=33084, Unknown=0, NotChecked=0, Total=37830 [2024-12-02 11:15:26,802 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 3492 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 4663 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3492 SdHoareTripleChecker+Valid, 3790 SdHoareTripleChecker+Invalid, 4822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 4663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-12-02 11:15:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3492 Valid, 3790 Invalid, 4822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 4663 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-12-02 11:15:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2024-12-02 11:15:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 7926. [2024-12-02 11:15:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7926 states, 7925 states have (on average 1.2124921135646687) internal successors, (9609), 7925 states have internal predecessors, (9609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7926 states to 7926 states and 9609 transitions. [2024-12-02 11:15:26,874 INFO L78 Accepts]: Start accepts. Automaton has 7926 states and 9609 transitions. Word has length 110 [2024-12-02 11:15:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:15:26,875 INFO L471 AbstractCegarLoop]: Abstraction has 7926 states and 9609 transitions. [2024-12-02 11:15:26,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.456140350877193) internal successors, (311), 57 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7926 states and 9609 transitions. [2024-12-02 11:15:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 11:15:26,875 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:15:26,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:15:26,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 11:15:27,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 11:15:27,076 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:15:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:15:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1519903829, now seen corresponding path program 1 times [2024-12-02 11:15:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:15:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877567575] [2024-12-02 11:15:27,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:15:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 11:15:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:15:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877567575] [2024-12-02 11:15:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877567575] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:15:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:15:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:15:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478555878] [2024-12-02 11:15:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:15:27,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:15:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:15:27,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:15:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:15:27,120 INFO L87 Difference]: Start difference. First operand 7926 states and 9609 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:15:27,162 INFO L93 Difference]: Finished difference Result 12077 states and 14656 transitions. [2024-12-02 11:15:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:15:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-12-02 11:15:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:15:27,165 INFO L225 Difference]: With dead ends: 12077 [2024-12-02 11:15:27,165 INFO L226 Difference]: Without dead ends: 5582 [2024-12-02 11:15:27,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:15:27,167 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:15:27,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:15:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5582 states. [2024-12-02 11:15:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5582 to 5582. [2024-12-02 11:15:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5582 states, 5581 states have (on average 1.1983515499014514) internal successors, (6688), 5581 states have internal predecessors, (6688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 6688 transitions. [2024-12-02 11:15:27,209 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 6688 transitions. Word has length 111 [2024-12-02 11:15:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:15:27,210 INFO L471 AbstractCegarLoop]: Abstraction has 5582 states and 6688 transitions. [2024-12-02 11:15:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 6688 transitions. [2024-12-02 11:15:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 11:15:27,210 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:15:27,210 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:15:27,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 11:15:27,211 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:15:27,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:15:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1416160080, now seen corresponding path program 1 times [2024-12-02 11:15:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:15:27,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436033485] [2024-12-02 11:15:27,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:15:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:15:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436033485] [2024-12-02 11:15:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436033485] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:15:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939387653] [2024-12-02 11:15:27,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:15:27,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:15:27,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:15:27,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 11:15:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:27,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 11:15:27,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:15:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 47 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:29,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:15:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 47 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:29,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939387653] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:15:29,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:15:29,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 40 [2024-12-02 11:15:29,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676724527] [2024-12-02 11:15:29,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:15:29,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-02 11:15:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:15:29,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-02 11:15:29,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 11:15:29,748 INFO L87 Difference]: Start difference. First operand 5582 states and 6688 transitions. Second operand has 40 states, 40 states have (on average 7.65) internal successors, (306), 40 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:15:35,173 INFO L93 Difference]: Finished difference Result 11072 states and 13316 transitions. [2024-12-02 11:15:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-12-02 11:15:35,173 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.65) internal successors, (306), 40 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-12-02 11:15:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:15:35,176 INFO L225 Difference]: With dead ends: 11072 [2024-12-02 11:15:35,177 INFO L226 Difference]: Without dead ends: 6199 [2024-12-02 11:15:35,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1116, Invalid=7256, Unknown=0, NotChecked=0, Total=8372 [2024-12-02 11:15:35,179 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1468 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:15:35,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1969 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 11:15:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2024-12-02 11:15:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 2751. [2024-12-02 11:15:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2750 states have (on average 1.196) internal successors, (3289), 2750 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3289 transitions. [2024-12-02 11:15:35,204 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3289 transitions. Word has length 111 [2024-12-02 11:15:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:15:35,204 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3289 transitions. [2024-12-02 11:15:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.65) internal successors, (306), 40 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3289 transitions. [2024-12-02 11:15:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 11:15:35,205 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:15:35,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:15:35,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 11:15:35,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 11:15:35,406 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:15:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:15:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash -438881537, now seen corresponding path program 1 times [2024-12-02 11:15:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:15:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114043166] [2024-12-02 11:15:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:15:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:15:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114043166] [2024-12-02 11:15:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114043166] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:15:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331324382] [2024-12-02 11:15:36,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:36,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:15:36,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:15:36,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:15:36,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 11:15:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:36,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 11:15:36,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:15:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:36,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:15:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 41 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331324382] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:15:37,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:15:37,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2024-12-02 11:15:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821967230] [2024-12-02 11:15:37,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:15:37,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-12-02 11:15:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:15:37,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-12-02 11:15:37,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1504, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 11:15:37,794 INFO L87 Difference]: Start difference. First operand 2751 states and 3289 transitions. Second operand has 41 states, 41 states have (on average 7.560975609756097) internal successors, (310), 41 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:15:39,953 INFO L93 Difference]: Finished difference Result 8550 states and 10319 transitions. [2024-12-02 11:15:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-12-02 11:15:39,954 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.560975609756097) internal successors, (310), 41 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-12-02 11:15:39,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:15:39,956 INFO L225 Difference]: With dead ends: 8550 [2024-12-02 11:15:39,956 INFO L226 Difference]: Without dead ends: 6977 [2024-12-02 11:15:39,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=715, Invalid=5927, Unknown=0, NotChecked=0, Total=6642 [2024-12-02 11:15:39,957 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 664 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 11:15:39,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 3414 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 11:15:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2024-12-02 11:15:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 3750. [2024-12-02 11:15:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3750 states, 3749 states have (on average 1.1853827687383303) internal successors, (4444), 3749 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 4444 transitions. [2024-12-02 11:15:39,984 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 4444 transitions. Word has length 112 [2024-12-02 11:15:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:15:39,984 INFO L471 AbstractCegarLoop]: Abstraction has 3750 states and 4444 transitions. [2024-12-02 11:15:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.560975609756097) internal successors, (310), 41 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:15:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 4444 transitions. [2024-12-02 11:15:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 11:15:39,985 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:15:39,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:15:39,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 11:15:40,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:15:40,186 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:15:40,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:15:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1181769735, now seen corresponding path program 1 times [2024-12-02 11:15:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:15:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112962771] [2024-12-02 11:15:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:15:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:41,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:15:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112962771] [2024-12-02 11:15:41,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112962771] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:15:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904012650] [2024-12-02 11:15:41,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:15:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:15:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:15:41,398 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:15:41,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 11:15:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:15:41,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-12-02 11:15:41,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:15:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:44,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:15:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:15:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904012650] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:15:48,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:15:48,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 27] total 77 [2024-12-02 11:15:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913253286] [2024-12-02 11:15:48,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:15:48,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-12-02 11:15:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:15:48,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-12-02 11:15:48,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=5309, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 11:15:48,972 INFO L87 Difference]: Start difference. First operand 3750 states and 4444 transitions. Second operand has 77 states, 77 states have (on average 4.038961038961039) internal successors, (311), 77 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:16:34,205 INFO L93 Difference]: Finished difference Result 26291 states and 31089 transitions. [2024-12-02 11:16:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2024-12-02 11:16:34,205 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 4.038961038961039) internal successors, (311), 77 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-12-02 11:16:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:16:34,217 INFO L225 Difference]: With dead ends: 26291 [2024-12-02 11:16:34,217 INFO L226 Difference]: Without dead ends: 23192 [2024-12-02 11:16:34,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31343 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=10824, Invalid=73566, Unknown=0, NotChecked=0, Total=84390 [2024-12-02 11:16:34,223 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 3387 mSDsluCounter, 7093 mSDsCounter, 0 mSdLazyCounter, 4516 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3387 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:16:34,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3387 Valid, 7274 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4516 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 11:16:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2024-12-02 11:16:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 12031. [2024-12-02 11:16:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12031 states, 12030 states have (on average 1.1809642560266003) internal successors, (14207), 12030 states have internal predecessors, (14207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12031 states to 12031 states and 14207 transitions. [2024-12-02 11:16:34,336 INFO L78 Accepts]: Start accepts. Automaton has 12031 states and 14207 transitions. Word has length 112 [2024-12-02 11:16:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:16:34,336 INFO L471 AbstractCegarLoop]: Abstraction has 12031 states and 14207 transitions. [2024-12-02 11:16:34,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 4.038961038961039) internal successors, (311), 77 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12031 states and 14207 transitions. [2024-12-02 11:16:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 11:16:34,337 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:16:34,338 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:16:34,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 11:16:34,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 11:16:34,538 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:16:34,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:16:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1741119034, now seen corresponding path program 1 times [2024-12-02 11:16:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:16:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178840570] [2024-12-02 11:16:34,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:16:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:16:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:16:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178840570] [2024-12-02 11:16:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178840570] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:16:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631184883] [2024-12-02 11:16:34,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:34,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:16:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:16:34,984 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:16:34,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 11:16:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:16:35,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 11:16:35,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:16:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:36,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:16:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631184883] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:16:38,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:16:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2024-12-02 11:16:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724102432] [2024-12-02 11:16:38,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:16:38,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-12-02 11:16:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:16:38,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-12-02 11:16:38,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2063, Unknown=0, NotChecked=0, Total=2256 [2024-12-02 11:16:38,306 INFO L87 Difference]: Start difference. First operand 12031 states and 14207 transitions. Second operand has 48 states, 48 states have (on average 6.395833333333333) internal successors, (307), 48 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:16:40,257 INFO L93 Difference]: Finished difference Result 22381 states and 26539 transitions. [2024-12-02 11:16:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-12-02 11:16:40,258 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 6.395833333333333) internal successors, (307), 48 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-12-02 11:16:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:16:40,267 INFO L225 Difference]: With dead ends: 22381 [2024-12-02 11:16:40,267 INFO L226 Difference]: Without dead ends: 16238 [2024-12-02 11:16:40,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=664, Invalid=5498, Unknown=0, NotChecked=0, Total=6162 [2024-12-02 11:16:40,270 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 569 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 3910 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:16:40,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 3910 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 11:16:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16238 states. [2024-12-02 11:16:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16238 to 12990. [2024-12-02 11:16:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12990 states, 12989 states have (on average 1.179305566248364) internal successors, (15318), 12989 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12990 states to 12990 states and 15318 transitions. [2024-12-02 11:16:40,362 INFO L78 Accepts]: Start accepts. Automaton has 12990 states and 15318 transitions. Word has length 112 [2024-12-02 11:16:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:16:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 12990 states and 15318 transitions. [2024-12-02 11:16:40,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 6.395833333333333) internal successors, (307), 48 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 12990 states and 15318 transitions. [2024-12-02 11:16:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 11:16:40,363 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:16:40,363 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:16:40,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 11:16:40,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:16:40,563 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:16:40,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:16:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash -71600930, now seen corresponding path program 1 times [2024-12-02 11:16:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:16:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343581343] [2024-12-02 11:16:40,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:16:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:16:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:16:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343581343] [2024-12-02 11:16:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343581343] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:16:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152381268] [2024-12-02 11:16:41,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:41,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:16:41,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:16:41,076 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:16:41,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 11:16:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:16:41,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 11:16:41,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:16:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 11:16:42,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:16:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 11:16:43,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152381268] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:16:43,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:16:43,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 42 [2024-12-02 11:16:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152005129] [2024-12-02 11:16:43,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:16:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 11:16:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:16:43,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 11:16:43,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1582, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 11:16:43,071 INFO L87 Difference]: Start difference. First operand 12990 states and 15318 transitions. Second operand has 42 states, 42 states have (on average 7.214285714285714) internal successors, (303), 42 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:16:44,885 INFO L93 Difference]: Finished difference Result 26854 states and 31744 transitions. [2024-12-02 11:16:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-02 11:16:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.214285714285714) internal successors, (303), 42 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-12-02 11:16:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:16:44,894 INFO L225 Difference]: With dead ends: 26854 [2024-12-02 11:16:44,894 INFO L226 Difference]: Without dead ends: 15366 [2024-12-02 11:16:44,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=626, Invalid=4204, Unknown=0, NotChecked=0, Total=4830 [2024-12-02 11:16:44,898 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 498 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2587 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 11:16:44,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2587 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 11:16:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2024-12-02 11:16:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13984. [2024-12-02 11:16:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13984 states, 13983 states have (on average 1.1789315597511263) internal successors, (16485), 13983 states have internal predecessors, (16485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13984 states to 13984 states and 16485 transitions. [2024-12-02 11:16:44,996 INFO L78 Accepts]: Start accepts. Automaton has 13984 states and 16485 transitions. Word has length 113 [2024-12-02 11:16:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:16:44,996 INFO L471 AbstractCegarLoop]: Abstraction has 13984 states and 16485 transitions. [2024-12-02 11:16:44,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.214285714285714) internal successors, (303), 42 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 13984 states and 16485 transitions. [2024-12-02 11:16:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 11:16:44,997 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:16:44,997 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:16:45,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 11:16:45,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:16:45,198 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:16:45,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:16:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash 327569391, now seen corresponding path program 1 times [2024-12-02 11:16:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:16:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181163490] [2024-12-02 11:16:45,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:16:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:16:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:16:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181163490] [2024-12-02 11:16:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181163490] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:16:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236972052] [2024-12-02 11:16:46,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:16:46,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:16:46,085 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:16:46,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 11:16:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:16:46,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 11:16:46,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:16:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:48,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:16:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:16:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236972052] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:16:51,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:16:51,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 21] total 64 [2024-12-02 11:16:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182810468] [2024-12-02 11:16:51,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:16:51,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-12-02 11:16:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:16:51,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-12-02 11:16:51,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3781, Unknown=0, NotChecked=0, Total=4032 [2024-12-02 11:16:51,029 INFO L87 Difference]: Start difference. First operand 13984 states and 16485 transitions. Second operand has 64 states, 64 states have (on average 4.671875) internal successors, (299), 64 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:16:59,464 INFO L93 Difference]: Finished difference Result 23647 states and 28009 transitions. [2024-12-02 11:16:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-12-02 11:16:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.671875) internal successors, (299), 64 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-12-02 11:16:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:16:59,475 INFO L225 Difference]: With dead ends: 23647 [2024-12-02 11:16:59,475 INFO L226 Difference]: Without dead ends: 19869 [2024-12-02 11:16:59,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3566 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1578, Invalid=14424, Unknown=0, NotChecked=0, Total=16002 [2024-12-02 11:16:59,479 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 901 mSDsluCounter, 3728 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 3823 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 11:16:59,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 3823 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 11:16:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19869 states. [2024-12-02 11:16:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19869 to 13984. [2024-12-02 11:16:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13984 states, 13983 states have (on average 1.178788528927984) internal successors, (16483), 13983 states have internal predecessors, (16483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13984 states to 13984 states and 16483 transitions. [2024-12-02 11:16:59,585 INFO L78 Accepts]: Start accepts. Automaton has 13984 states and 16483 transitions. Word has length 113 [2024-12-02 11:16:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:16:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 13984 states and 16483 transitions. [2024-12-02 11:16:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.671875) internal successors, (299), 64 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:16:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 13984 states and 16483 transitions. [2024-12-02 11:16:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 11:16:59,586 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:16:59,586 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:16:59,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 11:16:59,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:16:59,787 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:16:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:16:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2137192752, now seen corresponding path program 1 times [2024-12-02 11:16:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:16:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978242839] [2024-12-02 11:16:59,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:16:59,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:16:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:17:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:17:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:17:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978242839] [2024-12-02 11:17:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978242839] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:17:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810355170] [2024-12-02 11:17:00,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:17:00,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:17:00,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:17:00,119 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:17:00,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 11:17:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:17:00,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 11:17:00,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:17:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:17:01,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:17:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 47 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:17:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810355170] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:17:02,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:17:02,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 13] total 34 [2024-12-02 11:17:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820665612] [2024-12-02 11:17:02,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:17:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 11:17:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:17:02,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 11:17:02,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 11:17:02,094 INFO L87 Difference]: Start difference. First operand 13984 states and 16483 transitions. Second operand has 34 states, 34 states have (on average 8.205882352941176) internal successors, (279), 34 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:17:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:17:02,773 INFO L93 Difference]: Finished difference Result 25469 states and 30153 transitions. [2024-12-02 11:17:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 11:17:02,774 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.205882352941176) internal successors, (279), 34 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-12-02 11:17:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:17:02,782 INFO L225 Difference]: With dead ends: 25469 [2024-12-02 11:17:02,782 INFO L226 Difference]: Without dead ends: 15587 [2024-12-02 11:17:02,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=1727, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 11:17:02,786 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 459 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:17:02,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 2031 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:17:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15587 states. [2024-12-02 11:17:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15587 to 14157. [2024-12-02 11:17:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 14156 states have (on average 1.1754732975416784) internal successors, (16640), 14156 states have internal predecessors, (16640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:17:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 16640 transitions. [2024-12-02 11:17:02,880 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 16640 transitions. Word has length 114 [2024-12-02 11:17:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:17:02,880 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 16640 transitions. [2024-12-02 11:17:02,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.205882352941176) internal successors, (279), 34 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:17:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 16640 transitions. [2024-12-02 11:17:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 11:17:02,881 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:17:02,881 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:17:02,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 11:17:03,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:17:03,082 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:17:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:17:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1476650435, now seen corresponding path program 1 times [2024-12-02 11:17:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:17:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096201802] [2024-12-02 11:17:03,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:17:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:17:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:17:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 19 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:17:04,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:17:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096201802] [2024-12-02 11:17:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096201802] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:17:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119348657] [2024-12-02 11:17:04,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:17:04,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:17:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:17:04,275 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:17:04,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 11:17:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:17:04,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-02 11:17:04,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:17:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 29 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:17:07,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:17:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 19 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:17:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119348657] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:17:11,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:17:11,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 27] total 73 [2024-12-02 11:17:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544363036] [2024-12-02 11:17:11,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:17:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-12-02 11:17:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:17:11,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-12-02 11:17:11,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=4907, Unknown=0, NotChecked=0, Total=5256 [2024-12-02 11:17:11,321 INFO L87 Difference]: Start difference. First operand 14157 states and 16640 transitions. Second operand has 73 states, 73 states have (on average 4.438356164383562) internal successors, (324), 73 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:18:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:18:33,741 INFO L93 Difference]: Finished difference Result 35544 states and 42076 transitions. [2024-12-02 11:18:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2024-12-02 11:18:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.438356164383562) internal successors, (324), 73 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-12-02 11:18:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:18:33,756 INFO L225 Difference]: With dead ends: 35544 [2024-12-02 11:18:33,756 INFO L226 Difference]: Without dead ends: 25313 [2024-12-02 11:18:33,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27409 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=10376, Invalid=70564, Unknown=0, NotChecked=0, Total=80940 [2024-12-02 11:18:33,764 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 4369 mSDsluCounter, 3526 mSDsCounter, 0 mSdLazyCounter, 5190 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 5373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 5190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:18:33,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 3612 Invalid, 5373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 5190 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-12-02 11:18:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25313 states. [2024-12-02 11:18:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25313 to 16913. [2024-12-02 11:18:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16913 states, 16912 states have (on average 1.1786305581835383) internal successors, (19933), 16912 states have internal predecessors, (19933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:18:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16913 states to 16913 states and 19933 transitions. [2024-12-02 11:18:33,899 INFO L78 Accepts]: Start accepts. Automaton has 16913 states and 19933 transitions. Word has length 114 [2024-12-02 11:18:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:18:33,899 INFO L471 AbstractCegarLoop]: Abstraction has 16913 states and 19933 transitions. [2024-12-02 11:18:33,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.438356164383562) internal successors, (324), 73 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:18:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 16913 states and 19933 transitions. [2024-12-02 11:18:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 11:18:33,900 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:18:33,900 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:18:33,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-12-02 11:18:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-12-02 11:18:34,100 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:18:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:18:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash 120260766, now seen corresponding path program 1 times [2024-12-02 11:18:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:18:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908175358] [2024-12-02 11:18:34,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:18:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:18:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:18:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:18:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:18:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908175358] [2024-12-02 11:18:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908175358] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:18:34,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534379228] [2024-12-02 11:18:34,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:18:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:18:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:18:34,610 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:18:34,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 11:18:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:18:34,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 11:18:34,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:18:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:18:37,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:18:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:18:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534379228] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:18:41,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:18:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 23] total 62 [2024-12-02 11:18:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938603329] [2024-12-02 11:18:41,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:18:41,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-02 11:18:41,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:18:41,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-02 11:18:41,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3554, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 11:18:41,618 INFO L87 Difference]: Start difference. First operand 16913 states and 19933 transitions. Second operand has 62 states, 62 states have (on average 5.064516129032258) internal successors, (314), 62 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:19:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:40,339 INFO L93 Difference]: Finished difference Result 40449 states and 47860 transitions. [2024-12-02 11:19:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2024-12-02 11:19:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 5.064516129032258) internal successors, (314), 62 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-12-02 11:19:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:40,356 INFO L225 Difference]: With dead ends: 40449 [2024-12-02 11:19:40,356 INFO L226 Difference]: Without dead ends: 30783 [2024-12-02 11:19:40,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27044 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=10135, Invalid=66871, Unknown=0, NotChecked=0, Total=77006 [2024-12-02 11:19:40,363 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 6833 mSDsluCounter, 4919 mSDsCounter, 0 mSdLazyCounter, 5466 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6833 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 5667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 5466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:40,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6833 Valid, 5090 Invalid, 5667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 5466 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-12-02 11:19:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30783 states. [2024-12-02 11:19:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30783 to 18422. [2024-12-02 11:19:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18422 states, 18421 states have (on average 1.1799033711524891) internal successors, (21735), 18421 states have internal predecessors, (21735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:19:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18422 states to 18422 states and 21735 transitions. [2024-12-02 11:19:40,519 INFO L78 Accepts]: Start accepts. Automaton has 18422 states and 21735 transitions. Word has length 114 [2024-12-02 11:19:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:40,519 INFO L471 AbstractCegarLoop]: Abstraction has 18422 states and 21735 transitions. [2024-12-02 11:19:40,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 5.064516129032258) internal successors, (314), 62 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:19:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18422 states and 21735 transitions. [2024-12-02 11:19:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 11:19:40,520 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:40,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:19:40,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-12-02 11:19:40,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-12-02 11:19:40,721 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:40,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash 98993860, now seen corresponding path program 1 times [2024-12-02 11:19:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967185644] [2024-12-02 11:19:40,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:19:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967185644] [2024-12-02 11:19:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967185644] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:19:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401690659] [2024-12-02 11:19:41,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:41,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:19:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:19:41,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:19:41,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 11:19:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:41,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-12-02 11:19:41,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:19:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:19:45,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:19:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:19:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401690659] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:19:50,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:19:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31, 33] total 85 [2024-12-02 11:19:50,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389560156] [2024-12-02 11:19:50,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:19:50,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-12-02 11:19:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:50,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-12-02 11:19:50,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=6516, Unknown=0, NotChecked=0, Total=7140 [2024-12-02 11:19:50,272 INFO L87 Difference]: Start difference. First operand 18422 states and 21735 transitions. Second operand has 85 states, 85 states have (on average 3.8) internal successors, (323), 85 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:50,672 INFO L93 Difference]: Finished difference Result 42045 states and 49419 transitions. [2024-12-02 11:21:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 322 states. [2024-12-02 11:21:50,672 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.8) internal successors, (323), 85 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-12-02 11:21:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:50,693 INFO L225 Difference]: With dead ends: 42045 [2024-12-02 11:21:50,693 INFO L226 Difference]: Without dead ends: 35993 [2024-12-02 11:21:50,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64616 ImplicationChecksByTransitivity, 118.9s TimeCoverageRelationStatistics Valid=24835, Invalid=138785, Unknown=0, NotChecked=0, Total=163620 [2024-12-02 11:21:50,703 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 5154 mSDsluCounter, 5843 mSDsCounter, 0 mSdLazyCounter, 6501 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5154 SdHoareTripleChecker+Valid, 5979 SdHoareTripleChecker+Invalid, 6693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 6501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:50,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5154 Valid, 5979 Invalid, 6693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 6501 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-12-02 11:21:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2024-12-02 11:21:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 23349. [2024-12-02 11:21:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23349 states, 23348 states have (on average 1.1746188110330649) internal successors, (27425), 23348 states have internal predecessors, (27425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23349 states to 23349 states and 27425 transitions. [2024-12-02 11:21:50,915 INFO L78 Accepts]: Start accepts. Automaton has 23349 states and 27425 transitions. Word has length 114 [2024-12-02 11:21:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:50,915 INFO L471 AbstractCegarLoop]: Abstraction has 23349 states and 27425 transitions. [2024-12-02 11:21:50,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.8) internal successors, (323), 85 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23349 states and 27425 transitions. [2024-12-02 11:21:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 11:21:50,916 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:50,916 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:21:50,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-02 11:21:51,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:21:51,117 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:51,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1536865183, now seen corresponding path program 1 times [2024-12-02 11:21:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13422327] [2024-12-02 11:21:51,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 29 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:21:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13422327] [2024-12-02 11:21:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13422327] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:21:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659931445] [2024-12-02 11:21:52,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:52,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:21:52,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:21:52,397 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:21:52,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 11:21:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:52,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 11:21:52,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:21:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 20 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:21:56,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:22:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 19 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:22:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659931445] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:22:04,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:22:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35, 35] total 94 [2024-12-02 11:22:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277489402] [2024-12-02 11:22:04,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:22:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-12-02 11:22:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-12-02 11:22:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=8129, Unknown=0, NotChecked=0, Total=8742 [2024-12-02 11:22:04,199 INFO L87 Difference]: Start difference. First operand 23349 states and 27425 transitions. Second operand has 94 states, 94 states have (on average 3.5106382978723403) internal successors, (330), 94 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:23:11,948 INFO L93 Difference]: Finished difference Result 45601 states and 53676 transitions. [2024-12-02 11:23:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2024-12-02 11:23:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 3.5106382978723403) internal successors, (330), 94 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-12-02 11:23:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:23:11,966 INFO L225 Difference]: With dead ends: 45601 [2024-12-02 11:23:11,966 INFO L226 Difference]: Without dead ends: 31996 [2024-12-02 11:23:11,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24931 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=10447, Invalid=63265, Unknown=0, NotChecked=0, Total=73712 [2024-12-02 11:23:11,975 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 3328 mSDsluCounter, 6909 mSDsCounter, 0 mSdLazyCounter, 6921 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3328 SdHoareTripleChecker+Valid, 7042 SdHoareTripleChecker+Invalid, 7084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 6921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:23:11,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3328 Valid, 7042 Invalid, 7084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 6921 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-12-02 11:23:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31996 states. [2024-12-02 11:23:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31996 to 19871. [2024-12-02 11:23:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19871 states, 19870 states have (on average 1.178510317060896) internal successors, (23417), 19870 states have internal predecessors, (23417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19871 states to 19871 states and 23417 transitions. [2024-12-02 11:23:12,145 INFO L78 Accepts]: Start accepts. Automaton has 19871 states and 23417 transitions. Word has length 116 [2024-12-02 11:23:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:23:12,146 INFO L471 AbstractCegarLoop]: Abstraction has 19871 states and 23417 transitions. [2024-12-02 11:23:12,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 3.5106382978723403) internal successors, (330), 94 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 19871 states and 23417 transitions. [2024-12-02 11:23:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 11:23:12,147 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:23:12,148 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:23:12,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-12-02 11:23:12,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 11:23:12,348 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:23:12,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:23:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1432873705, now seen corresponding path program 1 times [2024-12-02 11:23:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:23:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480469365] [2024-12-02 11:23:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:23:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 11:23:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:23:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480469365] [2024-12-02 11:23:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480469365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:23:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:23:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:23:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722847358] [2024-12-02 11:23:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:23:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:23:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:23:12,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:23:12,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:23:12,389 INFO L87 Difference]: Start difference. First operand 19871 states and 23417 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:23:12,442 INFO L93 Difference]: Finished difference Result 38264 states and 45344 transitions. [2024-12-02 11:23:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:23:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 156 [2024-12-02 11:23:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:23:12,452 INFO L225 Difference]: With dead ends: 38264 [2024-12-02 11:23:12,453 INFO L226 Difference]: Without dead ends: 18599 [2024-12-02 11:23:12,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 11:23:12,460 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:23:12,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:23:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18599 states. [2024-12-02 11:23:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18599 to 17702. [2024-12-02 11:23:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17702 states, 17701 states have (on average 1.1519688153211682) internal successors, (20391), 17701 states have internal predecessors, (20391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17702 states to 17702 states and 20391 transitions. [2024-12-02 11:23:12,588 INFO L78 Accepts]: Start accepts. Automaton has 17702 states and 20391 transitions. Word has length 156 [2024-12-02 11:23:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:23:12,589 INFO L471 AbstractCegarLoop]: Abstraction has 17702 states and 20391 transitions. [2024-12-02 11:23:12,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states and 20391 transitions. [2024-12-02 11:23:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 11:23:12,590 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:23:12,590 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-12-02 11:23:12,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 11:23:12,591 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:23:12,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:23:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -894974335, now seen corresponding path program 1 times [2024-12-02 11:23:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:23:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868552344] [2024-12-02 11:23:12,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:23:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 22 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:23:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:23:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868552344] [2024-12-02 11:23:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868552344] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:23:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559823897] [2024-12-02 11:23:13,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:13,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:23:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:23:13,305 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:23:13,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 11:23:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:13,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-12-02 11:23:13,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:23:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 56 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:23:17,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:23:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 59 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:23:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559823897] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:23:22,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:23:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 35, 34] total 84 [2024-12-02 11:23:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144819853] [2024-12-02 11:23:22,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:23:22,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-12-02 11:23:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:23:22,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-12-02 11:23:22,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=6117, Unknown=0, NotChecked=0, Total=6972 [2024-12-02 11:23:22,778 INFO L87 Difference]: Start difference. First operand 17702 states and 20391 transitions. Second operand has 84 states, 84 states have (on average 5.345238095238095) internal successors, (449), 84 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:23:38,888 INFO L93 Difference]: Finished difference Result 32413 states and 37357 transitions. [2024-12-02 11:23:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-12-02 11:23:38,888 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 5.345238095238095) internal successors, (449), 84 states have internal predecessors, (449), 0 states have call successors, (0), 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 158 [2024-12-02 11:23:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:23:38,900 INFO L225 Difference]: With dead ends: 32413 [2024-12-02 11:23:38,900 INFO L226 Difference]: Without dead ends: 21199 [2024-12-02 11:23:38,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12734 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=5426, Invalid=39730, Unknown=0, NotChecked=0, Total=45156 [2024-12-02 11:23:38,908 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1774 mSDsluCounter, 5638 mSDsCounter, 0 mSdLazyCounter, 4138 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 5774 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:23:38,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 5774 Invalid, 4212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4138 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-02 11:23:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21199 states. [2024-12-02 11:23:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21199 to 15493. [2024-12-02 11:23:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15493 states, 15492 states have (on average 1.145688097082365) internal successors, (17749), 15492 states have internal predecessors, (17749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15493 states to 15493 states and 17749 transitions. [2024-12-02 11:23:39,027 INFO L78 Accepts]: Start accepts. Automaton has 15493 states and 17749 transitions. Word has length 158 [2024-12-02 11:23:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:23:39,027 INFO L471 AbstractCegarLoop]: Abstraction has 15493 states and 17749 transitions. [2024-12-02 11:23:39,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 5.345238095238095) internal successors, (449), 84 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15493 states and 17749 transitions. [2024-12-02 11:23:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-02 11:23:39,029 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:23:39,029 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-12-02 11:23:39,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-12-02 11:23:39,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 11:23:39,230 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:23:39,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:23:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1943778621, now seen corresponding path program 1 times [2024-12-02 11:23:39,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:23:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112426240] [2024-12-02 11:23:39,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:23:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 40 proven. 170 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-02 11:23:40,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:23:40,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112426240] [2024-12-02 11:23:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112426240] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:23:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570952605] [2024-12-02 11:23:40,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:23:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:23:40,085 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:23:40,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 11:23:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 11:23:40,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:23:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 66 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:23:41,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:23:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 84 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:23:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570952605] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:23:44,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:23:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 20] total 59 [2024-12-02 11:23:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53981286] [2024-12-02 11:23:44,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:23:44,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-02 11:23:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:23:44,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-02 11:23:44,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3212, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 11:23:44,081 INFO L87 Difference]: Start difference. First operand 15493 states and 17749 transitions. Second operand has 59 states, 59 states have (on average 7.203389830508475) internal successors, (425), 59 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:23:58,047 INFO L93 Difference]: Finished difference Result 32380 states and 37318 transitions. [2024-12-02 11:23:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-12-02 11:23:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 7.203389830508475) internal successors, (425), 59 states have internal predecessors, (425), 0 states have call successors, (0), 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 159 [2024-12-02 11:23:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:23:58,059 INFO L225 Difference]: With dead ends: 32380 [2024-12-02 11:23:58,059 INFO L226 Difference]: Without dead ends: 20463 [2024-12-02 11:23:58,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8590 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3499, Invalid=29443, Unknown=0, NotChecked=0, Total=32942 [2024-12-02 11:23:58,065 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1708 mSDsluCounter, 6072 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 6244 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:23:58,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 6244 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 11:23:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20463 states. [2024-12-02 11:23:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20463 to 16690. [2024-12-02 11:23:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16690 states, 16689 states have (on average 1.1487207142429146) internal successors, (19171), 16689 states have internal predecessors, (19171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16690 states to 16690 states and 19171 transitions. [2024-12-02 11:23:58,186 INFO L78 Accepts]: Start accepts. Automaton has 16690 states and 19171 transitions. Word has length 159 [2024-12-02 11:23:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:23:58,186 INFO L471 AbstractCegarLoop]: Abstraction has 16690 states and 19171 transitions. [2024-12-02 11:23:58,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 7.203389830508475) internal successors, (425), 59 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 16690 states and 19171 transitions. [2024-12-02 11:23:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:23:58,187 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:23:58,187 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 11:23:58,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-12-02 11:23:58,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 11:23:58,388 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:23:58,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:23:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 578060408, now seen corresponding path program 1 times [2024-12-02 11:23:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:23:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115575836] [2024-12-02 11:23:58,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:58,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:23:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-02 11:23:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:23:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115575836] [2024-12-02 11:23:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115575836] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:23:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942334852] [2024-12-02 11:23:58,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:58,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:23:58,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:23:58,523 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:23:58,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 11:23:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:58,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 11:23:58,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:23:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-02 11:23:58,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:23:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-02 11:23:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942334852] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:23:59,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:23:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2024-12-02 11:23:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212653388] [2024-12-02 11:23:59,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:23:59,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 11:23:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:23:59,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 11:23:59,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:23:59,114 INFO L87 Difference]: Start difference. First operand 16690 states and 19171 transitions. Second operand has 12 states, 12 states have (on average 26.0) internal successors, (312), 12 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:23:59,302 INFO L93 Difference]: Finished difference Result 54998 states and 63674 transitions. [2024-12-02 11:23:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 11:23:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.0) internal successors, (312), 12 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-12-02 11:23:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:23:59,326 INFO L225 Difference]: With dead ends: 54998 [2024-12-02 11:23:59,326 INFO L226 Difference]: Without dead ends: 38872 [2024-12-02 11:23:59,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-12-02 11:23:59,334 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 347 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:23:59,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1001 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:23:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38872 states. [2024-12-02 11:23:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38872 to 37164. [2024-12-02 11:23:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37164 states, 37163 states have (on average 1.1277883916798968) internal successors, (41912), 37163 states have internal predecessors, (41912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37164 states to 37164 states and 41912 transitions. [2024-12-02 11:23:59,602 INFO L78 Accepts]: Start accepts. Automaton has 37164 states and 41912 transitions. Word has length 160 [2024-12-02 11:23:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:23:59,602 INFO L471 AbstractCegarLoop]: Abstraction has 37164 states and 41912 transitions. [2024-12-02 11:23:59,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.0) internal successors, (312), 12 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 37164 states and 41912 transitions. [2024-12-02 11:23:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:23:59,603 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:23:59,603 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 11:23:59,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-02 11:23:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-12-02 11:23:59,804 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:23:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:23:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -36979272, now seen corresponding path program 1 times [2024-12-02 11:23:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:23:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530109919] [2024-12-02 11:23:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:23:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530109919] [2024-12-02 11:24:00,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530109919] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:24:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535805520] [2024-12-02 11:24:00,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:00,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:24:00,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:24:00,860 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:24:00,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 11:24:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:01,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 11:24:01,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:24:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:02,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:24:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:05,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535805520] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:24:05,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:24:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 19] total 62 [2024-12-02 11:24:05,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524818725] [2024-12-02 11:24:05,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:24:05,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-02 11:24:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:05,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-02 11:24:05,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3510, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 11:24:05,188 INFO L87 Difference]: Start difference. First operand 37164 states and 41912 transitions. Second operand has 62 states, 62 states have (on average 6.774193548387097) internal successors, (420), 62 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:24:48,497 INFO L93 Difference]: Finished difference Result 101976 states and 115599 transitions. [2024-12-02 11:24:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2024-12-02 11:24:48,498 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 6.774193548387097) internal successors, (420), 62 states have internal predecessors, (420), 0 states have call successors, (0), 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 160 [2024-12-02 11:24:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:24:48,545 INFO L225 Difference]: With dead ends: 101976 [2024-12-02 11:24:48,545 INFO L226 Difference]: Without dead ends: 73949 [2024-12-02 11:24:48,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48691 ImplicationChecksByTransitivity, 40.7s TimeCoverageRelationStatistics Valid=13865, Invalid=115375, Unknown=0, NotChecked=0, Total=129240 [2024-12-02 11:24:48,567 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 2471 mSDsluCounter, 10291 mSDsCounter, 0 mSdLazyCounter, 6539 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 10558 SdHoareTripleChecker+Invalid, 6617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 6539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:24:48,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 10558 Invalid, 6617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 6539 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 11:24:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73949 states. [2024-12-02 11:24:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73949 to 54110. [2024-12-02 11:24:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54110 states, 54109 states have (on average 1.1232327339259642) internal successors, (60777), 54109 states have internal predecessors, (60777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54110 states to 54110 states and 60777 transitions. [2024-12-02 11:24:49,025 INFO L78 Accepts]: Start accepts. Automaton has 54110 states and 60777 transitions. Word has length 160 [2024-12-02 11:24:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:24:49,025 INFO L471 AbstractCegarLoop]: Abstraction has 54110 states and 60777 transitions. [2024-12-02 11:24:49,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 6.774193548387097) internal successors, (420), 62 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 54110 states and 60777 transitions. [2024-12-02 11:24:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:24:49,026 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:24:49,027 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-12-02 11:24:49,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-02 11:24:49,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:24:49,227 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:24:49,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:49,227 INFO L85 PathProgramCache]: Analyzing trace with hash -100240382, now seen corresponding path program 1 times [2024-12-02 11:24:49,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:49,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978694556] [2024-12-02 11:24:49,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:24:49,261 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:24:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:24:49,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:24:49,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:24:49,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 11:24:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 11:24:49,369 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:49,484 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:24:49,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:24:49 BoogieIcfgContainer [2024-12-02 11:24:49,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:24:49,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:24:49,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:24:49,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:24:49,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:13:27" (3/4) ... [2024-12-02 11:24:49,489 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 11:24:49,636 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 107. [2024-12-02 11:24:49,725 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 11:24:49,725 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 11:24:49,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:24:49,726 INFO L158 Benchmark]: Toolchain (without parser) took 683084.97ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 92.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-12-02 11:24:49,726 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:24:49,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.27ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:24:49,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.05ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:24:49,726 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:24:49,727 INFO L158 Benchmark]: RCFGBuilder took 424.16ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 53.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:24:49,727 INFO L158 Benchmark]: TraceAbstraction took 682087.69ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 52.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-12-02 11:24:49,727 INFO L158 Benchmark]: Witness Printer took 238.23ms. Allocated memory is still 3.3GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 11:24:49,728 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.27ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.27ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.05ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 424.16ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 53.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 682087.69ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 52.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 238.23ms. Allocated memory is still 3.3GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 33.6MB). 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: 201]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] port_t p3 = 0; [L43] char p3_old = '\x0'; [L44] char p3_new = '\x0'; [L45] char id3 = '\x0'; [L46] char st3 = '\x0'; [L47] msg_t send3 = '\x0'; [L48] _Bool mode3 = 0; [L52] void (*nodes[3])() = { &node1, &node2, &node3 }; [L56] int __return_1394; [L57] int __return_1470; VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L60] int main__c1; [L61] int main__i2; [L62] main__c1 = 0 [L63] r1 = __VERIFIER_nondet_uchar() [L64] id1 = __VERIFIER_nondet_char() [L65] st1 = __VERIFIER_nondet_char() [L66] send1 = __VERIFIER_nondet_char() [L67] mode1 = __VERIFIER_nondet_bool() [L68] id2 = __VERIFIER_nondet_char() [L69] st2 = __VERIFIER_nondet_char() [L70] send2 = __VERIFIER_nondet_char() [L71] mode2 = __VERIFIER_nondet_bool() [L72] id3 = __VERIFIER_nondet_char() [L73] st3 = __VERIFIER_nondet_char() [L74] send3 = __VERIFIER_nondet_char() [L75] mode3 = __VERIFIER_nondet_bool() [L77] int init__tmp; VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L78] COND TRUE ((int)r1) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L80] COND TRUE ((int)id1) >= 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L82] COND TRUE ((int)st1) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L84] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L86] COND TRUE ((int)mode1) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L88] COND TRUE ((int)id2) >= 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L90] COND TRUE ((int)st2) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L92] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L94] COND TRUE ((int)mode2) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L96] COND TRUE ((int)id3) >= 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L98] COND TRUE ((int)st3) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L100] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L102] COND TRUE ((int)mode3) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L104] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L106] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L108] COND TRUE ((int)id2) != ((int)id3) [L110] init__tmp = 1 [L111] __return_1394 = init__tmp [L112] main__i2 = __return_1394 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, main__i2=1, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L113] COND TRUE main__i2 != 0 [L115] p1_old = nomsg [L116] p1_new = nomsg [L117] p2_old = nomsg [L118] p2_new = nomsg [L119] p3_old = nomsg [L120] p3_new = nomsg [L121] main__i2 = 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L126] COND FALSE !(!(mode1 == 0)) [L360] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L361] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L363] COND TRUE p1_new == nomsg [L365] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=127, nomsg=-1, p1=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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L367] p1_new = node1____CPAchecker_TMP_0 [L368] mode1 = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L146] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L310] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L312] COND TRUE p2_new == nomsg [L314] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, node2____CPAchecker_TMP_0=125, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L316] p2_new = node2____CPAchecker_TMP_0 [L317] mode2 = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=125, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=125, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=125, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L265] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=125, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L267] COND TRUE p3_new == nomsg [L269] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=126, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=125, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L271] p3_new = node3____CPAchecker_TMP_0 [L272] mode3 = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=125, p2_old=-1, p3=0, p3_new=126, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L181] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, check__tmp=1, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, assert__arg=1, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L126] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L128] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L132] r1 = r1 + 1 [L133] node1__m1 = p3_old [L134] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=126, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L135] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=126, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L137] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=126, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L336] COND FALSE !(((int)node1__m1) == ((int)id1)) [L343] send1 = node1__m1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=125, send3=126, st1=0, st2=0, st3=0] [L141] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=125, send3=126, st1=0, st2=0, st3=0] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=125, send3=126, st1=0, st2=0, st3=0] [L146] COND TRUE !(mode2 == 0) [L148] node2__m2 = p1_old [L149] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, node2__m2=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=125, send3=126, st1=0, st2=0, st3=0] [L150] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, node2__m2=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=125, send3=126, st1=0, st2=0, st3=0] [L152] COND TRUE ((int)node2__m2) > ((int)id2) [L154] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L156] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=125, nomsg=-1, p1=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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=125, nomsg=-1, p1=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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L167] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=125, nomsg=-1, p1=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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L246] COND FALSE !(((int)node3__m3) == ((int)id3)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L171] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L181] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, check__tmp=1, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, assert__arg=1, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L126] COND FALSE !(!(mode1 == 0)) [L360] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L361] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L363] COND TRUE p1_new == nomsg [L365] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=126, nomsg=-1, p1=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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L367] p1_new = node1____CPAchecker_TMP_0 [L368] mode1 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L146] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L310] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L312] COND TRUE p2_new == nomsg [L314] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, node2____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L316] p2_new = node2____CPAchecker_TMP_0 [L317] mode2 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L265] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L267] COND TRUE p3_new == nomsg [L269] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=126, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L271] p3_new = node3____CPAchecker_TMP_0 [L272] mode3 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=126, p3_old=-1, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L181] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, check__tmp=1, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, assert__arg=1, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L126] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L128] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L132] r1 = r1 + 1 [L133] node1__m1 = p3_old [L134] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=126, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L135] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=126, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L137] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=126, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L336] COND FALSE !(((int)node1__m1) == ((int)id1)) [L343] send1 = node1__m1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L141] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L146] COND TRUE !(mode2 == 0) [L148] node2__m2 = p1_old [L149] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, node2__m2=126, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L150] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, node2__m2=126, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L152] COND TRUE ((int)node2__m2) > ((int)id2) [L154] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=126, st1=0, st2=0, st3=0] [L156] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=126, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=126, st1=0, st2=0, st3=0] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=127, nomsg=-1, p1=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=126, send2=126, send3=126, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=127, nomsg=-1, p1=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=126, send2=126, send3=126, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)node3__m3) > ((int)id3) [L169] send3 = node3__m3 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L171] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L181] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, check__tmp=1, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, assert__arg=1, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L126] COND FALSE !(!(mode1 == 0)) [L360] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L361] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L363] COND TRUE p1_new == nomsg [L365] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=126, nomsg=-1, p1=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=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L367] p1_new = node1____CPAchecker_TMP_0 [L368] mode1 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L146] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L310] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L312] COND TRUE p2_new == nomsg [L314] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=0, mode3=0, node2____CPAchecker_TMP_0=126, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L316] p2_new = node2____CPAchecker_TMP_0 [L317] mode2 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L265] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L267] COND TRUE p3_new == nomsg [L269] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L271] p3_new = node3____CPAchecker_TMP_0 [L272] mode3 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L181] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, check__tmp=1, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, assert__arg=1, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L126] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L128] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L132] r1 = r1 + 1 [L133] node1__m1 = p3_old [L134] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L135] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L336] COND TRUE ((int)node1__m1) == ((int)id1) [L338] st1 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L141] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L146] COND TRUE !(mode2 == 0) [L148] node2__m2 = p1_old [L149] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, node2__m2=126, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L150] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, node2__m2=126, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L152] COND TRUE ((int)node2__m2) > ((int)id2) [L154] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L156] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=126, nomsg=-1, p1=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=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L165] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=126, nomsg=-1, p1=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=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L167] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, mode1=0, mode2=0, mode3=1, node3__m3=126, nomsg=-1, p1=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=126, send2=126, send3=127, st1=1, st2=0, st3=0] [L246] COND TRUE ((int)node3__m3) == ((int)id3) [L248] st3 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] [L171] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] [L181] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L239] check__tmp = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, check__tmp=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=0, __return_main=0, assert__arg=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] [L199] COND TRUE assert__arg == 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] [L201] reach_error() VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=127, id2=125, id3=126, 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=126, send2=126, send3=127, st1=1, st2=0, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 681.9s, OverallIterations: 43, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 560.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57223 SdHoareTripleChecker+Valid, 51.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57223 mSDsluCounter, 87808 SdHoareTripleChecker+Invalid, 45.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83057 mSDsCounter, 1793 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67279 IncrementalHoareTripleChecker+Invalid, 69072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1793 mSolverCounterUnsat, 4751 mSDtfsCounter, 67279 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8096 GetRequests, 4283 SyntacticMatches, 13 SemanticMatches, 3800 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337068 ImplicationChecksByTransitivity, 543.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113163occurred in iteration=18, InterpolantAutomatonStates: 2873, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 42 MinimizatonAttempts, 248143 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 105.3s InterpolantComputationTime, 6306 NumberOfCodeBlocks, 6306 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 8507 ConstructedInterpolants, 61 QuantifiedInterpolants, 150639 SizeOfPredicates, 146 NumberOfNonLiveVariables, 9558 ConjunctsInSsa, 746 ConjunctsInUnsatCore, 86 InterpolantComputations, 20 PerfectInterpolantSequences, 2399/7354 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 11:24:49,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51f87574-01a5-4889-b00e-f50a16fcbcc9/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