./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/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_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/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_c99b8c70-cc0a-450a-a554-d760f5a854ba/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 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 06:25:44,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 06:25:45,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 06:25:45,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 06:25:45,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 06:25:45,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 06:25:45,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 06:25:45,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 06:25:45,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 06:25:45,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 06:25:45,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 06:25:45,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 06:25:45,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 06:25:45,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 06:25:45,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 06:25:45,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:25:45,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:25:45,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:25:45,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 06:25:45,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 06:25:45,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 06:25:45,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 06:25:45,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 06:25:45,048 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_c99b8c70-cc0a-450a-a554-d760f5a854ba/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 -> 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 [2024-12-02 06:25:45,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 06:25:45,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 06:25:45,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 06:25:45,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 06:25:45,286 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 06:25:45,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2024-12-02 06:25:47,903 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/data/3d6be0d2a/d2f77a2b3bf5494b9bd804f65d6924f4/FLAG0212d1254 [2024-12-02 06:25:48,150 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 06:25:48,154 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2024-12-02 06:25:48,165 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/data/3d6be0d2a/d2f77a2b3bf5494b9bd804f65d6924f4/FLAG0212d1254 [2024-12-02 06:25:48,485 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/data/3d6be0d2a/d2f77a2b3bf5494b9bd804f65d6924f4 [2024-12-02 06:25:48,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 06:25:48,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 06:25:48,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 06:25:48,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 06:25:48,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 06:25:48,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73781e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48, skipping insertion in model container [2024-12-02 06:25:48,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 06:25:48,657 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_c99b8c70-cc0a-450a-a554-d760f5a854ba/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2024-12-02 06:25:48,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:25:48,667 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 06:25:48,701 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_c99b8c70-cc0a-450a-a554-d760f5a854ba/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2024-12-02 06:25:48,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:25:48,715 INFO L204 MainTranslator]: Completed translation [2024-12-02 06:25:48,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48 WrapperNode [2024-12-02 06:25:48,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 06:25:48,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 06:25:48,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 06:25:48,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 06:25:48,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,750 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 246 [2024-12-02 06:25:48,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 06:25:48,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 06:25:48,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 06:25:48,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 06:25:48,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,775 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 06:25:48,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 06:25:48,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 06:25:48,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 06:25:48,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 06:25:48,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (1/1) ... [2024-12-02 06:25:48,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:25:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:25:48,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 06:25:48,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 06:25:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 06:25:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 06:25:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 06:25:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 06:25:48,899 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 06:25:48,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 06:25:49,184 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-12-02 06:25:49,184 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 06:25:49,194 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 06:25:49,195 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 06:25:49,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:25:49 BoogieIcfgContainer [2024-12-02 06:25:49,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 06:25:49,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 06:25:49,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 06:25:49,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 06:25:49,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:25:48" (1/3) ... [2024-12-02 06:25:49,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba385dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:25:49, skipping insertion in model container [2024-12-02 06:25:49,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:48" (2/3) ... [2024-12-02 06:25:49,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba385dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:25:49, skipping insertion in model container [2024-12-02 06:25:49,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:25:49" (3/3) ... [2024-12-02 06:25:49,204 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2024-12-02 06:25:49,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 06:25:49,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 06:25:49,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 06:25:49,279 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;@5dad3ab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 06:25:49,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 06:25:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.696969696969697) internal successors, (112), 67 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-02 06:25:49,287 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:49,288 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] [2024-12-02 06:25:49,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1726248240, now seen corresponding path program 1 times [2024-12-02 06:25:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:49,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696972312] [2024-12-02 06:25:49,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:49,644 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 06:25:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696972312] [2024-12-02 06:25:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696972312] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:25:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316137313] [2024-12-02 06:25:49,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:25:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:49,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:25:49,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:49,666 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.696969696969697) internal successors, (112), 67 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:49,732 INFO L93 Difference]: Finished difference Result 113 states and 185 transitions. [2024-12-02 06:25:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:25:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-12-02 06:25:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:49,742 INFO L225 Difference]: With dead ends: 113 [2024-12-02 06:25:49,742 INFO L226 Difference]: Without dead ends: 64 [2024-12-02 06:25:49,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:49,748 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:25:49,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-12-02 06:25:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-12-02 06:25:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-12-02 06:25:49,779 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 25 [2024-12-02 06:25:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-12-02 06:25:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-12-02 06:25:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 06:25:49,780 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:49,781 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 06:25:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 06:25:49,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1777921530, now seen corresponding path program 1 times [2024-12-02 06:25:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507819039] [2024-12-02 06:25:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:25:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507819039] [2024-12-02 06:25:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507819039] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:25:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702017798] [2024-12-02 06:25:49,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:49,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:25:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:49,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:25:49,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:49,930 INFO L87 Difference]: Start difference. First operand 64 states and 88 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 06:25:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,014 INFO L93 Difference]: Finished difference Result 228 states and 348 transitions. [2024-12-02 06:25:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:25:50,015 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 06:25:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,016 INFO L225 Difference]: With dead ends: 228 [2024-12-02 06:25:50,017 INFO L226 Difference]: Without dead ends: 187 [2024-12-02 06:25:50,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:25:50,018 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 368 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:25:50,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 327 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-12-02 06:25:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 103. [2024-12-02 06:25:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 102 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-12-02 06:25:50,030 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 41 [2024-12-02 06:25:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:50,030 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-12-02 06:25:50,031 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 06:25:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-12-02 06:25:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 06:25:50,032 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:50,032 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 06:25:50,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 06:25:50,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:50,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash 335683958, now seen corresponding path program 1 times [2024-12-02 06:25:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:50,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884138619] [2024-12-02 06:25:50,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:50,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:50,276 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 06:25:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:50,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884138619] [2024-12-02 06:25:50,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884138619] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:50,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:50,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:25:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644428327] [2024-12-02 06:25:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:50,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:25:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:50,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:25:50,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:50,278 INFO L87 Difference]: Start difference. First operand 103 states and 150 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 06:25:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,302 INFO L93 Difference]: Finished difference Result 111 states and 159 transitions. [2024-12-02 06:25:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:25:50,303 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 06:25:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,304 INFO L225 Difference]: With dead ends: 111 [2024-12-02 06:25:50,304 INFO L226 Difference]: Without dead ends: 109 [2024-12-02 06:25:50,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:50,305 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:25:50,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-12-02 06:25:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-12-02 06:25:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 108 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-12-02 06:25:50,312 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 42 [2024-12-02 06:25:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:50,313 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-12-02 06:25:50,313 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 06:25:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-12-02 06:25:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-02 06:25:50,314 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:50,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:50,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 06:25:50,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1868846558, now seen corresponding path program 1 times [2024-12-02 06:25:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880271019] [2024-12-02 06:25:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:50,391 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 06:25:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880271019] [2024-12-02 06:25:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880271019] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:25:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644040121] [2024-12-02 06:25:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:25:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:50,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:25:50,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:50,393 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,417 INFO L93 Difference]: Finished difference Result 266 states and 397 transitions. [2024-12-02 06:25:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:25:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-12-02 06:25:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,419 INFO L225 Difference]: With dead ends: 266 [2024-12-02 06:25:50,419 INFO L226 Difference]: Without dead ends: 180 [2024-12-02 06:25:50,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 06:25:50,420 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:25:50,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 145 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-12-02 06:25:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2024-12-02 06:25:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 175 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 257 transitions. [2024-12-02 06:25:50,431 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 257 transitions. Word has length 43 [2024-12-02 06:25:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:50,431 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 257 transitions. [2024-12-02 06:25:50,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 257 transitions. [2024-12-02 06:25:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 06:25:50,433 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:50,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 06:25:50,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:50,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1065557743, now seen corresponding path program 1 times [2024-12-02 06:25:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496983859] [2024-12-02 06:25:50,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:50,494 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 06:25:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496983859] [2024-12-02 06:25:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496983859] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:25:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234280237] [2024-12-02 06:25:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:50,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:25:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:50,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:25:50,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:50,496 INFO L87 Difference]: Start difference. First operand 176 states and 257 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,519 INFO L93 Difference]: Finished difference Result 450 states and 669 transitions. [2024-12-02 06:25:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:25:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-12-02 06:25:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,521 INFO L225 Difference]: With dead ends: 450 [2024-12-02 06:25:50,521 INFO L226 Difference]: Without dead ends: 297 [2024-12-02 06:25:50,522 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 06:25:50,523 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 171 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 06:25:50,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-12-02 06:25:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2024-12-02 06:25:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.4625850340136055) internal successors, (430), 294 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 430 transitions. [2024-12-02 06:25:50,537 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 430 transitions. Word has length 44 [2024-12-02 06:25:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 430 transitions. [2024-12-02 06:25:50,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 430 transitions. [2024-12-02 06:25:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 06:25:50,539 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:50,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 06:25:50,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash -735131185, now seen corresponding path program 1 times [2024-12-02 06:25:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977106246] [2024-12-02 06:25:50,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:50,608 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 06:25:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977106246] [2024-12-02 06:25:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977106246] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:25:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251073890] [2024-12-02 06:25:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:50,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:25:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:50,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:25:50,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:50,610 INFO L87 Difference]: Start difference. First operand 295 states and 430 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,637 INFO L93 Difference]: Finished difference Result 775 states and 1132 transitions. [2024-12-02 06:25:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:25:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-12-02 06:25:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,640 INFO L225 Difference]: With dead ends: 775 [2024-12-02 06:25:50,641 INFO L226 Difference]: Without dead ends: 503 [2024-12-02 06:25:50,641 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 06:25:50,642 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 184 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 06:25:50,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-12-02 06:25:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-12-02 06:25:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.432) internal successors, (716), 500 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 06:25:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 716 transitions. [2024-12-02 06:25:50,659 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 716 transitions. Word has length 44 [2024-12-02 06:25:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:50,659 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 716 transitions. [2024-12-02 06:25:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 716 transitions. [2024-12-02 06:25:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-02 06:25:50,660 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:50,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:50,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 06:25:50,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:50,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1047477949, now seen corresponding path program 1 times [2024-12-02 06:25:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443790236] [2024-12-02 06:25:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:50,706 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 06:25:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443790236] [2024-12-02 06:25:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443790236] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:50,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:25:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005981603] [2024-12-02 06:25:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:50,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:25:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:50,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:25:50,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:50,708 INFO L87 Difference]: Start difference. First operand 501 states and 716 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,731 INFO L93 Difference]: Finished difference Result 980 states and 1418 transitions. [2024-12-02 06:25:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:25:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-12-02 06:25:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,734 INFO L225 Difference]: With dead ends: 980 [2024-12-02 06:25:50,734 INFO L226 Difference]: Without dead ends: 705 [2024-12-02 06:25:50,734 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 06:25:50,735 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 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 06:25:50,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-12-02 06:25:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 703. [2024-12-02 06:25:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.4216524216524216) internal successors, (998), 702 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 998 transitions. [2024-12-02 06:25:50,755 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 998 transitions. Word has length 45 [2024-12-02 06:25:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:50,756 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 998 transitions. [2024-12-02 06:25:50,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 998 transitions. [2024-12-02 06:25:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 06:25:50,756 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:50,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:50,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 06:25:50,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1706838473, now seen corresponding path program 1 times [2024-12-02 06:25:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952436511] [2024-12-02 06:25:50,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 06:25:50,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952436511] [2024-12-02 06:25:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952436511] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:50,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:50,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:25:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216795424] [2024-12-02 06:25:50,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:50,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:25:50,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:50,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:25:50,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:50,871 INFO L87 Difference]: Start difference. First operand 703 states and 998 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 06:25:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:50,953 INFO L93 Difference]: Finished difference Result 1623 states and 2346 transitions. [2024-12-02 06:25:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:25:50,954 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 63 [2024-12-02 06:25:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:50,958 INFO L225 Difference]: With dead ends: 1623 [2024-12-02 06:25:50,958 INFO L226 Difference]: Without dead ends: 1277 [2024-12-02 06:25:50,959 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 06:25:50,960 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 236 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:25:50,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-12-02 06:25:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1035. [2024-12-02 06:25:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1034 states have (on average 1.425531914893617) internal successors, (1474), 1034 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1474 transitions. [2024-12-02 06:25:51,011 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1474 transitions. Word has length 63 [2024-12-02 06:25:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1474 transitions. [2024-12-02 06:25:51,011 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 06:25:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1474 transitions. [2024-12-02 06:25:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 06:25:51,012 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:51,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:51,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 06:25:51,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:51,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash 787439895, now seen corresponding path program 1 times [2024-12-02 06:25:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464017988] [2024-12-02 06:25:51,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 06:25:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464017988] [2024-12-02 06:25:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464017988] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:25:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882677563] [2024-12-02 06:25:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:51,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:25:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:25:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:25:51,176 INFO L87 Difference]: Start difference. First operand 1035 states and 1474 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:51,275 INFO L93 Difference]: Finished difference Result 1955 states and 2822 transitions. [2024-12-02 06:25:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:25:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 06:25:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:51,282 INFO L225 Difference]: With dead ends: 1955 [2024-12-02 06:25:51,282 INFO L226 Difference]: Without dead ends: 1609 [2024-12-02 06:25:51,283 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 06:25:51,284 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 229 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:25:51,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 383 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-12-02 06:25:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1367. [2024-12-02 06:25:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 1.4275256222547583) internal successors, (1950), 1366 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1950 transitions. [2024-12-02 06:25:51,351 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1950 transitions. Word has length 63 [2024-12-02 06:25:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:51,351 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1950 transitions. [2024-12-02 06:25:51,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1950 transitions. [2024-12-02 06:25:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 06:25:51,353 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:51,353 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:25:51,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 06:25:51,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:51,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1002541173, now seen corresponding path program 1 times [2024-12-02 06:25:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203373755] [2024-12-02 06:25:51,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:25:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203373755] [2024-12-02 06:25:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203373755] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:25:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611603392] [2024-12-02 06:25:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:25:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:51,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:25:51,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:51,481 INFO L87 Difference]: Start difference. First operand 1367 states and 1950 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 06:25:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:51,528 INFO L93 Difference]: Finished difference Result 2711 states and 3876 transitions. [2024-12-02 06:25:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:25:51,529 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 06:25:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:51,533 INFO L225 Difference]: With dead ends: 2711 [2024-12-02 06:25:51,534 INFO L226 Difference]: Without dead ends: 1369 [2024-12-02 06:25:51,535 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 06:25:51,536 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 40 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 182 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 06:25:51,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-12-02 06:25:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1367. [2024-12-02 06:25:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 1.4099560761346999) internal successors, (1926), 1366 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1926 transitions. [2024-12-02 06:25:51,594 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1926 transitions. Word has length 64 [2024-12-02 06:25:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:51,594 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1926 transitions. [2024-12-02 06:25:51,594 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 06:25:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1926 transitions. [2024-12-02 06:25:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 06:25:51,596 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:51,596 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 06:25:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 06:25:51,596 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:51,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash -482482316, now seen corresponding path program 1 times [2024-12-02 06:25:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:51,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363708607] [2024-12-02 06:25:51,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:25:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363708607] [2024-12-02 06:25:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363708607] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:25:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:25:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:25:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259708437] [2024-12-02 06:25:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:25:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:25:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:51,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:25:51,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:51,730 INFO L87 Difference]: Start difference. First operand 1367 states and 1926 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 06:25:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:25:51,760 INFO L93 Difference]: Finished difference Result 2041 states and 2878 transitions. [2024-12-02 06:25:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:25:51,760 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 06:25:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:25:51,763 INFO L225 Difference]: With dead ends: 2041 [2024-12-02 06:25:51,763 INFO L226 Difference]: Without dead ends: 699 [2024-12-02 06:25:51,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:25:51,765 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 163 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 06:25:51,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:25:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-12-02 06:25:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2024-12-02 06:25:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.3850574712643677) internal successors, (964), 696 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:25:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 964 transitions. [2024-12-02 06:25:51,785 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 964 transitions. Word has length 64 [2024-12-02 06:25:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:25:51,785 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 964 transitions. [2024-12-02 06:25:51,786 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 06:25:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 964 transitions. [2024-12-02 06:25:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 06:25:51,786 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:25:51,786 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] [2024-12-02 06:25:51,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 06:25:51,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:25:51,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:25:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash -96233997, now seen corresponding path program 1 times [2024-12-02 06:25:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:25:51,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567787396] [2024-12-02 06:25:51,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:25:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:53,616 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 06:25:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:25:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567787396] [2024-12-02 06:25:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567787396] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:25:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789350409] [2024-12-02 06:25:53,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:25:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:25:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:25:53,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:25:53,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 06:25:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:25:53,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 06:25:53,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:25:54,168 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 06:25:54,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:25:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:25:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789350409] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:25:54,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:25:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 8] total 23 [2024-12-02 06:25:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502079542] [2024-12-02 06:25:54,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:25:54,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 06:25:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:25:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 06:25:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-12-02 06:25:54,560 INFO L87 Difference]: Start difference. First operand 697 states and 964 transitions. Second operand has 23 states, 23 states have (on average 8.043478260869565) internal successors, (185), 23 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 06:26:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:04,393 INFO L93 Difference]: Finished difference Result 7312 states and 9989 transitions. [2024-12-02 06:26:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-12-02 06:26:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.043478260869565) internal successors, (185), 23 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 64 [2024-12-02 06:26:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:04,412 INFO L225 Difference]: With dead ends: 7312 [2024-12-02 06:26:04,412 INFO L226 Difference]: Without dead ends: 6838 [2024-12-02 06:26:04,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13935 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=4235, Invalid=30175, Unknown=0, NotChecked=0, Total=34410 [2024-12-02 06:26:04,421 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2903 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2903 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:26:04,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2903 Valid, 1342 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 06:26:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2024-12-02 06:26:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 5322. [2024-12-02 06:26:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5322 states, 5321 states have (on average 1.3544446532606653) internal successors, (7207), 5321 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5322 states to 5322 states and 7207 transitions. [2024-12-02 06:26:04,599 INFO L78 Accepts]: Start accepts. Automaton has 5322 states and 7207 transitions. Word has length 64 [2024-12-02 06:26:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:04,599 INFO L471 AbstractCegarLoop]: Abstraction has 5322 states and 7207 transitions. [2024-12-02 06:26:04,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.043478260869565) internal successors, (185), 23 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 06:26:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 7207 transitions. [2024-12-02 06:26:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 06:26:04,601 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:04,601 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 06:26:04,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 06:26:04,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:26:04,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2034501574, now seen corresponding path program 1 times [2024-12-02 06:26:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252757781] [2024-12-02 06:26:04,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:26:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252757781] [2024-12-02 06:26:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252757781] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:26:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:26:04,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:26:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565465927] [2024-12-02 06:26:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:26:04,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:26:04,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:04,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:26:04,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:26:04,899 INFO L87 Difference]: Start difference. First operand 5322 states and 7207 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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 06:26:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:05,062 INFO L93 Difference]: Finished difference Result 8914 states and 12163 transitions. [2024-12-02 06:26:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:26:05,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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 65 [2024-12-02 06:26:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:05,082 INFO L225 Difference]: With dead ends: 8914 [2024-12-02 06:26:05,082 INFO L226 Difference]: Without dead ends: 7742 [2024-12-02 06:26:05,084 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 06:26:05,085 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 220 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:26:05,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 366 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:26:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7742 states. [2024-12-02 06:26:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7742 to 6490. [2024-12-02 06:26:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6489 states have (on average 1.3522884882108184) internal successors, (8775), 6489 states have internal predecessors, (8775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 8775 transitions. [2024-12-02 06:26:05,301 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 8775 transitions. Word has length 65 [2024-12-02 06:26:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:05,301 INFO L471 AbstractCegarLoop]: Abstraction has 6490 states and 8775 transitions. [2024-12-02 06:26:05,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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 06:26:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 8775 transitions. [2024-12-02 06:26:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 06:26:05,302 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:05,302 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, 1, 1, 1, 1, 1] [2024-12-02 06:26:05,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 06:26:05,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1099704894, now seen corresponding path program 1 times [2024-12-02 06:26:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769427487] [2024-12-02 06:26:05,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:05,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:05,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769427487] [2024-12-02 06:26:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769427487] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:26:05,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:26:05,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:26:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270978742] [2024-12-02 06:26:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:26:05,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:26:05,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:05,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:26:05,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:26:05,379 INFO L87 Difference]: Start difference. First operand 6490 states and 8775 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:05,471 INFO L93 Difference]: Finished difference Result 9300 states and 12488 transitions. [2024-12-02 06:26:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:26:05,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 06:26:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:05,478 INFO L225 Difference]: With dead ends: 9300 [2024-12-02 06:26:05,478 INFO L226 Difference]: Without dead ends: 2835 [2024-12-02 06:26:05,483 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 06:26:05,484 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 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 06:26:05,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:26:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2024-12-02 06:26:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2373. [2024-12-02 06:26:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2372 states have (on average 1.308600337268128) internal successors, (3104), 2372 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3104 transitions. [2024-12-02 06:26:05,593 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3104 transitions. Word has length 66 [2024-12-02 06:26:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:05,594 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3104 transitions. [2024-12-02 06:26:05,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3104 transitions. [2024-12-02 06:26:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 06:26:05,595 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:05,595 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, 1, 1, 1] [2024-12-02 06:26:05,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 06:26:05,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:05,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1052509478, now seen corresponding path program 1 times [2024-12-02 06:26:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182644783] [2024-12-02 06:26:05,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182644783] [2024-12-02 06:26:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182644783] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:26:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882246592] [2024-12-02 06:26:06,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:26:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:26:06,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:26:06,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 06:26:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:06,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 06:26:06,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:26:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:06,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:26:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882246592] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:26:06,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:26:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-12-02 06:26:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753368118] [2024-12-02 06:26:06,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:26:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 06:26:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 06:26:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-12-02 06:26:06,901 INFO L87 Difference]: Start difference. First operand 2373 states and 3104 transitions. Second operand has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:07,322 INFO L93 Difference]: Finished difference Result 8237 states and 10876 transitions. [2024-12-02 06:26:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:26:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 06:26:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:07,338 INFO L225 Difference]: With dead ends: 8237 [2024-12-02 06:26:07,338 INFO L226 Difference]: Without dead ends: 6135 [2024-12-02 06:26:07,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 06:26:07,341 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 880 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:26:07,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 486 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:26:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2024-12-02 06:26:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5969. [2024-12-02 06:26:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5969 states, 5968 states have (on average 1.2964142091152815) internal successors, (7737), 5968 states have internal predecessors, (7737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5969 states to 5969 states and 7737 transitions. [2024-12-02 06:26:07,450 INFO L78 Accepts]: Start accepts. Automaton has 5969 states and 7737 transitions. Word has length 68 [2024-12-02 06:26:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:07,450 INFO L471 AbstractCegarLoop]: Abstraction has 5969 states and 7737 transitions. [2024-12-02 06:26:07,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5969 states and 7737 transitions. [2024-12-02 06:26:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 06:26:07,450 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:07,450 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, 1, 1, 1] [2024-12-02 06:26:07,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 06:26:07,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-12-02 06:26:07,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1127112472, now seen corresponding path program 1 times [2024-12-02 06:26:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91802152] [2024-12-02 06:26:07,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91802152] [2024-12-02 06:26:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91802152] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:26:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635706841] [2024-12-02 06:26:07,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:26:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:26:07,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:26:07,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 06:26:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:07,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 06:26:08,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:26:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:08,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:26:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635706841] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:26:09,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:26:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 06:26:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316375148] [2024-12-02 06:26:09,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:26:09,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 06:26:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:09,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 06:26:09,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-12-02 06:26:09,357 INFO L87 Difference]: Start difference. First operand 5969 states and 7737 transitions. Second operand has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:25,867 INFO L93 Difference]: Finished difference Result 39154 states and 51929 transitions. [2024-12-02 06:26:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-12-02 06:26:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 06:26:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:25,915 INFO L225 Difference]: With dead ends: 39154 [2024-12-02 06:26:25,915 INFO L226 Difference]: Without dead ends: 33686 [2024-12-02 06:26:25,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21194 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=7856, Invalid=42994, Unknown=0, NotChecked=0, Total=50850 [2024-12-02 06:26:25,924 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 6406 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6406 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:26:25,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6406 Valid, 2605 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 06:26:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33686 states. [2024-12-02 06:26:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33686 to 7542. [2024-12-02 06:26:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7542 states, 7541 states have (on average 1.313751491844583) internal successors, (9907), 7541 states have internal predecessors, (9907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7542 states to 7542 states and 9907 transitions. [2024-12-02 06:26:26,277 INFO L78 Accepts]: Start accepts. Automaton has 7542 states and 9907 transitions. Word has length 68 [2024-12-02 06:26:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:26,277 INFO L471 AbstractCegarLoop]: Abstraction has 7542 states and 9907 transitions. [2024-12-02 06:26:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7542 states and 9907 transitions. [2024-12-02 06:26:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 06:26:26,278 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:26,278 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, 1, 1, 1] [2024-12-02 06:26:26,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 06:26:26,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 06:26:26,479 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1949902756, now seen corresponding path program 1 times [2024-12-02 06:26:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748804214] [2024-12-02 06:26:26,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:26,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:26,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748804214] [2024-12-02 06:26:26,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748804214] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:26:26,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:26:26,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:26:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142476532] [2024-12-02 06:26:26,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:26:26,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:26:26,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:26,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:26:26,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:26:26,525 INFO L87 Difference]: Start difference. First operand 7542 states and 9907 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:26,872 INFO L93 Difference]: Finished difference Result 15734 states and 20597 transitions. [2024-12-02 06:26:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:26:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 06:26:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:26,889 INFO L225 Difference]: With dead ends: 15734 [2024-12-02 06:26:26,889 INFO L226 Difference]: Without dead ends: 8344 [2024-12-02 06:26:26,895 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 06:26:26,895 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:26:26,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 210 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:26:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8344 states. [2024-12-02 06:26:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8344 to 6188. [2024-12-02 06:26:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6188 states, 6187 states have (on average 1.2986908032972362) internal successors, (8035), 6187 states have internal predecessors, (8035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8035 transitions. [2024-12-02 06:26:27,171 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8035 transitions. Word has length 68 [2024-12-02 06:26:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:27,171 INFO L471 AbstractCegarLoop]: Abstraction has 6188 states and 8035 transitions. [2024-12-02 06:26:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8035 transitions. [2024-12-02 06:26:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 06:26:27,172 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:27,172 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, 1, 1, 1, 1] [2024-12-02 06:26:27,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 06:26:27,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 391870310, now seen corresponding path program 1 times [2024-12-02 06:26:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545319400] [2024-12-02 06:26:27,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545319400] [2024-12-02 06:26:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545319400] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:26:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:26:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:26:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494451252] [2024-12-02 06:26:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:26:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:26:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:26:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:26:27,218 INFO L87 Difference]: Start difference. First operand 6188 states and 8035 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:26:27,577 INFO L93 Difference]: Finished difference Result 14399 states and 18622 transitions. [2024-12-02 06:26:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:26:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-12-02 06:26:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:26:27,592 INFO L225 Difference]: With dead ends: 14399 [2024-12-02 06:26:27,592 INFO L226 Difference]: Without dead ends: 8415 [2024-12-02 06:26:27,596 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 06:26:27,596 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:26:27,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:26:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2024-12-02 06:26:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8413. [2024-12-02 06:26:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8413 states, 8412 states have (on average 1.2723490252020921) internal successors, (10703), 8412 states have internal predecessors, (10703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8413 states to 8413 states and 10703 transitions. [2024-12-02 06:26:28,040 INFO L78 Accepts]: Start accepts. Automaton has 8413 states and 10703 transitions. Word has length 69 [2024-12-02 06:26:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:26:28,040 INFO L471 AbstractCegarLoop]: Abstraction has 8413 states and 10703 transitions. [2024-12-02 06:26:28,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:26:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states and 10703 transitions. [2024-12-02 06:26:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 06:26:28,042 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:26:28,042 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, 1, 1, 1, 1, 1] [2024-12-02 06:26:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 06:26:28,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:26:28,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:26:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1259116810, now seen corresponding path program 1 times [2024-12-02 06:26:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:26:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857157027] [2024-12-02 06:26:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:26:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:26:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857157027] [2024-12-02 06:26:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857157027] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:26:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243199428] [2024-12-02 06:26:28,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:26:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:26:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:26:28,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:26:28,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 06:26:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:26:28,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-02 06:26:28,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:26:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:30,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:26:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:26:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243199428] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:26:34,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:26:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 45 [2024-12-02 06:26:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797389400] [2024-12-02 06:26:34,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:26:34,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-12-02 06:26:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:26:34,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-12-02 06:26:34,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1650, Unknown=0, NotChecked=0, Total=1980 [2024-12-02 06:26:34,090 INFO L87 Difference]: Start difference. First operand 8413 states and 10703 transitions. Second operand has 45 states, 45 states have (on average 4.2) internal successors, (189), 45 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:05,677 INFO L93 Difference]: Finished difference Result 36691 states and 46153 transitions. [2024-12-02 06:27:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-12-02 06:27:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.2) internal successors, (189), 45 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-12-02 06:27:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:05,704 INFO L225 Difference]: With dead ends: 36691 [2024-12-02 06:27:05,704 INFO L226 Difference]: Without dead ends: 28334 [2024-12-02 06:27:05,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11038 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=6346, Invalid=20714, Unknown=0, NotChecked=0, Total=27060 [2024-12-02 06:27:05,714 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 3766 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3766 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:05,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3766 Valid, 2185 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-12-02 06:27:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28334 states. [2024-12-02 06:27:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28334 to 14704. [2024-12-02 06:27:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14704 states, 14703 states have (on average 1.2559341630959668) internal successors, (18466), 14703 states have internal predecessors, (18466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14704 states to 14704 states and 18466 transitions. [2024-12-02 06:27:06,615 INFO L78 Accepts]: Start accepts. Automaton has 14704 states and 18466 transitions. Word has length 70 [2024-12-02 06:27:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:06,615 INFO L471 AbstractCegarLoop]: Abstraction has 14704 states and 18466 transitions. [2024-12-02 06:27:06,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.2) internal successors, (189), 45 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14704 states and 18466 transitions. [2024-12-02 06:27:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 06:27:06,619 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:06,619 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:06,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 06:27:06,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:27:06,820 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 182616549, now seen corresponding path program 1 times [2024-12-02 06:27:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015306516] [2024-12-02 06:27:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 06:27:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015306516] [2024-12-02 06:27:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015306516] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:27:06,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:27:06,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:27:06,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944679727] [2024-12-02 06:27:06,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:27:06,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:27:06,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:06,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:27:06,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:27:06,863 INFO L87 Difference]: Start difference. First operand 14704 states and 18466 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:07,847 INFO L93 Difference]: Finished difference Result 16384 states and 20486 transitions. [2024-12-02 06:27:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:27:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-12-02 06:27:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:07,860 INFO L225 Difference]: With dead ends: 16384 [2024-12-02 06:27:07,860 INFO L226 Difference]: Without dead ends: 11931 [2024-12-02 06:27:07,865 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 06:27:07,866 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:07,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 180 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:27:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11931 states. [2024-12-02 06:27:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11931 to 11837. [2024-12-02 06:27:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11837 states, 11836 states have (on average 1.2356370395403853) internal successors, (14625), 11836 states have internal predecessors, (14625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11837 states to 11837 states and 14625 transitions. [2024-12-02 06:27:08,513 INFO L78 Accepts]: Start accepts. Automaton has 11837 states and 14625 transitions. Word has length 110 [2024-12-02 06:27:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:08,513 INFO L471 AbstractCegarLoop]: Abstraction has 11837 states and 14625 transitions. [2024-12-02 06:27:08,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11837 states and 14625 transitions. [2024-12-02 06:27:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 06:27:08,519 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:08,519 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:08,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 06:27:08,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:08,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1738858729, now seen corresponding path program 1 times [2024-12-02 06:27:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:08,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189712472] [2024-12-02 06:27:08,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 06:27:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:08,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189712472] [2024-12-02 06:27:08,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189712472] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:27:08,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:27:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:27:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491368758] [2024-12-02 06:27:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:27:08,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:27:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:08,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:27:08,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:27:08,579 INFO L87 Difference]: Start difference. First operand 11837 states and 14625 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:09,329 INFO L93 Difference]: Finished difference Result 17107 states and 20996 transitions. [2024-12-02 06:27:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:27:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 06:27:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:09,337 INFO L225 Difference]: With dead ends: 17107 [2024-12-02 06:27:09,337 INFO L226 Difference]: Without dead ends: 10741 [2024-12-02 06:27:09,340 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 06:27:09,340 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:09,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 213 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:27:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10741 states. [2024-12-02 06:27:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10741 to 8582. [2024-12-02 06:27:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8582 states, 8581 states have (on average 1.2083673231558094) internal successors, (10369), 8581 states have internal predecessors, (10369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 10369 transitions. [2024-12-02 06:27:09,815 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 10369 transitions. Word has length 112 [2024-12-02 06:27:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:09,816 INFO L471 AbstractCegarLoop]: Abstraction has 8582 states and 10369 transitions. [2024-12-02 06:27:09,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 10369 transitions. [2024-12-02 06:27:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 06:27:09,819 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:09,819 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:09,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 06:27:09,819 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash -466583337, now seen corresponding path program 1 times [2024-12-02 06:27:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8249424] [2024-12-02 06:27:09,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 06:27:09,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8249424] [2024-12-02 06:27:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8249424] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:27:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972969547] [2024-12-02 06:27:09,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:09,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:27:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:27:09,882 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:27:09,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 06:27:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:09,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:27:09,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:27:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 06:27:10,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:27:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 06:27:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972969547] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:27:10,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:27:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-12-02 06:27:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815978329] [2024-12-02 06:27:10,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:27:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 06:27:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 06:27:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:27:10,315 INFO L87 Difference]: Start difference. First operand 8582 states and 10369 transitions. Second operand has 14 states, 14 states have (on average 21.5) internal successors, (301), 14 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:10,854 INFO L93 Difference]: Finished difference Result 11348 states and 13722 transitions. [2024-12-02 06:27:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 06:27:10,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.5) internal successors, (301), 14 states have internal predecessors, (301), 0 states have call successors, (0), 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 06:27:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:10,862 INFO L225 Difference]: With dead ends: 11348 [2024-12-02 06:27:10,862 INFO L226 Difference]: Without dead ends: 8296 [2024-12-02 06:27:10,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-12-02 06:27:10,866 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 297 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:10,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 404 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:27:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2024-12-02 06:27:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 8284. [2024-12-02 06:27:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.203428709404805) internal successors, (9968), 8283 states have internal predecessors, (9968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9968 transitions. [2024-12-02 06:27:11,586 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9968 transitions. Word has length 112 [2024-12-02 06:27:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:11,586 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9968 transitions. [2024-12-02 06:27:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.5) internal successors, (301), 14 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9968 transitions. [2024-12-02 06:27:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 06:27:11,589 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:11,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:11,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 06:27:11,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 06:27:11,790 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1126114859, now seen corresponding path program 1 times [2024-12-02 06:27:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:11,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689285649] [2024-12-02 06:27:11,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:27:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689285649] [2024-12-02 06:27:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689285649] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:27:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862009354] [2024-12-02 06:27:12,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:12,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:27:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:27:12,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:27:12,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 06:27:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:12,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 06:27:12,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:27:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 37 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:13,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:27:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862009354] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:27:15,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:27:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2024-12-02 06:27:15,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846489282] [2024-12-02 06:27:15,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:27:15,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-12-02 06:27:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:15,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-12-02 06:27:15,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2024-12-02 06:27:15,088 INFO L87 Difference]: Start difference. First operand 8284 states and 9968 transitions. Second operand has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 30 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:17,322 INFO L93 Difference]: Finished difference Result 27357 states and 33204 transitions. [2024-12-02 06:27:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-12-02 06:27:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 30 states have internal predecessors, (284), 0 states have call successors, (0), 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 06:27:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:17,335 INFO L225 Difference]: With dead ends: 27357 [2024-12-02 06:27:17,336 INFO L226 Difference]: Without dead ends: 21179 [2024-12-02 06:27:17,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=767, Invalid=2425, Unknown=0, NotChecked=0, Total=3192 [2024-12-02 06:27:17,341 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1320 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:17,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 974 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:27:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21179 states. [2024-12-02 06:27:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21179 to 14162. [2024-12-02 06:27:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14162 states, 14161 states have (on average 1.2015394393051337) internal successors, (17015), 14161 states have internal predecessors, (17015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14162 states to 14162 states and 17015 transitions. [2024-12-02 06:27:18,199 INFO L78 Accepts]: Start accepts. Automaton has 14162 states and 17015 transitions. Word has length 112 [2024-12-02 06:27:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:18,199 INFO L471 AbstractCegarLoop]: Abstraction has 14162 states and 17015 transitions. [2024-12-02 06:27:18,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 30 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14162 states and 17015 transitions. [2024-12-02 06:27:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:27:18,202 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:18,202 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:18,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 06:27:18,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 06:27:18,402 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2010160139, now seen corresponding path program 1 times [2024-12-02 06:27:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669697408] [2024-12-02 06:27:18,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-02 06:27:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669697408] [2024-12-02 06:27:18,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669697408] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:27:18,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:27:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:27:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603944454] [2024-12-02 06:27:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:27:18,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:27:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:18,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:27:18,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:27:18,450 INFO L87 Difference]: Start difference. First operand 14162 states and 17015 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 06:27:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:19,407 INFO L93 Difference]: Finished difference Result 31420 states and 37600 transitions. [2024-12-02 06:27:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:27:19,407 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 113 [2024-12-02 06:27:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:19,418 INFO L225 Difference]: With dead ends: 31420 [2024-12-02 06:27:19,418 INFO L226 Difference]: Without dead ends: 18159 [2024-12-02 06:27:19,425 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 06:27:19,425 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:19,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 189 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:27:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18159 states. [2024-12-02 06:27:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18159 to 17604. [2024-12-02 06:27:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17604 states, 17603 states have (on average 1.1649718797932171) internal successors, (20507), 17603 states have internal predecessors, (20507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17604 states to 17604 states and 20507 transitions. [2024-12-02 06:27:20,530 INFO L78 Accepts]: Start accepts. Automaton has 17604 states and 20507 transitions. Word has length 113 [2024-12-02 06:27:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:20,530 INFO L471 AbstractCegarLoop]: Abstraction has 17604 states and 20507 transitions. [2024-12-02 06:27:20,530 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 06:27:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17604 states and 20507 transitions. [2024-12-02 06:27:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:27:20,536 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:20,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:20,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 06:27:20,536 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:20,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1034803843, now seen corresponding path program 1 times [2024-12-02 06:27:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582566137] [2024-12-02 06:27:20,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582566137] [2024-12-02 06:27:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582566137] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:27:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217325748] [2024-12-02 06:27:21,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:21,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:27:21,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:27:21,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:27:21,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 06:27:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:21,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 06:27:21,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:27:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:22,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:27:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217325748] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:27:24,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:27:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 11] total 42 [2024-12-02 06:27:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121215700] [2024-12-02 06:27:24,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:27:24,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 06:27:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:24,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 06:27:24,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 06:27:24,631 INFO L87 Difference]: Start difference. First operand 17604 states and 20507 transitions. Second operand has 42 states, 42 states have (on average 7.261904761904762) internal successors, (305), 42 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:47,936 INFO L93 Difference]: Finished difference Result 78852 states and 92074 transitions. [2024-12-02 06:27:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2024-12-02 06:27:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.261904761904762) internal successors, (305), 42 states have internal predecessors, (305), 0 states have call successors, (0), 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 06:27:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:47,979 INFO L225 Difference]: With dead ends: 78852 [2024-12-02 06:27:47,979 INFO L226 Difference]: Without dead ends: 70887 [2024-12-02 06:27:47,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15750 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=8153, Invalid=34077, Unknown=0, NotChecked=0, Total=42230 [2024-12-02 06:27:47,989 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 5288 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5288 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:47,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5288 Valid, 2731 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 06:27:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70887 states. [2024-12-02 06:27:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70887 to 31703. [2024-12-02 06:27:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31703 states, 31702 states have (on average 1.1715349189325595) internal successors, (37140), 31702 states have internal predecessors, (37140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31703 states to 31703 states and 37140 transitions. [2024-12-02 06:27:50,523 INFO L78 Accepts]: Start accepts. Automaton has 31703 states and 37140 transitions. Word has length 113 [2024-12-02 06:27:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:50,524 INFO L471 AbstractCegarLoop]: Abstraction has 31703 states and 37140 transitions. [2024-12-02 06:27:50,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.261904761904762) internal successors, (305), 42 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 31703 states and 37140 transitions. [2024-12-02 06:27:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:27:50,529 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:50,529 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:50,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 06:27:50,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 06:27:50,729 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:50,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1819453195, now seen corresponding path program 1 times [2024-12-02 06:27:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285504415] [2024-12-02 06:27:50,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-02 06:27:50,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285504415] [2024-12-02 06:27:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285504415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:27:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:27:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:27:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48941675] [2024-12-02 06:27:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:27:50,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:27:50,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:27:50,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:27:50,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:27:50,801 INFO L87 Difference]: Start difference. First operand 31703 states and 37140 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:27:52,555 INFO L93 Difference]: Finished difference Result 42047 states and 48988 transitions. [2024-12-02 06:27:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:27:52,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 06:27:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:27:52,570 INFO L225 Difference]: With dead ends: 42047 [2024-12-02 06:27:52,570 INFO L226 Difference]: Without dead ends: 22543 [2024-12-02 06:27:52,575 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 06:27:52,576 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:27:52,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 209 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:27:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22543 states. [2024-12-02 06:27:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22543 to 19560. [2024-12-02 06:27:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19560 states, 19559 states have (on average 1.151745999284217) internal successors, (22527), 19559 states have internal predecessors, (22527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19560 states to 19560 states and 22527 transitions. [2024-12-02 06:27:53,997 INFO L78 Accepts]: Start accepts. Automaton has 19560 states and 22527 transitions. Word has length 113 [2024-12-02 06:27:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:27:53,998 INFO L471 AbstractCegarLoop]: Abstraction has 19560 states and 22527 transitions. [2024-12-02 06:27:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:27:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19560 states and 22527 transitions. [2024-12-02 06:27:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 06:27:54,000 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:27:54,000 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:27:54,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 06:27:54,000 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:27:54,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:27:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1309805366, now seen corresponding path program 1 times [2024-12-02 06:27:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:27:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968454778] [2024-12-02 06:27:54,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:27:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:27:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968454778] [2024-12-02 06:27:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968454778] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:27:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527213089] [2024-12-02 06:27:54,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:27:54,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:27:54,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:27:54,485 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:27:54,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 06:27:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:27:54,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 06:27:54,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:27:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:27:57,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:28:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:28:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527213089] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:28:00,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:28:00,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 45 [2024-12-02 06:28:00,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048514815] [2024-12-02 06:28:00,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:28:00,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-12-02 06:28:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:28:00,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-12-02 06:28:00,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2024-12-02 06:28:00,578 INFO L87 Difference]: Start difference. First operand 19560 states and 22527 transitions. Second operand has 45 states, 45 states have (on average 6.866666666666666) internal successors, (309), 45 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:28:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:28:27,228 INFO L93 Difference]: Finished difference Result 40766 states and 46844 transitions. [2024-12-02 06:28:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-12-02 06:28:27,229 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.866666666666666) internal successors, (309), 45 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-12-02 06:28:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:28:27,248 INFO L225 Difference]: With dead ends: 40766 [2024-12-02 06:28:27,248 INFO L226 Difference]: Without dead ends: 29873 [2024-12-02 06:28:27,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11737 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=5120, Invalid=31552, Unknown=0, NotChecked=0, Total=36672 [2024-12-02 06:28:27,253 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 3241 mSDsluCounter, 5193 mSDsCounter, 0 mSdLazyCounter, 5379 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3241 SdHoareTripleChecker+Valid, 5460 SdHoareTripleChecker+Invalid, 5498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 5379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:28:27,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3241 Valid, 5460 Invalid, 5498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 5379 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-12-02 06:28:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29873 states. [2024-12-02 06:28:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29873 to 18480. [2024-12-02 06:28:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18480 states, 18479 states have (on average 1.147139996753071) internal successors, (21198), 18479 states have internal predecessors, (21198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:28:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18480 states to 18480 states and 21198 transitions. [2024-12-02 06:28:29,139 INFO L78 Accepts]: Start accepts. Automaton has 18480 states and 21198 transitions. Word has length 114 [2024-12-02 06:28:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:28:29,140 INFO L471 AbstractCegarLoop]: Abstraction has 18480 states and 21198 transitions. [2024-12-02 06:28:29,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.866666666666666) internal successors, (309), 45 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:28:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 18480 states and 21198 transitions. [2024-12-02 06:28:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 06:28:29,143 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:28:29,144 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:28:29,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 06:28:29,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 06:28:29,344 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:28:29,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:28:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1146916283, now seen corresponding path program 1 times [2024-12-02 06:28:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:28:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509475366] [2024-12-02 06:28:29,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:28:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:28:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:28:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 37 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:28:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:28:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509475366] [2024-12-02 06:28:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509475366] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:28:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161765502] [2024-12-02 06:28:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:28:29,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:28:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:28:29,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:28:29,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 06:28:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:28:29,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 06:28:29,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:28:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:28:31,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:28:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:28:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161765502] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:28:33,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:28:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 41 [2024-12-02 06:28:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516514042] [2024-12-02 06:28:33,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:28:33,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-12-02 06:28:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:28:33,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-12-02 06:28:33,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 06:28:33,350 INFO L87 Difference]: Start difference. First operand 18480 states and 21198 transitions. Second operand has 41 states, 41 states have (on average 7.682926829268292) internal successors, (315), 41 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:28:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:28:41,759 INFO L93 Difference]: Finished difference Result 47201 states and 54517 transitions. [2024-12-02 06:28:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-12-02 06:28:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.682926829268292) internal successors, (315), 41 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-12-02 06:28:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:28:41,790 INFO L225 Difference]: With dead ends: 47201 [2024-12-02 06:28:41,791 INFO L226 Difference]: Without dead ends: 33479 [2024-12-02 06:28:41,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2724 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2389, Invalid=9167, Unknown=0, NotChecked=0, Total=11556 [2024-12-02 06:28:41,799 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 3257 mSDsluCounter, 2740 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3257 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:28:41,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3257 Valid, 2887 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 06:28:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33479 states. [2024-12-02 06:28:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33479 to 21408. [2024-12-02 06:28:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21408 states, 21407 states have (on average 1.1395337973560051) internal successors, (24394), 21407 states have internal predecessors, (24394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:28:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21408 states to 21408 states and 24394 transitions. [2024-12-02 06:28:44,053 INFO L78 Accepts]: Start accepts. Automaton has 21408 states and 24394 transitions. Word has length 114 [2024-12-02 06:28:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:28:44,053 INFO L471 AbstractCegarLoop]: Abstraction has 21408 states and 24394 transitions. [2024-12-02 06:28:44,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.682926829268292) internal successors, (315), 41 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:28:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21408 states and 24394 transitions. [2024-12-02 06:28:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-02 06:28:44,056 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:28:44,056 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:28:44,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 06:28:44,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 06:28:44,257 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:28:44,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:28:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 919616728, now seen corresponding path program 1 times [2024-12-02 06:28:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:28:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497195780] [2024-12-02 06:28:44,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:28:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:28:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:28:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:28:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:28:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497195780] [2024-12-02 06:28:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497195780] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:28:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242819886] [2024-12-02 06:28:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:28:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:28:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:28:46,407 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:28:46,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 06:28:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:28:46,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-12-02 06:28:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:28:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 57 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 06:28:47,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:28:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 68 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 06:28:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242819886] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:28:51,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:28:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 21] total 55 [2024-12-02 06:28:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985766629] [2024-12-02 06:28:51,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:28:51,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-12-02 06:28:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:28:51,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-12-02 06:28:51,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2684, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 06:28:51,309 INFO L87 Difference]: Start difference. First operand 21408 states and 24394 transitions. Second operand has 55 states, 55 states have (on average 5.836363636363636) internal successors, (321), 55 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:29:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:29:27,353 INFO L93 Difference]: Finished difference Result 34822 states and 39671 transitions. [2024-12-02 06:29:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2024-12-02 06:29:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.836363636363636) internal successors, (321), 55 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-12-02 06:29:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:29:27,374 INFO L225 Difference]: With dead ends: 34822 [2024-12-02 06:29:27,374 INFO L226 Difference]: Without dead ends: 29861 [2024-12-02 06:29:27,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46052 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=20564, Invalid=90658, Unknown=0, NotChecked=0, Total=111222 [2024-12-02 06:29:27,381 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 6619 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6619 SdHoareTripleChecker+Valid, 4724 SdHoareTripleChecker+Invalid, 4637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:29:27,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6619 Valid, 4724 Invalid, 4637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 4475 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 06:29:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29861 states. [2024-12-02 06:29:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29861 to 21460. [2024-12-02 06:29:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21460 states, 21459 states have (on average 1.1389160725103686) internal successors, (24440), 21459 states have internal predecessors, (24440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:29:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21460 states to 21460 states and 24440 transitions. [2024-12-02 06:29:29,539 INFO L78 Accepts]: Start accepts. Automaton has 21460 states and 24440 transitions. Word has length 115 [2024-12-02 06:29:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:29:29,540 INFO L471 AbstractCegarLoop]: Abstraction has 21460 states and 24440 transitions. [2024-12-02 06:29:29,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.836363636363636) internal successors, (321), 55 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:29:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21460 states and 24440 transitions. [2024-12-02 06:29:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 06:29:29,541 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:29:29,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 06:29:29,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 06:29:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 06:29:29,742 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:29:29,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:29:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -396525276, now seen corresponding path program 1 times [2024-12-02 06:29:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:29:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60506678] [2024-12-02 06:29:29,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:29:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:29:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:29:31,240 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 06:29:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:29:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60506678] [2024-12-02 06:29:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60506678] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:29:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952757999] [2024-12-02 06:29:31,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:29:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:29:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:29:31,242 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:29:31,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 06:29:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:29:31,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-02 06:29:31,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:29:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:29:33,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:29:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:29:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952757999] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:29:38,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:29:38,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 22] total 68 [2024-12-02 06:29:38,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572046440] [2024-12-02 06:29:38,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:29:38,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-12-02 06:29:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:29:38,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-12-02 06:29:38,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=4223, Unknown=0, NotChecked=0, Total=4556 [2024-12-02 06:29:38,628 INFO L87 Difference]: Start difference. First operand 21460 states and 24440 transitions. Second operand has 68 states, 68 states have (on average 4.9411764705882355) internal successors, (336), 68 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:32:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:32:51,222 INFO L93 Difference]: Finished difference Result 42238 states and 48040 transitions. [2024-12-02 06:32:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 564 states. [2024-12-02 06:32:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.9411764705882355) internal successors, (336), 68 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-12-02 06:32:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:32:51,241 INFO L225 Difference]: With dead ends: 42238 [2024-12-02 06:32:51,241 INFO L226 Difference]: Without dead ends: 30794 [2024-12-02 06:32:51,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168245 ImplicationChecksByTransitivity, 179.5s TimeCoverageRelationStatistics Valid=44547, Invalid=346703, Unknown=0, NotChecked=0, Total=391250 [2024-12-02 06:32:51,255 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 8239 mSDsluCounter, 12526 mSDsCounter, 0 mSdLazyCounter, 11623 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8239 SdHoareTripleChecker+Valid, 12893 SdHoareTripleChecker+Invalid, 12077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 11623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:32:51,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8239 Valid, 12893 Invalid, 12077 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [454 Valid, 11623 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2024-12-02 06:32:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30794 states. [2024-12-02 06:32:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30794 to 22810. [2024-12-02 06:32:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22810 states, 22809 states have (on average 1.1362620018413785) internal successors, (25917), 22809 states have internal predecessors, (25917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:32:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22810 states to 22810 states and 25917 transitions. [2024-12-02 06:32:53,867 INFO L78 Accepts]: Start accepts. Automaton has 22810 states and 25917 transitions. Word has length 117 [2024-12-02 06:32:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:32:53,867 INFO L471 AbstractCegarLoop]: Abstraction has 22810 states and 25917 transitions. [2024-12-02 06:32:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.9411764705882355) internal successors, (336), 68 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:32:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 22810 states and 25917 transitions. [2024-12-02 06:32:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 06:32:53,869 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:32:53,869 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 06:32:53,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-12-02 06:32:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:32:54,069 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:32:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:32:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 330096479, now seen corresponding path program 1 times [2024-12-02 06:32:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:32:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889097084] [2024-12-02 06:32:54,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:32:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:32:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:32:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:32:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:32:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889097084] [2024-12-02 06:32:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889097084] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:32:54,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025216595] [2024-12-02 06:32:54,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:32:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:32:54,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:32:54,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:32:54,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 06:32:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:32:54,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 06:32:54,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:32:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:32:56,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:32:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:32:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025216595] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:32:59,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:32:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 51 [2024-12-02 06:32:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790620770] [2024-12-02 06:32:59,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:32:59,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-12-02 06:32:59,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:32:59,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-12-02 06:32:59,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2024-12-02 06:32:59,671 INFO L87 Difference]: Start difference. First operand 22810 states and 25917 transitions. Second operand has 51 states, 51 states have (on average 6.078431372549019) internal successors, (310), 51 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 06:33:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:33:12,471 INFO L93 Difference]: Finished difference Result 35424 states and 40147 transitions. [2024-12-02 06:33:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-12-02 06:33:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.078431372549019) internal successors, (310), 51 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 117 [2024-12-02 06:33:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:33:12,493 INFO L225 Difference]: With dead ends: 35424 [2024-12-02 06:33:12,493 INFO L226 Difference]: Without dead ends: 30915 [2024-12-02 06:33:12,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3030, Invalid=12222, Unknown=0, NotChecked=0, Total=15252 [2024-12-02 06:33:12,499 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 2514 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2514 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:33:12,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2514 Valid, 3410 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 06:33:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2024-12-02 06:33:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 26798. [2024-12-02 06:33:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26798 states, 26797 states have (on average 1.1352390192932045) internal successors, (30421), 26797 states have internal predecessors, (30421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:33:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26798 states to 26798 states and 30421 transitions. [2024-12-02 06:33:16,155 INFO L78 Accepts]: Start accepts. Automaton has 26798 states and 30421 transitions. Word has length 117 [2024-12-02 06:33:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:33:16,155 INFO L471 AbstractCegarLoop]: Abstraction has 26798 states and 30421 transitions. [2024-12-02 06:33:16,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.078431372549019) internal successors, (310), 51 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 06:33:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26798 states and 30421 transitions. [2024-12-02 06:33:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 06:33:16,164 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:33:16,165 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, 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 06:33:16,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 06:33:16,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-12-02 06:33:16,365 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:33:16,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:33:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1186349875, now seen corresponding path program 1 times [2024-12-02 06:33:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:33:16,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187649700] [2024-12-02 06:33:16,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:33:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:33:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:33:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 144 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-02 06:33:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:33:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187649700] [2024-12-02 06:33:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187649700] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:33:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854899452] [2024-12-02 06:33:17,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:33:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:33:17,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:33:17,150 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:33:17,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 06:33:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:33:17,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 06:33:17,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:33:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 147 proven. 64 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-02 06:33:18,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:33:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-02 06:33:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854899452] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:33:21,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:33:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-12-02 06:33:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383951462] [2024-12-02 06:33:21,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:33:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-12-02 06:33:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:33:21,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-12-02 06:33:21,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 06:33:21,715 INFO L87 Difference]: Start difference. First operand 26798 states and 30421 transitions. Second operand has 39 states, 39 states have (on average 8.23076923076923) internal successors, (321), 39 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:33:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:33:47,415 INFO L93 Difference]: Finished difference Result 104302 states and 119483 transitions. [2024-12-02 06:33:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-12-02 06:33:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.23076923076923) internal successors, (321), 39 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-12-02 06:33:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:33:47,488 INFO L225 Difference]: With dead ends: 104302 [2024-12-02 06:33:47,488 INFO L226 Difference]: Without dead ends: 90763 [2024-12-02 06:33:47,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11085 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4445, Invalid=29965, Unknown=0, NotChecked=0, Total=34410 [2024-12-02 06:33:47,504 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 4211 mSDsluCounter, 4986 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4211 SdHoareTripleChecker+Valid, 5259 SdHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:33:47,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4211 Valid, 5259 Invalid, 4646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 4360 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 06:33:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90763 states. [2024-12-02 06:33:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90763 to 49665. [2024-12-02 06:33:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49665 states, 49664 states have (on average 1.139658505154639) internal successors, (56600), 49664 states have internal predecessors, (56600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:33:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49665 states to 49665 states and 56600 transitions. [2024-12-02 06:33:54,744 INFO L78 Accepts]: Start accepts. Automaton has 49665 states and 56600 transitions. Word has length 150 [2024-12-02 06:33:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:33:54,744 INFO L471 AbstractCegarLoop]: Abstraction has 49665 states and 56600 transitions. [2024-12-02 06:33:54,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.23076923076923) internal successors, (321), 39 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:33:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49665 states and 56600 transitions. [2024-12-02 06:33:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 06:33:54,756 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:33:54,756 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, 1, 1, 1, 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 06:33:54,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 06:33:54,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-12-02 06:33:54,957 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:33:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:33:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -24367415, now seen corresponding path program 1 times [2024-12-02 06:33:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:33:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078265196] [2024-12-02 06:33:54,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:33:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:33:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:33:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 144 proven. 88 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 06:33:56,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:33:56,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078265196] [2024-12-02 06:33:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078265196] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:33:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379373742] [2024-12-02 06:33:56,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:33:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:33:56,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:33:56,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:33:56,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 06:33:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:33:56,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-02 06:33:56,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:33:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 140 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-12-02 06:33:57,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:33:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 140 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-12-02 06:33:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379373742] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:33:58,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:33:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 40 [2024-12-02 06:33:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848283961] [2024-12-02 06:33:58,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:33:58,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-02 06:33:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:33:58,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-02 06:33:58,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 06:33:58,155 INFO L87 Difference]: Start difference. First operand 49665 states and 56600 transitions. Second operand has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:34:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:34:10,771 INFO L93 Difference]: Finished difference Result 95590 states and 108866 transitions. [2024-12-02 06:34:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-12-02 06:34:10,772 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-12-02 06:34:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:34:10,826 INFO L225 Difference]: With dead ends: 95590 [2024-12-02 06:34:10,826 INFO L226 Difference]: Without dead ends: 68780 [2024-12-02 06:34:10,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1469, Invalid=5841, Unknown=0, NotChecked=0, Total=7310 [2024-12-02 06:34:10,841 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 3090 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:34:10,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3090 Valid, 2677 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 06:34:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68780 states. [2024-12-02 06:34:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68780 to 51373. [2024-12-02 06:34:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51373 states, 51372 states have (on average 1.1317838511251266) internal successors, (58142), 51372 states have internal predecessors, (58142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:34:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51373 states to 51373 states and 58142 transitions. [2024-12-02 06:34:18,673 INFO L78 Accepts]: Start accepts. Automaton has 51373 states and 58142 transitions. Word has length 150 [2024-12-02 06:34:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:34:18,673 INFO L471 AbstractCegarLoop]: Abstraction has 51373 states and 58142 transitions. [2024-12-02 06:34:18,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:34:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 51373 states and 58142 transitions. [2024-12-02 06:34:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 06:34:18,678 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:34:18,678 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, 1, 1, 1, 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 06:34:18,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 06:34:18,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:34:18,879 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:34:18,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:34:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1975881260, now seen corresponding path program 1 times [2024-12-02 06:34:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:34:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908215231] [2024-12-02 06:34:18,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:34:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:34:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 06:34:18,969 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 06:34:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 06:34:19,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 06:34:19,025 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 06:34:19,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 06:34:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 06:34:19,030 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] [2024-12-02 06:34:19,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 06:34:19,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:34:19 BoogieIcfgContainer [2024-12-02 06:34:19,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 06:34:19,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 06:34:19,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 06:34:19,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 06:34:19,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:25:49" (3/4) ... [2024-12-02 06:34:19,128 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 06:34:19,227 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 146. [2024-12-02 06:34:19,313 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 06:34:19,314 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 06:34:19,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 06:34:19,315 INFO L158 Benchmark]: Toolchain (without parser) took 510826.91ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 117.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-12-02 06:34:19,315 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:34:19,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.30ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 103.5MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:34:19,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.04ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:34:19,315 INFO L158 Benchmark]: Boogie Preprocessor took 39.71ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:34:19,315 INFO L158 Benchmark]: RCFGBuilder took 404.09ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 77.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 06:34:19,316 INFO L158 Benchmark]: TraceAbstraction took 509929.23ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 76.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-12-02 06:34:19,316 INFO L158 Benchmark]: Witness Printer took 187.42ms. Allocated memory is still 4.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 06:34:19,317 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.28ms. Allocated memory is still 142.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.30ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 103.5MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.04ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.71ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.09ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 77.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 509929.23ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 76.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 187.42ms. Allocated memory is still 4.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 311]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] _Bool alive1 ; [L38] port_t p2 ; [L39] char p2_old ; [L40] char p2_new ; [L41] char id2 ; [L42] char st2 ; [L43] msg_t send2 ; [L44] _Bool mode2 ; [L45] _Bool alive2 ; [L46] port_t p3 ; [L47] char p3_old ; [L48] char p3_new ; [L49] char id3 ; [L50] char st3 ; [L51] msg_t send3 ; [L52] _Bool mode3 ; [L53] _Bool alive3 ; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L256] int c1 ; [L257] int i2 ; [L260] c1 = 0 [L261] r1 = __VERIFIER_nondet_uchar() [L262] id1 = __VERIFIER_nondet_char() [L263] st1 = __VERIFIER_nondet_char() [L264] send1 = __VERIFIER_nondet_char() [L265] mode1 = __VERIFIER_nondet_bool() [L266] alive1 = __VERIFIER_nondet_bool() [L267] id2 = __VERIFIER_nondet_char() [L268] st2 = __VERIFIER_nondet_char() [L269] send2 = __VERIFIER_nondet_char() [L270] mode2 = __VERIFIER_nondet_bool() [L271] alive2 = __VERIFIER_nondet_bool() [L272] id3 = __VERIFIER_nondet_char() [L273] st3 = __VERIFIER_nondet_char() [L274] send3 = __VERIFIER_nondet_char() [L275] mode3 = __VERIFIER_nondet_bool() [L276] alive3 = __VERIFIER_nondet_bool() [L277] CALL, EXPR init() [L159] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L162] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L164] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L165] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L166] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L167] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L168] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L169] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L170] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L171] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L173] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L174] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L175] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L176] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L177] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L178] COND TRUE (int )id2 != (int )id3 [L179] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L231] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L277] RET, EXPR init() [L277] i2 = init() [L278] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L278] RET assume_abort_if_not(i2) [L279] p1_old = nomsg [L280] p1_new = nomsg [L281] p2_old = nomsg [L282] p2_new = nomsg [L283] p3_old = nomsg [L284] p3_new = nomsg [L285] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L240] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L243] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L246] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=0] [L251] return (tmp); VAL [\result=0, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L311] reach_error() VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 509.8s, OverallIterations: 34, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 406.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53548 SdHoareTripleChecker+Valid, 35.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53548 mSDsluCounter, 52564 SdHoareTripleChecker+Invalid, 31.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48241 mSDsCounter, 2181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41804 IncrementalHoareTripleChecker+Invalid, 43985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2181 mSolverCounterUnsat, 4323 mSDtfsCounter, 41804 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5240 GetRequests, 2677 SyntacticMatches, 5 SemanticMatches, 2558 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308657 ImplicationChecksByTransitivity, 331.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51373occurred in iteration=33, InterpolantAutomatonStates: 2112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 200385 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 59.7s InterpolantComputationTime, 4372 NumberOfCodeBlocks, 4372 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5645 ConstructedInterpolants, 48 QuantifiedInterpolants, 92685 SizeOfPredicates, 78 NumberOfNonLiveVariables, 5626 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 61 InterpolantComputations, 19 PerfectInterpolantSequences, 2427/4185 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 06:34:19,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99b8c70-cc0a-450a-a554-d760f5a854ba/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