./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:39:29,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:39:29,866 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:39:29,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:39:29,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:39:29,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:39:29,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:39:29,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:39:29,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:39:29,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:39:29,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:39:29,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:39:29,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:39:29,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:39:29,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:39:29,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:39:29,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:39:29,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:39:29,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:39:29,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:39:29,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:39:29,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:39:29,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:39:29,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:39:29,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:39:29,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:39:29,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:39:29,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:39:29,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:39:29,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:29,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:29,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:29,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:29,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:39:29,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:29,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:29,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:29,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:29,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:39:29,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:39:29,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:39:29,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:39:29,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:39:29,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:39:29,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:39:29,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:39:29,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:39:29,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:39:29,937 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_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-11-28 02:39:30,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:39:30,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:39:30,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:39:30,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:39:30,323 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:39:30,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-28 02:39:33,913 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/3d808e193/449a5ce3a1d343d98e841e03854b0287/FLAG67a688a58 [2024-11-28 02:39:34,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:39:34,282 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-28 02:39:34,293 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/3d808e193/449a5ce3a1d343d98e841e03854b0287/FLAG67a688a58 [2024-11-28 02:39:34,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/3d808e193/449a5ce3a1d343d98e841e03854b0287 [2024-11-28 02:39:34,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:39:34,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:39:34,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:34,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:39:34,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:39:34,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6105c26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34, skipping insertion in model container [2024-11-28 02:39:34,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:39:34,669 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_0e6529ba-2e39-434c-920f-f069d20b9bbd/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-28 02:39:34,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:34,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:39:34,757 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_0e6529ba-2e39-434c-920f-f069d20b9bbd/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-28 02:39:34,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:34,775 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:39:34,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34 WrapperNode [2024-11-28 02:39:34,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:34,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:34,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:39:34,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:39:34,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,832 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-11-28 02:39:34,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:34,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:39:34,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:39:34,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:39:34,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,863 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-11-28 02:39:34,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:39:34,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:39:34,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:39:34,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:39:34,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (1/1) ... [2024-11-28 02:39:34,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:34,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:34,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:39:34,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:39:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:39:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:39:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:39:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:39:35,113 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:39:35,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:39:35,715 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-28 02:39:35,716 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:39:35,732 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:39:35,732 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 02:39:35,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:35 BoogieIcfgContainer [2024-11-28 02:39:35,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:39:35,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:39:35,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:39:35,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:39:35,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:39:34" (1/3) ... [2024-11-28 02:39:35,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1254e16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:35, skipping insertion in model container [2024-11-28 02:39:35,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:34" (2/3) ... [2024-11-28 02:39:35,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1254e16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:35, skipping insertion in model container [2024-11-28 02:39:35,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:35" (3/3) ... [2024-11-28 02:39:35,746 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-28 02:39:35,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:39:35,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c that has 1 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:39:35,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:39:35,894 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;@79add3c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:39:35,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:39:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 66 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:39:35,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:35,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:35,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:35,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 3396944, now seen corresponding path program 1 times [2024-11-28 02:39:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261998438] [2024-11-28 02:39:35,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:36,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261998438] [2024-11-28 02:39:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261998438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695696498] [2024-11-28 02:39:36,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:36,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:36,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:36,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:36,542 INFO L87 Difference]: Start difference. First operand has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 66 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:36,698 INFO L93 Difference]: Finished difference Result 155 states and 250 transitions. [2024-11-28 02:39:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-28 02:39:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:36,709 INFO L225 Difference]: With dead ends: 155 [2024-11-28 02:39:36,711 INFO L226 Difference]: Without dead ends: 103 [2024-11-28 02:39:36,714 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-11-28 02:39:36,720 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 62 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:36,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 387 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-28 02:39:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2024-11-28 02:39:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-11-28 02:39:36,763 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 26 [2024-11-28 02:39:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:36,763 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-11-28 02:39:36,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-11-28 02:39:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 02:39:36,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:36,765 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-11-28 02:39:36,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:39:36,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:36,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1598475046, now seen corresponding path program 1 times [2024-11-28 02:39:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:36,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593757610] [2024-11-28 02:39:36,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593757610] [2024-11-28 02:39:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593757610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864849049] [2024-11-28 02:39:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:36,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:36,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:36,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:36,948 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:36,990 INFO L93 Difference]: Finished difference Result 135 states and 198 transitions. [2024-11-28 02:39:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-28 02:39:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:36,993 INFO L225 Difference]: With dead ends: 135 [2024-11-28 02:39:36,993 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 02:39:36,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:36,994 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 42 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:36,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 02:39:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-28 02:39:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-28 02:39:37,010 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 42 [2024-11-28 02:39:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-28 02:39:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-28 02:39:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 02:39:37,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:37,011 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-11-28 02:39:37,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:39:37,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:37,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1802236571, now seen corresponding path program 1 times [2024-11-28 02:39:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990217323] [2024-11-28 02:39:37,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990217323] [2024-11-28 02:39:37,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990217323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:37,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122071150] [2024-11-28 02:39:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:37,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:37,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:37,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:37,225 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:37,375 INFO L93 Difference]: Finished difference Result 373 states and 573 transitions. [2024-11-28 02:39:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:37,376 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-11-28 02:39:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:37,378 INFO L225 Difference]: With dead ends: 373 [2024-11-28 02:39:37,378 INFO L226 Difference]: Without dead ends: 303 [2024-11-28 02:39:37,379 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-11-28 02:39:37,380 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 310 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:37,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 359 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-28 02:39:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 161. [2024-11-28 02:39:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.4875) internal successors, (238), 160 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2024-11-28 02:39:37,401 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 42 [2024-11-28 02:39:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:37,401 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2024-11-28 02:39:37,402 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-11-28 02:39:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2024-11-28 02:39:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 02:39:37,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:37,403 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-11-28 02:39:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:39:37,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -348564613, now seen corresponding path program 1 times [2024-11-28 02:39:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377339901] [2024-11-28 02:39:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377339901] [2024-11-28 02:39:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377339901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243768350] [2024-11-28 02:39:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:37,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:37,798 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:37,848 INFO L93 Difference]: Finished difference Result 175 states and 255 transitions. [2024-11-28 02:39:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-28 02:39:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:37,850 INFO L225 Difference]: With dead ends: 175 [2024-11-28 02:39:37,854 INFO L226 Difference]: Without dead ends: 173 [2024-11-28 02:39:37,854 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-11-28 02:39:37,855 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:37,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-28 02:39:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-28 02:39:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-28 02:39:37,882 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 43 [2024-11-28 02:39:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:37,883 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-28 02:39:37,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-28 02:39:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 02:39:37,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:37,885 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-11-28 02:39:37,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:39:37,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:37,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2131977331, now seen corresponding path program 1 times [2024-11-28 02:39:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:37,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734337895] [2024-11-28 02:39:37,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734337895] [2024-11-28 02:39:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734337895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:38,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276483417] [2024-11-28 02:39:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:38,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:38,037 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:38,071 INFO L93 Difference]: Finished difference Result 443 states and 654 transitions. [2024-11-28 02:39:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:38,072 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-11-28 02:39:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:38,075 INFO L225 Difference]: With dead ends: 443 [2024-11-28 02:39:38,075 INFO L226 Difference]: Without dead ends: 293 [2024-11-28 02:39:38,076 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-11-28 02:39:38,078 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:38,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-28 02:39:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-11-28 02:39:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4551724137931035) internal successors, (422), 290 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 422 transitions. [2024-11-28 02:39:38,129 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 422 transitions. Word has length 44 [2024-11-28 02:39:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:38,133 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 422 transitions. [2024-11-28 02:39:38,133 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-11-28 02:39:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 422 transitions. [2024-11-28 02:39:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 02:39:38,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:38,135 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-11-28 02:39:38,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:39:38,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1708095991, now seen corresponding path program 1 times [2024-11-28 02:39:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263468751] [2024-11-28 02:39:38,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263468751] [2024-11-28 02:39:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263468751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423898522] [2024-11-28 02:39:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:38,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:38,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:38,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:38,287 INFO L87 Difference]: Start difference. First operand 291 states and 422 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:38,342 INFO L93 Difference]: Finished difference Result 566 states and 832 transitions. [2024-11-28 02:39:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:38,343 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-11-28 02:39:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:38,345 INFO L225 Difference]: With dead ends: 566 [2024-11-28 02:39:38,348 INFO L226 Difference]: Without dead ends: 416 [2024-11-28 02:39:38,349 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-11-28 02:39:38,350 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:38,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-28 02:39:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-11-28 02:39:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.450363196125908) internal successors, (599), 413 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 599 transitions. [2024-11-28 02:39:38,394 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 599 transitions. Word has length 44 [2024-11-28 02:39:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:38,396 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 599 transitions. [2024-11-28 02:39:38,396 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-11-28 02:39:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 599 transitions. [2024-11-28 02:39:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 02:39:38,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:38,401 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-11-28 02:39:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:39:38,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:38,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1168011820, now seen corresponding path program 1 times [2024-11-28 02:39:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:38,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72746399] [2024-11-28 02:39:38,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72746399] [2024-11-28 02:39:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72746399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386807988] [2024-11-28 02:39:38,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:38,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:38,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:38,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:38,520 INFO L87 Difference]: Start difference. First operand 414 states and 599 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:38,576 INFO L93 Difference]: Finished difference Result 1094 states and 1577 transitions. [2024-11-28 02:39:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:38,577 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-11-28 02:39:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:38,584 INFO L225 Difference]: With dead ends: 1094 [2024-11-28 02:39:38,586 INFO L226 Difference]: Without dead ends: 706 [2024-11-28 02:39:38,588 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-11-28 02:39:38,589 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:38,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-28 02:39:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2024-11-28 02:39:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.4096728307254622) internal successors, (991), 703 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 991 transitions. [2024-11-28 02:39:38,657 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 991 transitions. Word has length 45 [2024-11-28 02:39:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:38,658 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 991 transitions. [2024-11-28 02:39:38,658 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-11-28 02:39:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 991 transitions. [2024-11-28 02:39:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 02:39:38,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:38,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:39:38,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 936276697, now seen corresponding path program 1 times [2024-11-28 02:39:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897667340] [2024-11-28 02:39:38,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897667340] [2024-11-28 02:39:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897667340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257437016] [2024-11-28 02:39:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:38,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:38,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:38,869 INFO L87 Difference]: Start difference. First operand 704 states and 991 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:38,916 INFO L93 Difference]: Finished difference Result 1384 states and 1957 transitions. [2024-11-28 02:39:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:38,917 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-11-28 02:39:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:38,923 INFO L225 Difference]: With dead ends: 1384 [2024-11-28 02:39:38,924 INFO L226 Difference]: Without dead ends: 706 [2024-11-28 02:39:38,925 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-11-28 02:39:38,925 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:38,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-28 02:39:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2024-11-28 02:39:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.3926031294452348) internal successors, (979), 703 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 979 transitions. [2024-11-28 02:39:38,996 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 979 transitions. Word has length 64 [2024-11-28 02:39:38,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:38,997 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 979 transitions. [2024-11-28 02:39:38,997 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-11-28 02:39:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 979 transitions. [2024-11-28 02:39:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 02:39:39,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:39,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:39,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:39:39,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:39,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -548746792, now seen corresponding path program 1 times [2024-11-28 02:39:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:39,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273157733] [2024-11-28 02:39:39,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:39:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273157733] [2024-11-28 02:39:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273157733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:39:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154000664] [2024-11-28 02:39:39,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:39,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:39,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:39,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:39:39,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:39:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:39,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 02:39:39,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:39:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:40,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:39:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:41,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154000664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:39:41,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:39:41,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 8] total 13 [2024-11-28 02:39:41,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405972069] [2024-11-28 02:39:41,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:39:41,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:39:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:41,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:39:41,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:39:41,080 INFO L87 Difference]: Start difference. First operand 704 states and 979 transitions. Second operand has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:42,355 INFO L93 Difference]: Finished difference Result 2938 states and 4114 transitions. [2024-11-28 02:39:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 02:39:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-28 02:39:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:42,367 INFO L225 Difference]: With dead ends: 2938 [2024-11-28 02:39:42,368 INFO L226 Difference]: Without dead ends: 2464 [2024-11-28 02:39:42,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2024-11-28 02:39:42,371 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 579 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:42,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 810 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:39:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-11-28 02:39:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2452. [2024-11-28 02:39:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2451 states have (on average 1.3818849449204407) internal successors, (3387), 2451 states have internal predecessors, (3387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3387 transitions. [2024-11-28 02:39:42,517 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3387 transitions. Word has length 64 [2024-11-28 02:39:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:42,518 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3387 transitions. [2024-11-28 02:39:42,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3387 transitions. [2024-11-28 02:39:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 02:39:42,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:42,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:42,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:39:42,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:42,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:42,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1814113776, now seen corresponding path program 1 times [2024-11-28 02:39:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:42,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484501539] [2024-11-28 02:39:42,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 02:39:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484501539] [2024-11-28 02:39:42,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484501539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333180380] [2024-11-28 02:39:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:42,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:42,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:42,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:42,923 INFO L87 Difference]: Start difference. First operand 2452 states and 3387 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:43,196 INFO L93 Difference]: Finished difference Result 6104 states and 8497 transitions. [2024-11-28 02:39:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-28 02:39:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:43,221 INFO L225 Difference]: With dead ends: 6104 [2024-11-28 02:39:43,222 INFO L226 Difference]: Without dead ends: 4818 [2024-11-28 02:39:43,227 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-11-28 02:39:43,230 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 215 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:43,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 381 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2024-11-28 02:39:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3652. [2024-11-28 02:39:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 3651 states have (on average 1.376883045740893) internal successors, (5027), 3651 states have internal predecessors, (5027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5027 transitions. [2024-11-28 02:39:43,480 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5027 transitions. Word has length 65 [2024-11-28 02:39:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:43,480 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 5027 transitions. [2024-11-28 02:39:43,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5027 transitions. [2024-11-28 02:39:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 02:39:43,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:43,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:43,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:39:43,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:43,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 301231570, now seen corresponding path program 1 times [2024-11-28 02:39:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636056080] [2024-11-28 02:39:43,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 02:39:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:43,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636056080] [2024-11-28 02:39:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636056080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:43,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138036747] [2024-11-28 02:39:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:43,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:43,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:43,640 INFO L87 Difference]: Start difference. First operand 3652 states and 5027 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:43,906 INFO L93 Difference]: Finished difference Result 7304 states and 10137 transitions. [2024-11-28 02:39:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:43,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-28 02:39:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:43,934 INFO L225 Difference]: With dead ends: 7304 [2024-11-28 02:39:43,934 INFO L226 Difference]: Without dead ends: 6018 [2024-11-28 02:39:43,937 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-11-28 02:39:43,938 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 223 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:43,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 370 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2024-11-28 02:39:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 4852. [2024-11-28 02:39:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4851 states have (on average 1.3743558029272316) internal successors, (6667), 4851 states have internal predecessors, (6667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6667 transitions. [2024-11-28 02:39:44,222 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6667 transitions. Word has length 65 [2024-11-28 02:39:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 6667 transitions. [2024-11-28 02:39:44,223 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-11-28 02:39:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6667 transitions. [2024-11-28 02:39:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 02:39:44,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:44,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:39:44,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1117470959, now seen corresponding path program 1 times [2024-11-28 02:39:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524376547] [2024-11-28 02:39:44,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:39:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524376547] [2024-11-28 02:39:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524376547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142517359] [2024-11-28 02:39:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:44,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:44,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:44,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:44,378 INFO L87 Difference]: Start difference. First operand 4852 states and 6667 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:44,679 INFO L93 Difference]: Finished difference Result 8192 states and 11323 transitions. [2024-11-28 02:39:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:44,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-28 02:39:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:44,711 INFO L225 Difference]: With dead ends: 8192 [2024-11-28 02:39:44,711 INFO L226 Difference]: Without dead ends: 7106 [2024-11-28 02:39:44,715 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-11-28 02:39:44,715 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:44,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 401 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2024-11-28 02:39:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 5940. [2024-11-28 02:39:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5940 states, 5939 states have (on average 1.371443003872706) internal successors, (8145), 5939 states have internal predecessors, (8145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5940 states to 5940 states and 8145 transitions. [2024-11-28 02:39:45,111 INFO L78 Accepts]: Start accepts. Automaton has 5940 states and 8145 transitions. Word has length 65 [2024-11-28 02:39:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:45,111 INFO L471 AbstractCegarLoop]: Abstraction has 5940 states and 8145 transitions. [2024-11-28 02:39:45,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5940 states and 8145 transitions. [2024-11-28 02:39:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 02:39:45,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:45,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:39:45,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1810346494, now seen corresponding path program 1 times [2024-11-28 02:39:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16185691] [2024-11-28 02:39:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16185691] [2024-11-28 02:39:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16185691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932902109] [2024-11-28 02:39:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:45,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:45,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:45,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:45,239 INFO L87 Difference]: Start difference. First operand 5940 states and 8145 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:45,357 INFO L93 Difference]: Finished difference Result 8519 states and 11639 transitions. [2024-11-28 02:39:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:45,357 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-11-28 02:39:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:45,367 INFO L225 Difference]: With dead ends: 8519 [2024-11-28 02:39:45,367 INFO L226 Difference]: Without dead ends: 2605 [2024-11-28 02:39:45,373 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-11-28 02:39:45,374 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:45,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2024-11-28 02:39:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2083. [2024-11-28 02:39:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.3592699327569644) internal successors, (2830), 2082 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2830 transitions. [2024-11-28 02:39:45,470 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2830 transitions. Word has length 68 [2024-11-28 02:39:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:45,470 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 2830 transitions. [2024-11-28 02:39:45,470 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-11-28 02:39:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2830 transitions. [2024-11-28 02:39:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 02:39:45,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:45,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:45,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:39:45,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:45,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash 670844669, now seen corresponding path program 1 times [2024-11-28 02:39:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:45,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401624345] [2024-11-28 02:39:45,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401624345] [2024-11-28 02:39:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401624345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:39:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94197951] [2024-11-28 02:39:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:46,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:39:46,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:39:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:46,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-28 02:39:46,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:39:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:47,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:39:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94197951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:39:49,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:39:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-28 02:39:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174725156] [2024-11-28 02:39:49,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:39:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 02:39:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 02:39:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-28 02:39:49,828 INFO L87 Difference]: Start difference. First operand 2083 states and 2830 transitions. Second operand has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:02,629 INFO L93 Difference]: Finished difference Result 26458 states and 36856 transitions. [2024-11-28 02:40:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-11-28 02:40:02,630 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-11-28 02:40:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:02,695 INFO L225 Difference]: With dead ends: 26458 [2024-11-28 02:40:02,696 INFO L226 Difference]: Without dead ends: 24441 [2024-11-28 02:40:02,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8013 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3753, Invalid=18299, Unknown=0, NotChecked=0, Total=22052 [2024-11-28 02:40:02,709 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 6292 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6292 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:02,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6292 Valid, 1501 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 02:40:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24441 states. [2024-11-28 02:40:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24441 to 12297. [2024-11-28 02:40:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12296 states have (on average 1.3648340923877684) internal successors, (16782), 12296 states have internal predecessors, (16782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16782 transitions. [2024-11-28 02:40:03,402 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16782 transitions. Word has length 68 [2024-11-28 02:40:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:03,403 INFO L471 AbstractCegarLoop]: Abstraction has 12297 states and 16782 transitions. [2024-11-28 02:40:03,403 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-11-28 02:40:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16782 transitions. [2024-11-28 02:40:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 02:40:03,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:03,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:03,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:40:03,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 02:40:03,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1260630787, now seen corresponding path program 1 times [2024-11-28 02:40:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:03,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460385601] [2024-11-28 02:40:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:03,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460385601] [2024-11-28 02:40:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460385601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:03,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:03,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995061427] [2024-11-28 02:40:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:03,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:03,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:03,690 INFO L87 Difference]: Start difference. First operand 12297 states and 16782 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:04,155 INFO L93 Difference]: Finished difference Result 25890 states and 35135 transitions. [2024-11-28 02:40:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:04,163 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-11-28 02:40:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:04,200 INFO L225 Difference]: With dead ends: 25890 [2024-11-28 02:40:04,200 INFO L226 Difference]: Without dead ends: 13742 [2024-11-28 02:40:04,213 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-11-28 02:40:04,214 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:04,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:40:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13742 states. [2024-11-28 02:40:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13742 to 10135. [2024-11-28 02:40:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10135 states, 10134 states have (on average 1.3415235839747386) internal successors, (13595), 10134 states have internal predecessors, (13595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10135 states to 10135 states and 13595 transitions. [2024-11-28 02:40:04,771 INFO L78 Accepts]: Start accepts. Automaton has 10135 states and 13595 transitions. Word has length 68 [2024-11-28 02:40:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:04,772 INFO L471 AbstractCegarLoop]: Abstraction has 10135 states and 13595 transitions. [2024-11-28 02:40:04,773 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-11-28 02:40:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10135 states and 13595 transitions. [2024-11-28 02:40:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 02:40:04,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:04,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:40:04,775 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -867529701, now seen corresponding path program 1 times [2024-11-28 02:40:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608790266] [2024-11-28 02:40:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:04,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608790266] [2024-11-28 02:40:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608790266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:04,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:04,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951940512] [2024-11-28 02:40:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:04,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:04,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:04,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:04,859 INFO L87 Difference]: Start difference. First operand 10135 states and 13595 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:05,290 INFO L93 Difference]: Finished difference Result 24081 states and 32161 transitions. [2024-11-28 02:40:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:05,291 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-11-28 02:40:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:05,325 INFO L225 Difference]: With dead ends: 24081 [2024-11-28 02:40:05,325 INFO L226 Difference]: Without dead ends: 14147 [2024-11-28 02:40:05,334 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-11-28 02:40:05,335 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:05,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:40:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2024-11-28 02:40:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 14145. [2024-11-28 02:40:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14145 states, 14144 states have (on average 1.3120757918552035) internal successors, (18558), 14144 states have internal predecessors, (18558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 18558 transitions. [2024-11-28 02:40:06,004 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 18558 transitions. Word has length 69 [2024-11-28 02:40:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:06,005 INFO L471 AbstractCegarLoop]: Abstraction has 14145 states and 18558 transitions. [2024-11-28 02:40:06,005 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-11-28 02:40:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 18558 transitions. [2024-11-28 02:40:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 02:40:06,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:06,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:40:06,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 872422127, now seen corresponding path program 1 times [2024-11-28 02:40:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345396696] [2024-11-28 02:40:06,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345396696] [2024-11-28 02:40:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345396696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211322019] [2024-11-28 02:40:08,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:08,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:08,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:40:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:08,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 02:40:08,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:11,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211322019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:40:16,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:40:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 54 [2024-11-28 02:40:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361762508] [2024-11-28 02:40:16,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:40:16,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 02:40:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:16,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 02:40:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2559, Unknown=0, NotChecked=0, Total=2862 [2024-11-28 02:40:16,782 INFO L87 Difference]: Start difference. First operand 14145 states and 18558 transitions. Second operand has 54 states, 54 states have (on average 3.5925925925925926) internal successors, (194), 54 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:12,266 INFO L93 Difference]: Finished difference Result 119673 states and 153499 transitions. [2024-11-28 02:43:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 518 states. [2024-11-28 02:43:12,267 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.5925925925925926) internal successors, (194), 54 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 02:43:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:12,457 INFO L225 Difference]: With dead ends: 119673 [2024-11-28 02:43:12,457 INFO L226 Difference]: Without dead ends: 105585 [2024-11-28 02:43:12,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153587 ImplicationChecksByTransitivity, 162.6s TimeCoverageRelationStatistics Valid=60728, Invalid=263602, Unknown=0, NotChecked=0, Total=324330 [2024-11-28 02:43:12,514 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 10278 mSDsluCounter, 5928 mSDsCounter, 0 mSdLazyCounter, 7154 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10278 SdHoareTripleChecker+Valid, 6028 SdHoareTripleChecker+Invalid, 7696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 7154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:12,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10278 Valid, 6028 Invalid, 7696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [542 Valid, 7154 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-28 02:43:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105585 states. [2024-11-28 02:43:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105585 to 31084. [2024-11-28 02:43:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31084 states, 31083 states have (on average 1.2967216806614548) internal successors, (40306), 31083 states have internal predecessors, (40306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31084 states to 31084 states and 40306 transitions. [2024-11-28 02:43:14,901 INFO L78 Accepts]: Start accepts. Automaton has 31084 states and 40306 transitions. Word has length 70 [2024-11-28 02:43:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:14,902 INFO L471 AbstractCegarLoop]: Abstraction has 31084 states and 40306 transitions. [2024-11-28 02:43:14,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.5925925925925926) internal successors, (194), 54 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31084 states and 40306 transitions. [2024-11-28 02:43:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 02:43:14,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:14,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:14,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:43:15,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:43:15,110 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -756654483, now seen corresponding path program 1 times [2024-11-28 02:43:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361119930] [2024-11-28 02:43:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:15,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361119930] [2024-11-28 02:43:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361119930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656893695] [2024-11-28 02:43:15,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:15,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:15,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:15,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:15,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:43:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:15,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:43:15,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:15,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656893695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:43:15,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:43:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-28 02:43:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308186035] [2024-11-28 02:43:15,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:43:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:43:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:15,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:43:15,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:43:15,829 INFO L87 Difference]: Start difference. First operand 31084 states and 40306 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:17,917 INFO L93 Difference]: Finished difference Result 56484 states and 73573 transitions. [2024-11-28 02:43:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:43:17,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 02:43:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:17,961 INFO L225 Difference]: With dead ends: 56484 [2024-11-28 02:43:17,962 INFO L226 Difference]: Without dead ends: 29406 [2024-11-28 02:43:17,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:43:17,982 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 435 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:17,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 285 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:43:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29406 states. [2024-11-28 02:43:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29406 to 26252. [2024-11-28 02:43:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26252 states, 26251 states have (on average 1.2761799550493313) internal successors, (33501), 26251 states have internal predecessors, (33501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26252 states to 26252 states and 33501 transitions. [2024-11-28 02:43:19,601 INFO L78 Accepts]: Start accepts. Automaton has 26252 states and 33501 transitions. Word has length 70 [2024-11-28 02:43:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:19,601 INFO L471 AbstractCegarLoop]: Abstraction has 26252 states and 33501 transitions. [2024-11-28 02:43:19,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26252 states and 33501 transitions. [2024-11-28 02:43:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 02:43:19,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:19,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:19,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:43:19,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 02:43:19,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2087162715, now seen corresponding path program 1 times [2024-11-28 02:43:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689846234] [2024-11-28 02:43:19,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:19,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689846234] [2024-11-28 02:43:19,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689846234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:19,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:19,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:43:19,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292193767] [2024-11-28 02:43:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:19,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:43:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:19,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:43:19,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:43:19,957 INFO L87 Difference]: Start difference. First operand 26252 states and 33501 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:22,611 INFO L93 Difference]: Finished difference Result 72811 states and 92764 transitions. [2024-11-28 02:43:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:43:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-28 02:43:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:22,690 INFO L225 Difference]: With dead ends: 72811 [2024-11-28 02:43:22,690 INFO L226 Difference]: Without dead ends: 47007 [2024-11-28 02:43:22,720 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-11-28 02:43:22,720 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 28 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:22,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:43:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47007 states. [2024-11-28 02:43:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47007 to 38327. [2024-11-28 02:43:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38327 states, 38326 states have (on average 1.2530397119448937) internal successors, (48024), 38326 states have internal predecessors, (48024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38327 states to 38327 states and 48024 transitions. [2024-11-28 02:43:24,905 INFO L78 Accepts]: Start accepts. Automaton has 38327 states and 48024 transitions. Word has length 72 [2024-11-28 02:43:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:24,906 INFO L471 AbstractCegarLoop]: Abstraction has 38327 states and 48024 transitions. [2024-11-28 02:43:24,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38327 states and 48024 transitions. [2024-11-28 02:43:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 02:43:24,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:24,925 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:24,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:43:24,925 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1098493017, now seen corresponding path program 1 times [2024-11-28 02:43:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339233422] [2024-11-28 02:43:24,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 02:43:25,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:25,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339233422] [2024-11-28 02:43:25,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339233422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:25,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:25,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:43:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503503123] [2024-11-28 02:43:25,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:25,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:43:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:25,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:43:25,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:43:25,014 INFO L87 Difference]: Start difference. First operand 38327 states and 48024 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:26,592 INFO L93 Difference]: Finished difference Result 45411 states and 56579 transitions. [2024-11-28 02:43:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:43:26,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-28 02:43:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:26,622 INFO L225 Difference]: With dead ends: 45411 [2024-11-28 02:43:26,622 INFO L226 Difference]: Without dead ends: 29476 [2024-11-28 02:43:26,635 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-11-28 02:43:26,636 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:26,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:43:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29476 states. [2024-11-28 02:43:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29476 to 29474. [2024-11-28 02:43:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29474 states, 29473 states have (on average 1.2274963525938996) internal successors, (36178), 29473 states have internal predecessors, (36178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29474 states to 29474 states and 36178 transitions. [2024-11-28 02:43:28,580 INFO L78 Accepts]: Start accepts. Automaton has 29474 states and 36178 transitions. Word has length 110 [2024-11-28 02:43:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:28,580 INFO L471 AbstractCegarLoop]: Abstraction has 29474 states and 36178 transitions. [2024-11-28 02:43:28,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29474 states and 36178 transitions. [2024-11-28 02:43:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:43:28,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:28,599 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:28,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:43:28,600 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:28,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1551555846, now seen corresponding path program 1 times [2024-11-28 02:43:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345805325] [2024-11-28 02:43:28,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 77 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:43:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345805325] [2024-11-28 02:43:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345805325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435511154] [2024-11-28 02:43:28,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:28,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:28,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:28,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:43:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:28,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:43:28,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:43:29,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:43:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435511154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:43:29,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:43:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-11-28 02:43:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394915552] [2024-11-28 02:43:29,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:43:29,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:43:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:29,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:43:29,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:43:29,457 INFO L87 Difference]: Start difference. First operand 29474 states and 36178 transitions. Second operand has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:31,345 INFO L93 Difference]: Finished difference Result 57300 states and 70144 transitions. [2024-11-28 02:43:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:43:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-28 02:43:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:31,398 INFO L225 Difference]: With dead ends: 57300 [2024-11-28 02:43:31,398 INFO L226 Difference]: Without dead ends: 34347 [2024-11-28 02:43:31,421 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-11-28 02:43:31,422 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 315 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:31,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 364 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:43:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2024-11-28 02:43:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 30017. [2024-11-28 02:43:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30017 states, 30016 states have (on average 1.2120868869936035) internal successors, (36382), 30016 states have internal predecessors, (36382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30017 states to 30017 states and 36382 transitions. [2024-11-28 02:43:33,282 INFO L78 Accepts]: Start accepts. Automaton has 30017 states and 36382 transitions. Word has length 112 [2024-11-28 02:43:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:33,282 INFO L471 AbstractCegarLoop]: Abstraction has 30017 states and 36382 transitions. [2024-11-28 02:43:33,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 30017 states and 36382 transitions. [2024-11-28 02:43:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:43:33,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:33,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:33,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:43:33,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 02:43:33,489 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1546189703, now seen corresponding path program 1 times [2024-11-28 02:43:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212784447] [2024-11-28 02:43:33,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 02:43:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212784447] [2024-11-28 02:43:33,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212784447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:33,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:33,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:43:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302589425] [2024-11-28 02:43:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:33,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:43:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:33,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:43:33,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:43:33,597 INFO L87 Difference]: Start difference. First operand 30017 states and 36382 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:34,625 INFO L93 Difference]: Finished difference Result 45577 states and 55534 transitions. [2024-11-28 02:43:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:43:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-28 02:43:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:34,650 INFO L225 Difference]: With dead ends: 45577 [2024-11-28 02:43:34,650 INFO L226 Difference]: Without dead ends: 17300 [2024-11-28 02:43:34,663 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-11-28 02:43:34,666 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:34,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:43:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17300 states. [2024-11-28 02:43:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17300 to 15463. [2024-11-28 02:43:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15463 states, 15462 states have (on average 1.2026904669512353) internal successors, (18596), 15462 states have internal predecessors, (18596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15463 states to 15463 states and 18596 transitions. [2024-11-28 02:43:35,388 INFO L78 Accepts]: Start accepts. Automaton has 15463 states and 18596 transitions. Word has length 112 [2024-11-28 02:43:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:35,388 INFO L471 AbstractCegarLoop]: Abstraction has 15463 states and 18596 transitions. [2024-11-28 02:43:35,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15463 states and 18596 transitions. [2024-11-28 02:43:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:43:35,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:35,393 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:35,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:43:35,393 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:35,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1433700341, now seen corresponding path program 1 times [2024-11-28 02:43:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:35,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008559649] [2024-11-28 02:43:35,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-28 02:43:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008559649] [2024-11-28 02:43:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008559649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:43:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524073920] [2024-11-28 02:43:35,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:35,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:43:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:35,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:43:35,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:43:35,477 INFO L87 Difference]: Start difference. First operand 15463 states and 18596 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:36,339 INFO L93 Difference]: Finished difference Result 20933 states and 25063 transitions. [2024-11-28 02:43:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:43:36,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-28 02:43:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:36,357 INFO L225 Difference]: With dead ends: 20933 [2024-11-28 02:43:36,357 INFO L226 Difference]: Without dead ends: 13432 [2024-11-28 02:43:36,362 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-11-28 02:43:36,362 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 24 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:36,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 208 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:43:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2024-11-28 02:43:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 12358. [2024-11-28 02:43:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12358 states, 12357 states have (on average 1.1766610018612933) internal successors, (14540), 12357 states have internal predecessors, (14540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12358 states to 12358 states and 14540 transitions. [2024-11-28 02:43:36,922 INFO L78 Accepts]: Start accepts. Automaton has 12358 states and 14540 transitions. Word has length 112 [2024-11-28 02:43:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:36,922 INFO L471 AbstractCegarLoop]: Abstraction has 12358 states and 14540 transitions. [2024-11-28 02:43:36,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12358 states and 14540 transitions. [2024-11-28 02:43:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:43:36,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:36,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:43:36,928 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 535754931, now seen corresponding path program 1 times [2024-11-28 02:43:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372051908] [2024-11-28 02:43:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 02:43:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372051908] [2024-11-28 02:43:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372051908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212435297] [2024-11-28 02:43:37,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:37,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:37,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:43:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:37,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 02:43:37,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:38,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 34 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212435297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:43:41,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:43:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2024-11-28 02:43:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663371810] [2024-11-28 02:43:41,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:43:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 02:43:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:41,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 02:43:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:43:41,216 INFO L87 Difference]: Start difference. First operand 12358 states and 14540 transitions. Second operand has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 26 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:45,092 INFO L93 Difference]: Finished difference Result 57644 states and 68299 transitions. [2024-11-28 02:43:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-28 02:43:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 26 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-28 02:43:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:45,156 INFO L225 Difference]: With dead ends: 57644 [2024-11-28 02:43:45,156 INFO L226 Difference]: Without dead ends: 47168 [2024-11-28 02:43:45,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2024-11-28 02:43:45,174 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1936 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:45,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 921 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:43:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47168 states. [2024-11-28 02:43:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47168 to 32119. [2024-11-28 02:43:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32119 states, 32118 states have (on average 1.185970483840837) internal successors, (38091), 32118 states have internal predecessors, (38091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32119 states to 32119 states and 38091 transitions. [2024-11-28 02:43:46,885 INFO L78 Accepts]: Start accepts. Automaton has 32119 states and 38091 transitions. Word has length 112 [2024-11-28 02:43:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:46,885 INFO L471 AbstractCegarLoop]: Abstraction has 32119 states and 38091 transitions. [2024-11-28 02:43:46,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 26 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:43:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32119 states and 38091 transitions. [2024-11-28 02:43:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 02:43:46,891 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:46,892 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:46,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:43:47,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 02:43:47,092 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -226666205, now seen corresponding path program 1 times [2024-11-28 02:43:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:47,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617108832] [2024-11-28 02:43:47,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617108832] [2024-11-28 02:43:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617108832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480685399] [2024-11-28 02:43:48,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:48,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:48,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:48,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:48,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:43:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:48,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 02:43:48,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 49 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:49,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:52,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480685399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:43:52,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:43:52,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 38 [2024-11-28 02:43:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457500504] [2024-11-28 02:43:52,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:43:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 02:43:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:52,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 02:43:52,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 02:43:52,227 INFO L87 Difference]: Start difference. First operand 32119 states and 38091 transitions. Second operand has 38 states, 38 states have (on average 8.342105263157896) internal successors, (317), 38 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:07,537 INFO L93 Difference]: Finished difference Result 67215 states and 79592 transitions. [2024-11-28 02:44:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-28 02:44:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.342105263157896) internal successors, (317), 38 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-28 02:44:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:07,593 INFO L225 Difference]: With dead ends: 67215 [2024-11-28 02:44:07,593 INFO L226 Difference]: Without dead ends: 44991 [2024-11-28 02:44:07,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5791 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3379, Invalid=16081, Unknown=0, NotChecked=0, Total=19460 [2024-11-28 02:44:07,612 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 3495 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:07,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 2126 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:44:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44991 states. [2024-11-28 02:44:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44991 to 19640. [2024-11-28 02:44:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19640 states, 19639 states have (on average 1.1713427363918734) internal successors, (23004), 19639 states have internal predecessors, (23004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19640 states to 19640 states and 23004 transitions. [2024-11-28 02:44:08,903 INFO L78 Accepts]: Start accepts. Automaton has 19640 states and 23004 transitions. Word has length 113 [2024-11-28 02:44:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:08,903 INFO L471 AbstractCegarLoop]: Abstraction has 19640 states and 23004 transitions. [2024-11-28 02:44:08,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.342105263157896) internal successors, (317), 38 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 19640 states and 23004 transitions. [2024-11-28 02:44:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 02:44:08,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:08,906 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:08,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:09,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 02:44:09,107 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:44:09,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 314862106, now seen corresponding path program 1 times [2024-11-28 02:44:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:44:09,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843675701] [2024-11-28 02:44:09,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:44:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:44:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843675701] [2024-11-28 02:44:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843675701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:44:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106469152] [2024-11-28 02:44:10,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:10,326 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:10,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:44:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:10,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:44:10,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:14,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106469152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:44:18,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:44:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2024-11-28 02:44:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240247989] [2024-11-28 02:44:18,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:44:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 02:44:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:44:18,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 02:44:18,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2305, Unknown=0, NotChecked=0, Total=2550 [2024-11-28 02:44:18,633 INFO L87 Difference]: Start difference. First operand 19640 states and 23004 transitions. Second operand has 51 states, 51 states have (on average 6.117647058823529) internal successors, (312), 51 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:31,202 INFO L93 Difference]: Finished difference Result 31412 states and 36700 transitions. [2024-11-28 02:44:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-28 02:44:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.117647058823529) internal successors, (312), 51 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-28 02:44:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:31,224 INFO L225 Difference]: With dead ends: 31412 [2024-11-28 02:44:31,225 INFO L226 Difference]: Without dead ends: 26676 [2024-11-28 02:44:31,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4510 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2891, Invalid=12859, Unknown=0, NotChecked=0, Total=15750 [2024-11-28 02:44:31,231 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 3050 mSDsluCounter, 3923 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:31,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 4133 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 02:44:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26676 states. [2024-11-28 02:44:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26676 to 23055. [2024-11-28 02:44:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23055 states, 23054 states have (on average 1.1682137590006072) internal successors, (26932), 23054 states have internal predecessors, (26932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23055 states to 23055 states and 26932 transitions. [2024-11-28 02:44:32,750 INFO L78 Accepts]: Start accepts. Automaton has 23055 states and 26932 transitions. Word has length 114 [2024-11-28 02:44:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:32,750 INFO L471 AbstractCegarLoop]: Abstraction has 23055 states and 26932 transitions. [2024-11-28 02:44:32,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.117647058823529) internal successors, (312), 51 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23055 states and 26932 transitions. [2024-11-28 02:44:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 02:44:32,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:32,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:32,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:32,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 02:44:32,955 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:44:32,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1817882397, now seen corresponding path program 1 times [2024-11-28 02:44:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:44:32,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611353360] [2024-11-28 02:44:32,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:44:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 47 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:44:33,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611353360] [2024-11-28 02:44:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611353360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:44:33,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127957699] [2024-11-28 02:44:33,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:33,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:33,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:33,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:33,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:44:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:33,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 02:44:33,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 50 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:35,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127957699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:44:37,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:44:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2024-11-28 02:44:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720713304] [2024-11-28 02:44:37,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:44:37,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-28 02:44:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:44:37,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-28 02:44:37,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2024-11-28 02:44:37,982 INFO L87 Difference]: Start difference. First operand 23055 states and 26932 transitions. Second operand has 42 states, 42 states have (on average 7.5) internal successors, (315), 42 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:49,822 INFO L93 Difference]: Finished difference Result 66611 states and 77870 transitions. [2024-11-28 02:44:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-28 02:44:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.5) internal successors, (315), 42 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-28 02:44:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:49,868 INFO L225 Difference]: With dead ends: 66611 [2024-11-28 02:44:49,868 INFO L226 Difference]: Without dead ends: 54162 [2024-11-28 02:44:49,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2288, Invalid=8424, Unknown=0, NotChecked=0, Total=10712 [2024-11-28 02:44:49,880 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 3106 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:49,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3106 Valid, 2947 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:44:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54162 states. [2024-11-28 02:44:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54162 to 27057. [2024-11-28 02:44:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27057 states, 27056 states have (on average 1.1652128917800118) internal successors, (31526), 27056 states have internal predecessors, (31526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27057 states to 27057 states and 31526 transitions. [2024-11-28 02:44:51,904 INFO L78 Accepts]: Start accepts. Automaton has 27057 states and 31526 transitions. Word has length 114 [2024-11-28 02:44:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 27057 states and 31526 transitions. [2024-11-28 02:44:51,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.5) internal successors, (315), 42 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 27057 states and 31526 transitions. [2024-11-28 02:44:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:44:51,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:51,908 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:51,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:44:52,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 02:44:52,109 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:44:52,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1555553588, now seen corresponding path program 1 times [2024-11-28 02:44:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:44:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237897204] [2024-11-28 02:44:52,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:44:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:53,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:44:53,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237897204] [2024-11-28 02:44:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237897204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:44:53,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144055663] [2024-11-28 02:44:53,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:53,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:53,501 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:53,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:44:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:53,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 02:44:53,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 24 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:54,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144055663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:44:56,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:44:56,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 36 [2024-11-28 02:44:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246328898] [2024-11-28 02:44:56,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:44:56,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 02:44:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:44:56,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 02:44:56,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2024-11-28 02:44:56,066 INFO L87 Difference]: Start difference. First operand 27057 states and 31526 transitions. Second operand has 36 states, 36 states have (on average 8.805555555555555) internal successors, (317), 36 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:08,106 INFO L93 Difference]: Finished difference Result 69346 states and 80795 transitions. [2024-11-28 02:45:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-28 02:45:08,106 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.805555555555555) internal successors, (317), 36 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-28 02:45:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:08,162 INFO L225 Difference]: With dead ends: 69346 [2024-11-28 02:45:08,162 INFO L226 Difference]: Without dead ends: 48679 [2024-11-28 02:45:08,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3923 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2753, Invalid=12009, Unknown=0, NotChecked=0, Total=14762 [2024-11-28 02:45:08,177 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1599 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:08,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 2610 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:45:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48679 states. [2024-11-28 02:45:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48679 to 29270. [2024-11-28 02:45:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29270 states, 29269 states have (on average 1.1592811507055245) internal successors, (33931), 29269 states have internal predecessors, (33931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29270 states to 29270 states and 33931 transitions. [2024-11-28 02:45:10,694 INFO L78 Accepts]: Start accepts. Automaton has 29270 states and 33931 transitions. Word has length 115 [2024-11-28 02:45:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:10,695 INFO L471 AbstractCegarLoop]: Abstraction has 29270 states and 33931 transitions. [2024-11-28 02:45:10,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.805555555555555) internal successors, (317), 36 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 29270 states and 33931 transitions. [2024-11-28 02:45:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:45:10,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:10,699 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:10,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:45:10,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:45:10,903 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 449994666, now seen corresponding path program 1 times [2024-11-28 02:45:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773485847] [2024-11-28 02:45:10,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 02:45:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773485847] [2024-11-28 02:45:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773485847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:10,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:10,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:45:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424609820] [2024-11-28 02:45:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:10,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:45:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:10,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:45:10,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:45:10,966 INFO L87 Difference]: Start difference. First operand 29270 states and 33931 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:12,699 INFO L93 Difference]: Finished difference Result 34892 states and 40335 transitions. [2024-11-28 02:45:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:45:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-28 02:45:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:12,716 INFO L225 Difference]: With dead ends: 34892 [2024-11-28 02:45:12,716 INFO L226 Difference]: Without dead ends: 20570 [2024-11-28 02:45:12,725 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-11-28 02:45:12,726 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:12,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 190 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:45:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2024-11-28 02:45:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 19109. [2024-11-28 02:45:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19109 states, 19108 states have (on average 1.1308352522503664) internal successors, (21608), 19108 states have internal predecessors, (21608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19109 states to 19109 states and 21608 transitions. [2024-11-28 02:45:14,702 INFO L78 Accepts]: Start accepts. Automaton has 19109 states and 21608 transitions. Word has length 115 [2024-11-28 02:45:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:14,702 INFO L471 AbstractCegarLoop]: Abstraction has 19109 states and 21608 transitions. [2024-11-28 02:45:14,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 19109 states and 21608 transitions. [2024-11-28 02:45:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:45:14,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:14,708 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:14,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 02:45:14,708 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:14,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1594503668, now seen corresponding path program 1 times [2024-11-28 02:45:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:14,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424753266] [2024-11-28 02:45:14,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-28 02:45:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424753266] [2024-11-28 02:45:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424753266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:45:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403222282] [2024-11-28 02:45:15,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:15,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:45:15,979 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:45:15,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:45:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:16,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 02:45:16,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 02:45:18,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:45:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 02:45:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403222282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:45:21,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:45:21,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2024-11-28 02:45:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022503362] [2024-11-28 02:45:21,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:45:21,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 02:45:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:21,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 02:45:21,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 02:45:21,089 INFO L87 Difference]: Start difference. First operand 19109 states and 21608 transitions. Second operand has 38 states, 38 states have (on average 7.2368421052631575) internal successors, (275), 38 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:26,492 INFO L93 Difference]: Finished difference Result 26982 states and 30557 transitions. [2024-11-28 02:45:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 02:45:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.2368421052631575) internal successors, (275), 38 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-28 02:45:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:26,510 INFO L225 Difference]: With dead ends: 26982 [2024-11-28 02:45:26,510 INFO L226 Difference]: Without dead ends: 22600 [2024-11-28 02:45:26,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1090, Invalid=3466, Unknown=0, NotChecked=0, Total=4556 [2024-11-28 02:45:26,516 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2636 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:26,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2636 Valid, 1165 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:45:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22600 states. [2024-11-28 02:45:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22600 to 19046. [2024-11-28 02:45:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19046 states, 19045 states have (on average 1.1302179049619323) internal successors, (21525), 19045 states have internal predecessors, (21525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19046 states to 19046 states and 21525 transitions. [2024-11-28 02:45:27,987 INFO L78 Accepts]: Start accepts. Automaton has 19046 states and 21525 transitions. Word has length 115 [2024-11-28 02:45:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:27,987 INFO L471 AbstractCegarLoop]: Abstraction has 19046 states and 21525 transitions. [2024-11-28 02:45:27,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.2368421052631575) internal successors, (275), 38 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19046 states and 21525 transitions. [2024-11-28 02:45:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 02:45:27,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:27,989 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:27,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 02:45:28,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:28,190 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2092934777, now seen corresponding path program 1 times [2024-11-28 02:45:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:28,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153593741] [2024-11-28 02:45:28,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153593741] [2024-11-28 02:45:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153593741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:45:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37357527] [2024-11-28 02:45:29,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:29,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:29,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:45:29,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:45:29,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:45:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:29,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 02:45:29,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:31,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:45:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37357527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:45:35,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:45:35,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 49 [2024-11-28 02:45:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505338370] [2024-11-28 02:45:35,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:45:35,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 02:45:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:35,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 02:45:35,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2024-11-28 02:45:35,151 INFO L87 Difference]: Start difference. First operand 19046 states and 21525 transitions. Second operand has 49 states, 49 states have (on average 6.020408163265306) internal successors, (295), 49 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:47,401 INFO L93 Difference]: Finished difference Result 32300 states and 36544 transitions. [2024-11-28 02:45:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-28 02:45:47,402 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.020408163265306) internal successors, (295), 49 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-28 02:45:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:47,420 INFO L225 Difference]: With dead ends: 32300 [2024-11-28 02:45:47,420 INFO L226 Difference]: Without dead ends: 27859 [2024-11-28 02:45:47,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4407 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3055, Invalid=12445, Unknown=0, NotChecked=0, Total=15500 [2024-11-28 02:45:47,425 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 2818 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2818 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:47,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2818 Valid, 3107 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:45:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27859 states. [2024-11-28 02:45:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27859 to 23527. [2024-11-28 02:45:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23527 states, 23526 states have (on average 1.1309614894159654) internal successors, (26607), 23526 states have internal predecessors, (26607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23527 states to 23527 states and 26607 transitions. [2024-11-28 02:45:49,282 INFO L78 Accepts]: Start accepts. Automaton has 23527 states and 26607 transitions. Word has length 116 [2024-11-28 02:45:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:49,283 INFO L471 AbstractCegarLoop]: Abstraction has 23527 states and 26607 transitions. [2024-11-28 02:45:49,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.020408163265306) internal successors, (295), 49 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:45:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23527 states and 26607 transitions. [2024-11-28 02:45:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 02:45:49,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:49,286 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:49,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 02:45:49,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:49,486 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2119610480, now seen corresponding path program 1 times [2024-11-28 02:45:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:49,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607655948] [2024-11-28 02:45:49,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 65 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 02:45:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607655948] [2024-11-28 02:45:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607655948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:45:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53406717] [2024-11-28 02:45:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:45:50,247 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:45:50,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:45:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:50,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 02:45:50,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 24 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:52,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:45:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:54,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53406717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:45:54,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:45:54,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 15] total 41 [2024-11-28 02:45:54,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659912982] [2024-11-28 02:45:54,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:45:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-28 02:45:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:54,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-28 02:45:54,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2024-11-28 02:45:54,291 INFO L87 Difference]: Start difference. First operand 23527 states and 26607 transitions. Second operand has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:46:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:12,268 INFO L93 Difference]: Finished difference Result 62017 states and 70197 transitions. [2024-11-28 02:46:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-11-28 02:46:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-28 02:46:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:12,305 INFO L225 Difference]: With dead ends: 62017 [2024-11-28 02:46:12,305 INFO L226 Difference]: Without dead ends: 51452 [2024-11-28 02:46:12,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8238 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=4568, Invalid=20872, Unknown=0, NotChecked=0, Total=25440 [2024-11-28 02:46:12,315 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 4370 mSDsluCounter, 4087 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4370 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:12,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4370 Valid, 4233 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:46:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51452 states. [2024-11-28 02:46:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51452 to 27505. [2024-11-28 02:46:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27505 states, 27504 states have (on average 1.1317990110529377) internal successors, (31129), 27504 states have internal predecessors, (31129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:46:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27505 states to 27505 states and 31129 transitions. [2024-11-28 02:46:14,817 INFO L78 Accepts]: Start accepts. Automaton has 27505 states and 31129 transitions. Word has length 117 [2024-11-28 02:46:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 27505 states and 31129 transitions. [2024-11-28 02:46:14,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:46:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27505 states and 31129 transitions. [2024-11-28 02:46:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 02:46:14,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:14,819 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:46:14,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 02:46:15,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:15,020 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:46:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1574055556, now seen corresponding path program 1 times [2024-11-28 02:46:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217113056] [2024-11-28 02:46:15,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:46:16,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:16,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217113056] [2024-11-28 02:46:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217113056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:16,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210904246] [2024-11-28 02:46:16,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:16,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:16,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:46:16,262 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:46:16,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:46:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:16,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 02:46:16,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:46:19,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:46:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210904246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:46:25,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:46:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 22] total 62 [2024-11-28 02:46:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599512629] [2024-11-28 02:46:25,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:46:25,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-28 02:46:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:25,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-28 02:46:25,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=3473, Unknown=0, NotChecked=0, Total=3782 [2024-11-28 02:46:25,943 INFO L87 Difference]: Start difference. First operand 27505 states and 31129 transitions. Second operand has 62 states, 62 states have (on average 5.403225806451613) internal successors, (335), 62 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:13,085 INFO L93 Difference]: Finished difference Result 76143 states and 86277 transitions. [2024-11-28 02:49:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 549 states. [2024-11-28 02:49:13,086 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 5.403225806451613) internal successors, (335), 62 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-28 02:49:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:13,130 INFO L225 Difference]: With dead ends: 76143 [2024-11-28 02:49:13,130 INFO L226 Difference]: Without dead ends: 62775 [2024-11-28 02:49:13,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 603 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162285 ImplicationChecksByTransitivity, 152.7s TimeCoverageRelationStatistics Valid=49926, Invalid=315494, Unknown=0, NotChecked=0, Total=365420 [2024-11-28 02:49:13,149 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 8937 mSDsluCounter, 10420 mSDsCounter, 0 mSdLazyCounter, 9715 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8937 SdHoareTripleChecker+Valid, 10820 SdHoareTripleChecker+Invalid, 10194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 9715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:13,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8937 Valid, 10820 Invalid, 10194 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [479 Valid, 9715 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 02:49:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62775 states. [2024-11-28 02:49:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62775 to 40252. [2024-11-28 02:49:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40252 states, 40251 states have (on average 1.1335618990832526) internal successors, (45627), 40251 states have internal predecessors, (45627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40252 states to 40252 states and 45627 transitions. [2024-11-28 02:49:17,295 INFO L78 Accepts]: Start accepts. Automaton has 40252 states and 45627 transitions. Word has length 117 [2024-11-28 02:49:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:17,296 INFO L471 AbstractCegarLoop]: Abstraction has 40252 states and 45627 transitions. [2024-11-28 02:49:17,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 5.403225806451613) internal successors, (335), 62 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 40252 states and 45627 transitions. [2024-11-28 02:49:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:49:17,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:17,300 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:49:17,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 02:49:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 02:49:17,500 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:17,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1472242076, now seen corresponding path program 1 times [2024-11-28 02:49:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67781666] [2024-11-28 02:49:17,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-28 02:49:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67781666] [2024-11-28 02:49:17,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67781666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:49:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546255674] [2024-11-28 02:49:17,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:17,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:49:17,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:49:17,636 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:49:17,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 02:49:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:17,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:49:17,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:49:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-28 02:49:17,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:49:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-28 02:49:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546255674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:49:18,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:49:18,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-11-28 02:49:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847915801] [2024-11-28 02:49:18,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:49:18,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:49:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:18,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:49:18,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:49:18,076 INFO L87 Difference]: Start difference. First operand 40252 states and 45627 transitions. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:22,468 INFO L93 Difference]: Finished difference Result 40256 states and 45629 transitions. [2024-11-28 02:49:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:49:22,468 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-28 02:49:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:22,500 INFO L225 Difference]: With dead ends: 40256 [2024-11-28 02:49:22,500 INFO L226 Difference]: Without dead ends: 39473 [2024-11-28 02:49:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2024-11-28 02:49:22,506 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 395 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:22,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 433 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:49:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2024-11-28 02:49:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39471. [2024-11-28 02:49:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39471 states, 39470 states have (on average 1.1337978211299722) internal successors, (44751), 39470 states have internal predecessors, (44751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39471 states to 39471 states and 44751 transitions. [2024-11-28 02:49:28,507 INFO L78 Accepts]: Start accepts. Automaton has 39471 states and 44751 transitions. Word has length 150 [2024-11-28 02:49:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:28,507 INFO L471 AbstractCegarLoop]: Abstraction has 39471 states and 44751 transitions. [2024-11-28 02:49:28,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 39471 states and 44751 transitions. [2024-11-28 02:49:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:49:28,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:28,512 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:49:28,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-28 02:49:28,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 02:49:28,713 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:28,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash -259314656, now seen corresponding path program 1 times [2024-11-28 02:49:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:28,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753250259] [2024-11-28 02:49:28,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 148 proven. 59 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-28 02:49:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753250259] [2024-11-28 02:49:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753250259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:49:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245325535] [2024-11-28 02:49:29,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:29,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:49:29,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:49:29,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:49:29,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 02:49:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:29,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:49:29,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:49:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-28 02:49:30,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:49:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-28 02:49:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245325535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:49:32,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:49:32,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2024-11-28 02:49:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547285345] [2024-11-28 02:49:32,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:49:32,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:49:32,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:32,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:49:32,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-11-28 02:49:32,189 INFO L87 Difference]: Start difference. First operand 39471 states and 44751 transitions. Second operand has 29 states, 29 states have (on average 9.413793103448276) internal successors, (273), 29 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:40,906 INFO L93 Difference]: Finished difference Result 56015 states and 63718 transitions. [2024-11-28 02:49:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-28 02:49:40,906 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.413793103448276) internal successors, (273), 29 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-28 02:49:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:40,944 INFO L225 Difference]: With dead ends: 56015 [2024-11-28 02:49:40,944 INFO L226 Difference]: Without dead ends: 50983 [2024-11-28 02:49:40,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1197, Invalid=5283, Unknown=0, NotChecked=0, Total=6480 [2024-11-28 02:49:40,952 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1415 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:40,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1591 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:49:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50983 states. [2024-11-28 02:49:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50983 to 38329. [2024-11-28 02:49:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38329 states, 38328 states have (on average 1.1321488207054895) internal successors, (43393), 38328 states have internal predecessors, (43393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38329 states to 38329 states and 43393 transitions. [2024-11-28 02:49:45,295 INFO L78 Accepts]: Start accepts. Automaton has 38329 states and 43393 transitions. Word has length 150 [2024-11-28 02:49:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:45,295 INFO L471 AbstractCegarLoop]: Abstraction has 38329 states and 43393 transitions. [2024-11-28 02:49:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.413793103448276) internal successors, (273), 29 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38329 states and 43393 transitions. [2024-11-28 02:49:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:49:45,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:45,299 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:49:45,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 02:49:45,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:49:45,500 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1468757340, now seen corresponding path program 1 times [2024-11-28 02:49:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609615619] [2024-11-28 02:49:45,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 02:49:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609615619] [2024-11-28 02:49:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609615619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:49:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130038033] [2024-11-28 02:49:46,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:46,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:49:46,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:49:46,543 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:49:46,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 02:49:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:46,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 02:49:46,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:49:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-28 02:49:48,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:49:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 02:49:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130038033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:49:50,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:49:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 21] total 49 [2024-11-28 02:49:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005834687] [2024-11-28 02:49:50,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:49:50,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 02:49:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 02:49:50,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2024-11-28 02:49:50,395 INFO L87 Difference]: Start difference. First operand 38329 states and 43393 transitions. Second operand has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:49:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:57,684 INFO L93 Difference]: Finished difference Result 45407 states and 51300 transitions. [2024-11-28 02:49:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-28 02:49:57,685 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-28 02:49:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:57,715 INFO L225 Difference]: With dead ends: 45407 [2024-11-28 02:49:57,715 INFO L226 Difference]: Without dead ends: 41433 [2024-11-28 02:49:57,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1488, Invalid=4992, Unknown=0, NotChecked=0, Total=6480 [2024-11-28 02:49:57,720 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1969 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:57,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 2392 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:49:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41433 states. [2024-11-28 02:50:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41433 to 39724. [2024-11-28 02:50:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39724 states, 39723 states have (on average 1.12992472874657) internal successors, (44884), 39723 states have internal predecessors, (44884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:50:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39724 states to 39724 states and 44884 transitions. [2024-11-28 02:50:02,183 INFO L78 Accepts]: Start accepts. Automaton has 39724 states and 44884 transitions. Word has length 150 [2024-11-28 02:50:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:02,183 INFO L471 AbstractCegarLoop]: Abstraction has 39724 states and 44884 transitions. [2024-11-28 02:50:02,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:50:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39724 states and 44884 transitions. [2024-11-28 02:50:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:50:02,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:02,187 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:50:02,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 02:50:02,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:50:02,388 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2033963842, now seen corresponding path program 1 times [2024-11-28 02:50:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728614438] [2024-11-28 02:50:02,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-28 02:50:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728614438] [2024-11-28 02:50:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728614438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:02,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:50:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399351598] [2024-11-28 02:50:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:02,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:50:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:02,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:50:02,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:50:02,479 INFO L87 Difference]: Start difference. First operand 39724 states and 44884 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:50:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:06,565 INFO L93 Difference]: Finished difference Result 39730 states and 44887 transitions. [2024-11-28 02:50:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:50:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-28 02:50:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:06,592 INFO L225 Difference]: With dead ends: 39730 [2024-11-28 02:50:06,593 INFO L226 Difference]: Without dead ends: 38916 [2024-11-28 02:50:06,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:50:06,597 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 176 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:06,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 223 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:50:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38916 states. [2024-11-28 02:50:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38916 to 38912. [2024-11-28 02:50:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38912 states, 38911 states have (on average 1.1307856390223845) internal successors, (44000), 38911 states have internal predecessors, (44000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:50:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38912 states to 38912 states and 44000 transitions. [2024-11-28 02:50:11,874 INFO L78 Accepts]: Start accepts. Automaton has 38912 states and 44000 transitions. Word has length 150 [2024-11-28 02:50:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:11,874 INFO L471 AbstractCegarLoop]: Abstraction has 38912 states and 44000 transitions. [2024-11-28 02:50:11,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:50:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 38912 states and 44000 transitions. [2024-11-28 02:50:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:50:11,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:11,878 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:50:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 02:50:11,878 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1602722759, now seen corresponding path program 1 times [2024-11-28 02:50:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267441407] [2024-11-28 02:50:11,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:50:11,917 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:50:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:50:12,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:50:12,006 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:50:12,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:50:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 02:50:12,012 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:50:12,168 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:50:12,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:12 BoogieIcfgContainer [2024-11-28 02:50:12,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:50:12,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:50:12,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:50:12,173 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:50:12,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:35" (3/4) ... [2024-11-28 02:50:12,175 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 02:50:12,368 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 147. [2024-11-28 02:50:12,544 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 02:50:12,544 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 02:50:12,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:50:12,545 INFO L158 Benchmark]: Toolchain (without parser) took 638218.99ms. Allocated memory was 117.4MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 92.8MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-28 02:50:12,545 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:50:12,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.80ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:50:12,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.50ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:50:12,545 INFO L158 Benchmark]: Boogie Preprocessor took 52.46ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:50:12,545 INFO L158 Benchmark]: RCFGBuilder took 846.73ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 52.5MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:50:12,546 INFO L158 Benchmark]: TraceAbstraction took 636435.98ms. Allocated memory was 117.4MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 51.9MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-28 02:50:12,546 INFO L158 Benchmark]: Witness Printer took 371.50ms. Allocated memory is still 5.7GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:50:12,547 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.42ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.80ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.50ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.46ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 846.73ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 52.5MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 636435.98ms. Allocated memory was 117.4MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 51.9MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 371.50ms. Allocated memory is still 5.7GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 306]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L250] int c1 ; [L251] int i2 ; [L254] c1 = 0 [L255] r1 = __VERIFIER_nondet_char() [L256] id1 = __VERIFIER_nondet_char() [L257] st1 = __VERIFIER_nondet_char() [L258] send1 = __VERIFIER_nondet_char() [L259] mode1 = __VERIFIER_nondet_bool() [L260] alive1 = __VERIFIER_nondet_bool() [L261] id2 = __VERIFIER_nondet_char() [L262] st2 = __VERIFIER_nondet_char() [L263] send2 = __VERIFIER_nondet_char() [L264] mode2 = __VERIFIER_nondet_bool() [L265] alive2 = __VERIFIER_nondet_bool() [L266] id3 = __VERIFIER_nondet_char() [L267] st3 = __VERIFIER_nondet_char() [L268] send3 = __VERIFIER_nondet_char() [L269] mode3 = __VERIFIER_nondet_bool() [L270] alive3 = __VERIFIER_nondet_bool() [L271] CALL, EXPR init() [L153] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L156] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L157] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L158] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L159] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L160] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L161] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L162] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L163] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L164] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L165] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L166] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L167] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L168] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L169] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L170] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L171] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id2 != (int )id3 [L173] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L225] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L271] RET, EXPR init() [L271] i2 = init() [L272] COND FALSE !(!(i2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L273] p1_old = nomsg [L274] p1_new = nomsg [L275] p2_old = nomsg [L276] p2_new = nomsg [L277] p3_old = nomsg [L278] p3_new = nomsg [L279] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, i2=0, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=0, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=2, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=2, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=3, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=3, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=4, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=4, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); VAL [\result=1, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=5, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 VAL [alive1=0, alive2=0, alive3=1, i2=5, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=0, r1=2, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L234] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L237] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L240] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0, tmp=0] [L245] return (tmp); VAL [\result=0, alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L306] reach_error() VAL [alive1=0, alive2=0, alive3=1, id1=1, id2=2, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 636.2s, OverallIterations: 38, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 488.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55263 SdHoareTripleChecker+Valid, 39.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55263 mSDsluCounter, 50267 SdHoareTripleChecker+Invalid, 35.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45886 mSDsCounter, 2326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39117 IncrementalHoareTripleChecker+Invalid, 41443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2326 mSolverCounterUnsat, 4381 mSDtfsCounter, 39117 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5922 GetRequests, 3409 SyntacticMatches, 11 SemanticMatches, 2502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359062 ImplicationChecksByTransitivity, 400.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40252occurred in iteration=33, InterpolantAutomatonStates: 2020, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 274276 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 83.7s InterpolantComputationTime, 5305 NumberOfCodeBlocks, 5305 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6951 ConstructedInterpolants, 48 QuantifiedInterpolants, 107396 SizeOfPredicates, 89 NumberOfNonLiveVariables, 7052 ConjunctsInSsa, 396 ConjunctsInUnsatCore, 71 InterpolantComputations, 20 PerfectInterpolantSequences, 3777/5938 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 02:50:12,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6529ba-2e39-434c-920f-f069d20b9bbd/bin/uautomizer-verify-aQ6SnzHsRB/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