./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:21:30,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:21:30,794 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 08:21:30,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:21:30,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:21:30,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:21:30,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:21:30,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:21:30,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:21:30,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:21:30,831 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:21:30,831 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:21:30,832 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:21:30,832 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:21:30,833 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:21:30,833 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:21:30,834 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:21:30,834 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:21:30,835 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:21:30,835 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:21:30,836 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:21:30,837 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:21:30,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:21:30,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:21:30,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:21:30,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:21:30,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:21:30,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:21:30,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:21:30,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:21:30,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:21:30,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:21:30,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:21:30,842 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:21:30,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:21:30,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:21:30,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:21:30,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:21:30,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:21:30,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:21:30,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:21:30,844 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:21:30,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:21:30,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:21:30,845 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:21:30,845 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:21:30,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:21:30,845 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2023-12-02 08:21:31,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:21:31,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:21:31,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:21:31,092 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:21:31,092 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:21:31,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-12-02 08:21:33,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:21:33,989 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:21:33,989 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-12-02 08:21:33,996 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/data/1779e8790/252a6b718e9840d9a6b00532009920c3/FLAG16d01c66e [2023-12-02 08:21:34,008 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/data/1779e8790/252a6b718e9840d9a6b00532009920c3 [2023-12-02 08:21:34,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:21:34,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:21:34,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:21:34,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:21:34,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:21:34,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b3c29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34, skipping insertion in model container [2023-12-02 08:21:34,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,039 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:21:34,170 WARN L240 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_51a586ea-7e97-4cfb-bdc4-63e181a2b998/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c[2667,2680] [2023-12-02 08:21:34,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:21:34,184 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:21:34,204 WARN L240 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_51a586ea-7e97-4cfb-bdc4-63e181a2b998/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c[2667,2680] [2023-12-02 08:21:34,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:21:34,218 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:21:34,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34 WrapperNode [2023-12-02 08:21:34,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:21:34,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:21:34,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:21:34,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:21:34,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,249 INFO L138 Inliner]: procedures = 15, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 89 [2023-12-02 08:21:34,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:21:34,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:21:34,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:21:34,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:21:34,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:21:34,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:21:34,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:21:34,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:21:34,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (1/1) ... [2023-12-02 08:21:34,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:21:34,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:21:34,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:21:34,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:21:34,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:21:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2023-12-02 08:21:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2023-12-02 08:21:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:21:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:21:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:21:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-12-02 08:21:34,341 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-12-02 08:21:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2023-12-02 08:21:34,341 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2023-12-02 08:21:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:21:34,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:21:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 08:21:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-12-02 08:21:34,341 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-12-02 08:21:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:21:34,414 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:21:34,416 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:21:34,614 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:21:34,700 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:21:34,700 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 08:21:34,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:34 BoogieIcfgContainer [2023-12-02 08:21:34,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:21:34,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:21:34,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:21:34,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:21:34,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:21:34" (1/3) ... [2023-12-02 08:21:34,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59911db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:21:34, skipping insertion in model container [2023-12-02 08:21:34,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:34" (2/3) ... [2023-12-02 08:21:34,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59911db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:21:34, skipping insertion in model container [2023-12-02 08:21:34,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:34" (3/3) ... [2023-12-02 08:21:34,710 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_6.c [2023-12-02 08:21:34,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:21:34,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:21:34,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:21:34,769 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@228126ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:21:34,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:21:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 27 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 08:21:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 08:21:34,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:34,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 08:21:34,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:34,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash 4908818, now seen corresponding path program 1 times [2023-12-02 08:21:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:34,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410576691] [2023-12-02 08:21:34,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:21:34,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410576691] [2023-12-02 08:21:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410576691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:21:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:21:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:21:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96612376] [2023-12-02 08:21:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:21:35,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:21:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:21:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:21:35,032 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 27 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:21:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:35,074 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-02 08:21:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:21:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 08:21:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:35,083 INFO L225 Difference]: With dead ends: 45 [2023-12-02 08:21:35,083 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 08:21:35,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:21:35,088 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:35,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:21:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 08:21:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-12-02 08:21:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 08:21:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-12-02 08:21:35,122 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 4 [2023-12-02 08:21:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:35,122 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-12-02 08:21:35,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:21:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-12-02 08:21:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:21:35,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:35,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:21:35,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:21:35,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:35,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:35,125 INFO L85 PathProgramCache]: Analyzing trace with hash 328887117, now seen corresponding path program 1 times [2023-12-02 08:21:35,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:35,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749074024] [2023-12-02 08:21:35,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:35,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:21:35,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749074024] [2023-12-02 08:21:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749074024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:21:35,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:21:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:21:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659514445] [2023-12-02 08:21:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:21:35,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:21:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:21:35,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:21:35,204 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:21:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:35,231 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2023-12-02 08:21:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:21:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 08:21:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:35,233 INFO L225 Difference]: With dead ends: 71 [2023-12-02 08:21:35,233 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 08:21:35,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:21:35,235 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:35,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:21:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 08:21:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-12-02 08:21:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 08:21:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2023-12-02 08:21:35,242 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 6 [2023-12-02 08:21:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:35,243 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-12-02 08:21:35,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:21:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2023-12-02 08:21:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 08:21:35,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:35,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:21:35,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:21:35,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:35,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1209867767, now seen corresponding path program 1 times [2023-12-02 08:21:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476984226] [2023-12-02 08:21:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:21:35,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476984226] [2023-12-02 08:21:35,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476984226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:21:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:21:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:21:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54624729] [2023-12-02 08:21:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:21:35,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:21:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:21:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:21:35,512 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 08:21:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:35,661 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2023-12-02 08:21:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:21:35,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-02 08:21:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:35,665 INFO L225 Difference]: With dead ends: 78 [2023-12-02 08:21:35,665 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 08:21:35,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:21:35,667 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:35,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:21:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 08:21:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-12-02 08:21:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 08:21:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-12-02 08:21:35,677 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 13 [2023-12-02 08:21:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:35,677 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-12-02 08:21:35,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 08:21:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2023-12-02 08:21:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:21:35,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:35,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:21:35,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:21:35,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:35,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1357412854, now seen corresponding path program 1 times [2023-12-02 08:21:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874970588] [2023-12-02 08:21:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 08:21:35,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874970588] [2023-12-02 08:21:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874970588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:21:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:21:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:21:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144632402] [2023-12-02 08:21:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:21:35,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:21:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:21:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:21:35,910 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 08:21:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:36,038 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2023-12-02 08:21:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:21:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2023-12-02 08:21:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:36,040 INFO L225 Difference]: With dead ends: 80 [2023-12-02 08:21:36,040 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 08:21:36,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:21:36,043 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:36,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:21:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 08:21:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-12-02 08:21:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-02 08:21:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-12-02 08:21:36,053 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 24 [2023-12-02 08:21:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:36,053 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-12-02 08:21:36,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 08:21:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-12-02 08:21:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 08:21:36,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:36,055 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 08:21:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 08:21:36,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:36,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2115029454, now seen corresponding path program 1 times [2023-12-02 08:21:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463767091] [2023-12-02 08:21:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 08:21:36,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463767091] [2023-12-02 08:21:36,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463767091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:21:36,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:21:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:21:36,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141965897] [2023-12-02 08:21:36,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:21:36,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:21:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:21:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:21:36,303 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 08:21:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:36,427 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2023-12-02 08:21:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:21:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2023-12-02 08:21:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:36,429 INFO L225 Difference]: With dead ends: 82 [2023-12-02 08:21:36,429 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 08:21:36,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:21:36,431 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:36,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:21:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 08:21:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2023-12-02 08:21:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-02 08:21:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-02 08:21:36,440 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 35 [2023-12-02 08:21:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:36,440 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-02 08:21:36,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 08:21:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-02 08:21:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 08:21:36,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:36,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:21:36,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 08:21:36,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:36,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash 871803650, now seen corresponding path program 1 times [2023-12-02 08:21:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027173289] [2023-12-02 08:21:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:21:36,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:36,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027173289] [2023-12-02 08:21:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027173289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:21:36,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:21:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:21:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665392347] [2023-12-02 08:21:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:21:36,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:21:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:21:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:21:36,671 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 08:21:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:36,788 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2023-12-02 08:21:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:21:36,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2023-12-02 08:21:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:36,790 INFO L225 Difference]: With dead ends: 84 [2023-12-02 08:21:36,791 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 08:21:36,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:21:36,792 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:36,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 84 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:21:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 08:21:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-02 08:21:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-02 08:21:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2023-12-02 08:21:36,800 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 46 [2023-12-02 08:21:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:36,801 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2023-12-02 08:21:36,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 08:21:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2023-12-02 08:21:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 08:21:36,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:36,803 INFO L195 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] [2023-12-02 08:21:36,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 08:21:36,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:36,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -940342340, now seen corresponding path program 1 times [2023-12-02 08:21:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992282913] [2023-12-02 08:21:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 08:21:36,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992282913] [2023-12-02 08:21:36,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992282913] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:21:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259526521] [2023-12-02 08:21:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:36,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:21:36,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:21:36,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 08:21:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:37,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:21:37,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:21:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 08:21:37,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:21:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 08:21:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259526521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:21:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [258948004] [2023-12-02 08:21:37,210 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:21:37,210 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:21:37,215 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:21:37,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:21:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-12-02 08:21:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445637987] [2023-12-02 08:21:37,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:21:37,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:21:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:21:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:21:37,218 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 08:21:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:37,256 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2023-12-02 08:21:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:21:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 51 [2023-12-02 08:21:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:37,258 INFO L225 Difference]: With dead ends: 95 [2023-12-02 08:21:37,259 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 08:21:37,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:21:37,260 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:37,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:21:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 08:21:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-02 08:21:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-02 08:21:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2023-12-02 08:21:37,270 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 51 [2023-12-02 08:21:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:37,270 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-12-02 08:21:37,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 08:21:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2023-12-02 08:21:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-02 08:21:37,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:37,274 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-02 08:21:37,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:21:37,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:37,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:37,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1515619341, now seen corresponding path program 2 times [2023-12-02 08:21:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:37,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132913190] [2023-12-02 08:21:37,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:37,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 14 proven. 111 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2023-12-02 08:21:38,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132913190] [2023-12-02 08:21:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132913190] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:21:38,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041476934] [2023-12-02 08:21:38,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:21:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:21:38,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:21:38,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 08:21:38,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 08:21:38,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:21:38,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:21:38,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:21:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2023-12-02 08:21:38,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:21:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2023-12-02 08:21:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041476934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:21:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012152915] [2023-12-02 08:21:39,200 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:21:39,201 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:21:39,201 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:21:39,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:21:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2023-12-02 08:21:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947432844] [2023-12-02 08:21:39,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:21:39,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 08:21:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 08:21:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-02 08:21:39,205 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-02 08:21:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:39,473 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2023-12-02 08:21:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 08:21:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 186 [2023-12-02 08:21:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:39,477 INFO L225 Difference]: With dead ends: 148 [2023-12-02 08:21:39,477 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 08:21:39,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-02 08:21:39,479 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:39,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 184 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:21:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 08:21:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 08:21:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.140625) internal successors, (73), 68 states have internal predecessors, (73), 23 states have call successors, (23), 4 states have call predecessors, (23), 9 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-12-02 08:21:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2023-12-02 08:21:39,499 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 186 [2023-12-02 08:21:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:39,500 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2023-12-02 08:21:39,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-02 08:21:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2023-12-02 08:21:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2023-12-02 08:21:39,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:39,520 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 32, 32, 32, 32, 32, 32, 32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 4, 4, 1, 1, 1, 1] [2023-12-02 08:21:39,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 08:21:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:39,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:39,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1833314734, now seen corresponding path program 3 times [2023-12-02 08:21:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555522096] [2023-12-02 08:21:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12480 backedges. 175 proven. 22 refuted. 0 times theorem prover too weak. 12283 trivial. 0 not checked. [2023-12-02 08:21:41,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555522096] [2023-12-02 08:21:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555522096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:21:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36604261] [2023-12-02 08:21:41,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 08:21:41,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:41,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:21:41,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:21:41,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 08:21:42,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 08:21:42,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:21:42,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 4357 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:21:42,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:21:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12480 backedges. 4831 proven. 22 refuted. 0 times theorem prover too weak. 7627 trivial. 0 not checked. [2023-12-02 08:21:42,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:21:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12480 backedges. 175 proven. 22 refuted. 0 times theorem prover too weak. 12283 trivial. 0 not checked. [2023-12-02 08:21:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36604261] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:21:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2020379190] [2023-12-02 08:21:43,219 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:21:43,219 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:21:43,219 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:21:43,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:21:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2023-12-02 08:21:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679073714] [2023-12-02 08:21:43,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:21:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:21:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:21:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:21:43,224 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 8 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-02 08:21:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:43,293 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2023-12-02 08:21:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 08:21:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 8 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 812 [2023-12-02 08:21:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:43,296 INFO L225 Difference]: With dead ends: 203 [2023-12-02 08:21:43,296 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 08:21:43,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1629 GetRequests, 1618 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:21:43,298 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:43,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:21:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 08:21:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-02 08:21:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.1125) internal successors, (89), 84 states have internal predecessors, (89), 31 states have call successors, (31), 4 states have call predecessors, (31), 9 states have return successors, (36), 32 states have call predecessors, (36), 31 states have call successors, (36) [2023-12-02 08:21:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 156 transitions. [2023-12-02 08:21:43,316 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 156 transitions. Word has length 812 [2023-12-02 08:21:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:43,316 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 156 transitions. [2023-12-02 08:21:43,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 8 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-02 08:21:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2023-12-02 08:21:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2023-12-02 08:21:43,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:43,386 INFO L195 NwaCegarLoop]: trace histogram [72, 72, 48, 48, 48, 48, 48, 48, 48, 48, 48, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 4, 4, 1, 1, 1, 1] [2023-12-02 08:21:43,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 08:21:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:43,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:43,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1403174202, now seen corresponding path program 4 times [2023-12-02 08:21:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828839963] [2023-12-02 08:21:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28312 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 27576 trivial. 0 not checked. [2023-12-02 08:21:45,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:45,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828839963] [2023-12-02 08:21:45,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828839963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:21:45,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877523701] [2023-12-02 08:21:45,491 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 08:21:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:21:45,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:21:45,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 08:21:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:46,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 6590 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:21:46,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:21:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 28312 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 27576 trivial. 0 not checked. [2023-12-02 08:21:46,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:21:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 28312 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 27576 trivial. 0 not checked. [2023-12-02 08:21:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877523701] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:21:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1952536091] [2023-12-02 08:21:48,241 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:21:48,241 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:21:48,241 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:21:48,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:21:48,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2023-12-02 08:21:48,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105310505] [2023-12-02 08:21:48,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:21:48,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:21:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:21:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:21:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:21:48,247 INFO L87 Difference]: Start difference. First operand 121 states and 156 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-12-02 08:21:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:48,302 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2023-12-02 08:21:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 08:21:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 1212 [2023-12-02 08:21:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:48,309 INFO L225 Difference]: With dead ends: 164 [2023-12-02 08:21:48,309 INFO L226 Difference]: Without dead ends: 161 [2023-12-02 08:21:48,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2429 GetRequests, 2418 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:21:48,310 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:48,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:21:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-02 08:21:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-12-02 08:21:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 108 states have (on average 1.1018518518518519) internal successors, (119), 112 states have internal predecessors, (119), 43 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2023-12-02 08:21:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2023-12-02 08:21:48,332 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 1212 [2023-12-02 08:21:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:48,336 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2023-12-02 08:21:48,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-12-02 08:21:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2023-12-02 08:21:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1817 [2023-12-02 08:21:48,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:48,369 INFO L195 NwaCegarLoop]: trace histogram [108, 108, 72, 72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1] [2023-12-02 08:21:48,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 08:21:48,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 08:21:48,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:48,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1621936096, now seen corresponding path program 5 times [2023-12-02 08:21:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:21:48,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108433372] [2023-12-02 08:21:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:21:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 64152 backedges. 256 proven. 2014 refuted. 0 times theorem prover too weak. 61882 trivial. 0 not checked. [2023-12-02 08:21:59,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:21:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108433372] [2023-12-02 08:21:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108433372] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:21:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843644652] [2023-12-02 08:21:59,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:21:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:21:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:21:59,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:21:59,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 08:22:00,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-02 08:22:00,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:22:00,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 08:22:00,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:00,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:22:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 64152 backedges. 3273 proven. 8 refuted. 0 times theorem prover too weak. 60871 trivial. 0 not checked. [2023-12-02 08:22:01,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:22:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 64152 backedges. 2153 proven. 13 refuted. 0 times theorem prover too weak. 61986 trivial. 0 not checked. [2023-12-02 08:22:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843644652] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:22:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [479039645] [2023-12-02 08:22:04,027 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:22:04,027 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:22:04,028 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:22:04,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:22:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2023-12-02 08:22:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924813208] [2023-12-02 08:22:04,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:22:04,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 08:22:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:04,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 08:22:04,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2023-12-02 08:22:04,037 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 32 states, 24 states have (on average 3.25) internal successors, (78), 28 states have internal predecessors, (78), 13 states have call successors, (26), 6 states have call predecessors, (26), 9 states have return successors, (31), 8 states have call predecessors, (31), 13 states have call successors, (31) [2023-12-02 08:22:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:04,608 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2023-12-02 08:22:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 08:22:04,609 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 3.25) internal successors, (78), 28 states have internal predecessors, (78), 13 states have call successors, (26), 6 states have call predecessors, (26), 9 states have return successors, (31), 8 states have call predecessors, (31), 13 states have call successors, (31) Word has length 1816 [2023-12-02 08:22:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:04,611 INFO L225 Difference]: With dead ends: 322 [2023-12-02 08:22:04,611 INFO L226 Difference]: Without dead ends: 165 [2023-12-02 08:22:04,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3655 GetRequests, 3613 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 08:22:04,614 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:04,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 249 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:22:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-02 08:22:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-12-02 08:22:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.1) internal successors, (121), 114 states have internal predecessors, (121), 43 states have call successors, (43), 4 states have call predecessors, (43), 11 states have return successors, (50), 46 states have call predecessors, (50), 43 states have call successors, (50) [2023-12-02 08:22:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2023-12-02 08:22:04,632 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 1816 [2023-12-02 08:22:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:04,633 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2023-12-02 08:22:04,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 3.25) internal successors, (78), 28 states have internal predecessors, (78), 13 states have call successors, (26), 6 states have call predecessors, (26), 9 states have return successors, (31), 8 states have call predecessors, (31), 13 states have call successors, (31) [2023-12-02 08:22:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2023-12-02 08:22:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2177 [2023-12-02 08:22:04,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:04,664 INFO L195 NwaCegarLoop]: trace histogram [180, 180, 144, 144, 144, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1] [2023-12-02 08:22:04,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 08:22:04,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:04,864 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:22:04,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 542032408, now seen corresponding path program 6 times [2023-12-02 08:22:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:04,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236263760] [2023-12-02 08:22:04,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 113220 backedges. 572 proven. 4479 refuted. 0 times theorem prover too weak. 108169 trivial. 0 not checked. [2023-12-02 08:22:26,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236263760] [2023-12-02 08:22:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236263760] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617100764] [2023-12-02 08:22:26,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 08:22:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:26,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:26,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 08:22:28,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 08:22:28,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:22:28,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 11137 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-02 08:22:28,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:28,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:22:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 113220 backedges. 4673 proven. 24 refuted. 0 times theorem prover too weak. 108523 trivial. 0 not checked. [2023-12-02 08:22:28,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:22:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 113220 backedges. 88 proven. 4771 refuted. 0 times theorem prover too weak. 108361 trivial. 0 not checked. [2023-12-02 08:22:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617100764] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:22:33,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [492062882] [2023-12-02 08:22:33,463 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:22:33,463 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:22:33,463 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:22:33,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:22:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 22] total 40 [2023-12-02 08:22:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493559428] [2023-12-02 08:22:33,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:22:33,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 08:22:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 08:22:33,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 08:22:33,472 INFO L87 Difference]: Start difference. First operand 165 states and 214 transitions. Second operand has 40 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 34 states have internal predecessors, (85), 13 states have call successors, (31), 8 states have call predecessors, (31), 13 states have return successors, (39), 11 states have call predecessors, (39), 13 states have call successors, (39) [2023-12-02 08:22:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:34,128 INFO L93 Difference]: Finished difference Result 330 states and 470 transitions. [2023-12-02 08:22:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 08:22:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 34 states have internal predecessors, (85), 13 states have call successors, (31), 8 states have call predecessors, (31), 13 states have return successors, (39), 11 states have call predecessors, (39), 13 states have call successors, (39) Word has length 2176 [2023-12-02 08:22:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:34,131 INFO L225 Difference]: With dead ends: 330 [2023-12-02 08:22:34,131 INFO L226 Difference]: Without dead ends: 169 [2023-12-02 08:22:34,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4384 GetRequests, 4331 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=2171, Unknown=0, NotChecked=0, Total=2652 [2023-12-02 08:22:34,135 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:34,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 284 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:22:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-02 08:22:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-12-02 08:22:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 112 states have (on average 1.0982142857142858) internal successors, (123), 116 states have internal predecessors, (123), 43 states have call successors, (43), 4 states have call predecessors, (43), 13 states have return successors, (52), 48 states have call predecessors, (52), 43 states have call successors, (52) [2023-12-02 08:22:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 218 transitions. [2023-12-02 08:22:34,156 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 218 transitions. Word has length 2176 [2023-12-02 08:22:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:34,156 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 218 transitions. [2023-12-02 08:22:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 34 states have internal predecessors, (85), 13 states have call successors, (31), 8 states have call predecessors, (31), 13 states have return successors, (39), 11 states have call predecessors, (39), 13 states have call successors, (39) [2023-12-02 08:22:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2023-12-02 08:22:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2537 [2023-12-02 08:22:34,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:34,201 INFO L195 NwaCegarLoop]: trace histogram [252, 252, 216, 216, 216, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1] [2023-12-02 08:22:34,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 08:22:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 08:22:34,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:22:34,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1713327632, now seen corresponding path program 7 times [2023-12-02 08:22:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318782941] [2023-12-02 08:22:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 188208 backedges. 5685 proven. 5747 refuted. 0 times theorem prover too weak. 176776 trivial. 0 not checked. [2023-12-02 08:24:33,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318782941] [2023-12-02 08:24:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318782941] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638916456] [2023-12-02 08:24:33,985 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 08:24:33,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:33,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:33,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:33,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 08:24:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:36,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 12578 conjuncts, 94 conjunts are in the unsatisfiable core [2023-12-02 08:24:36,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:36,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2023-12-02 08:24:36,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:24:37,004 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_1383| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_1383| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_1383| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_old(#memory_int)_AFTER_CALL_1383| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_old(#memory_int)_AFTER_CALL_1383|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:24:37,012 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_1383| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_1383| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_1383| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_old(#memory_int)_AFTER_CALL_1383| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_old(#memory_int)_AFTER_CALL_1383|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:24:37,048 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_36| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_36| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_36|) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (= (store |v_#memory_int_BEFORE_CALL_36| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:24:37,053 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_36| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_36| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_36|) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (= (store |v_#memory_int_BEFORE_CALL_36| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:24:37,157 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_39| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_28_0_#in~f.base|)))))) is different from false [2023-12-02 08:24:37,160 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_39| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_28_0_#in~f.base|)))))) is different from true [2023-12-02 08:24:37,207 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~e.base) c_func_to_recursive_line_27_to_28_0_~e.offset))) (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_27_to_28_0_~e.base))) (and (= (store .cse0 c_func_to_recursive_line_27_to_28_0_~e.base (store .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base))) (and (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse3 (select |v_#memory_int_12385| .cse3)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse3)))) (<= .cse2 (+ (select .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)) (= |c_#memory_int| (store |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base (store .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)))))))) (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base)) is different from false [2023-12-02 08:24:37,211 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~e.base) c_func_to_recursive_line_27_to_28_0_~e.offset))) (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_27_to_28_0_~e.base))) (and (= (store .cse0 c_func_to_recursive_line_27_to_28_0_~e.base (store .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base))) (and (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse3 (select |v_#memory_int_12385| .cse3)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse3)))) (<= .cse2 (+ (select .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)) (= |c_#memory_int| (store |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base (store .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)))))))) (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base)) is different from true [2023-12-02 08:24:37,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~e.base|) |c_func_to_recursive_line_27_to_28_0_#in~e.offset|))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse2 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse1 (select .cse2 |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (<= .cse0 (+ (select .cse1 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)) (= (store .cse2 |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse1 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (= (store |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse0)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse4 (select |v_#memory_int_12385| .cse4)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse4)))) (<= .cse0 (+ (select .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)))))) (<= 6 .cse0))) is different from false [2023-12-02 08:24:37,328 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~e.base|) |c_func_to_recursive_line_27_to_28_0_#in~e.offset|))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse2 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse1 (select .cse2 |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (<= .cse0 (+ (select .cse1 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)) (= (store .cse2 |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse1 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (= (store |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse0)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse4 (select |v_#memory_int_12385| .cse4)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse4)))) (<= .cse0 (+ (select .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)))))) (<= 6 .cse0))) is different from true [2023-12-02 08:24:37,406 INFO L349 Elim1Store]: treesize reduction 71, result has 4.1 percent of original size [2023-12-02 08:24:37,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 178 [2023-12-02 08:24:37,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2023-12-02 08:24:37,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2023-12-02 08:24:37,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 08:24:37,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:24:37,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2023-12-02 08:24:37,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:24:37,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2023-12-02 08:24:37,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-02 08:24:37,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:24:37,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2023-12-02 08:24:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 188208 backedges. 97498 proven. 24 refuted. 0 times theorem prover too weak. 90673 trivial. 13 not checked. [2023-12-02 08:24:37,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:39,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:24:39,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 08:24:39,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 08:24:40,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:24:40,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 08:24:40,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 08:24:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638916456] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2049317493] [2023-12-02 08:24:40,379 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:24:40,379 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:24:40,379 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:24:40,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:24:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 40 [2023-12-02 08:24:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227509637] [2023-12-02 08:24:40,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:24:40,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 08:24:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:40,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 08:24:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1188, Unknown=10, NotChecked=370, Total=1722 [2023-12-02 08:24:40,386 INFO L87 Difference]: Start difference. First operand 169 states and 218 transitions. Second operand has 40 states, 32 states have (on average 3.34375) internal successors, (107), 36 states have internal predecessors, (107), 22 states have call successors, (38), 3 states have call predecessors, (38), 12 states have return successors, (43), 18 states have call predecessors, (43), 22 states have call successors, (43) [2023-12-02 08:24:40,711 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|))) (and (= c_func_to_recursive_line_28_to_28_0_~f.base |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_1383| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_1383| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_1383| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_old(#memory_int)_AFTER_CALL_1383| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_old(#memory_int)_AFTER_CALL_1383|)))) .cse1) (= |c_#memory_int| (store |c_old(#memory_int)| c_func_to_recursive_line_28_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_28_to_28_0_~f.base))) (or (exists ((|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_36| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_36| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_36|) (= .cse2 |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (= (store |v_#memory_int_BEFORE_CALL_36| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1))) is different from false [2023-12-02 08:24:40,715 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|))) (and (= c_func_to_recursive_line_28_to_28_0_~f.base |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_1383| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_1383| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_1383| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_old(#memory_int)_AFTER_CALL_1383| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_old(#memory_int)_AFTER_CALL_1383|)))) .cse1) (= |c_#memory_int| (store |c_old(#memory_int)| c_func_to_recursive_line_28_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_28_to_28_0_~f.base))) (or (exists ((|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_36| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_36| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_36|) (= .cse2 |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (= (store |v_#memory_int_BEFORE_CALL_36| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1))) is different from true [2023-12-02 08:24:40,736 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~f.base))) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| c_func_to_recursive_line_27_to_28_0_~f.base) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_39| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_28_0_#in~f.base|)))))) is different from false [2023-12-02 08:24:40,738 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~f.base))) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| c_func_to_recursive_line_27_to_28_0_~f.base) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_39| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_28_0_#in~f.base|)))))) is different from true [2023-12-02 08:24:40,744 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~e.base))) (and (let ((.cse2 (select .cse5 c_func_to_recursive_line_27_to_28_0_~e.offset))) (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_27_to_28_0_~e.base))) (and (= (store .cse0 c_func_to_recursive_line_27_to_28_0_~e.base (store .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base))) (and (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse3 (select |v_#memory_int_12385| .cse3)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse3)))) (<= .cse2 (+ (select .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)) (= |c_#memory_int| (store |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base (store .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)))))))) (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= (store (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_28_0_~e.base .cse5) c_func_to_recursive_line_27_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~f.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| c_func_to_recursive_line_27_to_28_0_~f.base))) is different from false [2023-12-02 08:24:40,748 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~e.base))) (and (let ((.cse2 (select .cse5 c_func_to_recursive_line_27_to_28_0_~e.offset))) (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_27_to_28_0_~e.base))) (and (= (store .cse0 c_func_to_recursive_line_27_to_28_0_~e.base (store .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base))) (and (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse3 (select |v_#memory_int_12385| .cse3)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse3)))) (<= .cse2 (+ (select .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset) 1)) (= |c_#memory_int| (store |v_#memory_int_12385| c_func_to_recursive_line_27_to_28_0_~e.base (store .cse4 c_func_to_recursive_line_27_to_28_0_~e.offset .cse2)))))))) (= c_func_to_recursive_line_27_to_28_0_~e.offset |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) (= (store (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_28_0_~e.base .cse5) c_func_to_recursive_line_27_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_27_to_28_0_~f.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| c_func_to_recursive_line_27_to_28_0_~e.base) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| c_func_to_recursive_line_27_to_28_0_~f.base))) is different from true [2023-12-02 08:24:40,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse0 (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)))) (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~e.base|) |c_func_to_recursive_line_27_to_28_0_#in~e.offset|)) (.cse1 (@diff .cse0 |c_#memory_int|))) (and (= (store .cse0 .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse4 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)) (= (store .cse4 |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse2)) |c_#memory_int|))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (= (store |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse5 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse2)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse6 (select |v_#memory_int_12385| .cse6)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse6)))) (<= .cse2 (+ (select .cse5 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)))))) (or (= .cse7 |c_func_to_recursive_line_27_to_28_0_#in~e.base|) (= |c_old(#memory_int)| |c_#memory_int|) (= .cse7 |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) (<= 6 .cse2) (or (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse1) (= .cse0 |c_#memory_int|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| .cse1)))))) is different from false [2023-12-02 08:24:40,788 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse0 (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)))) (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_27_to_28_0_#in~e.base|) |c_func_to_recursive_line_27_to_28_0_#in~e.offset|)) (.cse1 (@diff .cse0 |c_#memory_int|))) (and (= (store .cse0 .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse4 (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| v_DerPreprocessor_5))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)) (= (store .cse4 |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse3 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse2)) |c_#memory_int|))))) (exists ((|v_#memory_int_12385| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base|))) (and (= (store |v_#memory_int_12385| |c_func_to_recursive_line_27_to_28_0_#in~e.base| (store .cse5 |c_func_to_recursive_line_27_to_28_0_#in~e.offset| .cse2)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_39| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int_BEFORE_CALL_39| |v_#memory_int_12385|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_39| |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_39|) (= (store |v_#memory_int_BEFORE_CALL_39| .cse6 (select |v_#memory_int_12385| .cse6)) |v_#memory_int_12385|) (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse6)))) (<= .cse2 (+ (select .cse5 |c_func_to_recursive_line_27_to_28_0_#in~e.offset|) 1)))))) (or (= .cse7 |c_func_to_recursive_line_27_to_28_0_#in~e.base|) (= |c_old(#memory_int)| |c_#memory_int|) (= .cse7 |c_func_to_recursive_line_27_to_28_0_#in~f.base|)) (<= 6 .cse2) (or (= |c_func_to_recursive_line_27_to_28_0_#in~f.base| .cse1) (= .cse0 |c_#memory_int|) (= |c_func_to_recursive_line_27_to_28_0_#in~e.base| .cse1)))))) is different from true [2023-12-02 08:24:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:41,930 INFO L93 Difference]: Finished difference Result 382 states and 584 transitions. [2023-12-02 08:24:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 08:24:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 3.34375) internal successors, (107), 36 states have internal predecessors, (107), 22 states have call successors, (38), 3 states have call predecessors, (38), 12 states have return successors, (43), 18 states have call predecessors, (43), 22 states have call successors, (43) Word has length 2536 [2023-12-02 08:24:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:41,933 INFO L225 Difference]: With dead ends: 382 [2023-12-02 08:24:41,933 INFO L226 Difference]: Without dead ends: 171 [2023-12-02 08:24:41,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3707 GetRequests, 3626 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=542, Invalid=4032, Unknown=18, NotChecked=1260, Total=5852 [2023-12-02 08:24:41,936 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 60 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 974 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:41,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 458 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1056 Invalid, 0 Unknown, 974 Unchecked, 0.7s Time] [2023-12-02 08:24:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-02 08:24:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-12-02 08:24:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 113 states have (on average 1.0973451327433628) internal successors, (124), 117 states have internal predecessors, (124), 43 states have call successors, (43), 4 states have call predecessors, (43), 14 states have return successors, (53), 49 states have call predecessors, (53), 43 states have call successors, (53) [2023-12-02 08:24:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2023-12-02 08:24:41,957 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 2536 [2023-12-02 08:24:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:41,958 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2023-12-02 08:24:41,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 3.34375) internal successors, (107), 36 states have internal predecessors, (107), 22 states have call successors, (38), 3 states have call predecessors, (38), 12 states have return successors, (43), 18 states have call predecessors, (43), 22 states have call successors, (43) [2023-12-02 08:24:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2023-12-02 08:24:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4013 [2023-12-02 08:24:42,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:42,047 INFO L195 NwaCegarLoop]: trace histogram [504, 504, 432, 432, 432, 108, 108, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1] [2023-12-02 08:24:42,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 08:24:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 08:24:42,249 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:24:42,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 420379188, now seen corresponding path program 8 times [2023-12-02 08:24:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178067656] [2023-12-02 08:24:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:26:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 657270 backedges. 106 proven. 34854 refuted. 0 times theorem prover too weak. 622310 trivial. 0 not checked. [2023-12-02 08:26:38,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:26:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178067656] [2023-12-02 08:26:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178067656] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:26:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201158950] [2023-12-02 08:26:38,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:26:38,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:26:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:26:38,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:26:38,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 08:27:16,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2023-12-02 08:27:16,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:27:16,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 2697 conjuncts, 174 conjunts are in the unsatisfiable core [2023-12-02 08:27:16,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:27:16,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-12-02 08:27:17,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:27:17,439 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_53| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_53| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_53| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_53|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_53| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:27:17,445 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_53| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_53| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_53| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_53|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_53| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:27:17,479 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_54| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_54| |c_#memory_int|))) (and (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_54| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_54| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_54|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:27:17,484 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_54| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_54| |c_#memory_int|))) (and (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_54| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_54| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_54|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:27:17,757 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:27:17,852 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:27:17,885 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_68| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_68| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_68|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_68| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:27:17,934 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_68| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_68| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_68|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_68| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:27:17,961 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_69| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_69| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_69| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_69| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_69|) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from false [2023-12-02 08:27:18,043 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_69| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_69| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_69| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_69| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_69|) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|)) is different from true [2023-12-02 08:27:18,508 INFO L349 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2023-12-02 08:27:18,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 438 [2023-12-02 08:27:18,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2023-12-02 08:27:18,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2023-12-02 08:27:18,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 113 [2023-12-02 08:27:18,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,617 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,618 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 162 [2023-12-02 08:27:18,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,640 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,654 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 195 [2023-12-02 08:27:18,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 137 [2023-12-02 08:27:18,713 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-12-02 08:27:18,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:27:18,727 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:27:18,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2023-12-02 08:27:18,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 08:27:18,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 08:27:18,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:27:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 657270 backedges. 34897 proven. 182 refuted. 0 times theorem prover too weak. 622136 trivial. 55 not checked. [2023-12-02 08:27:18,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:27:19,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:27:19,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 08:27:19,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:27:19,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-12-02 08:27:19,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 08:27:20,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:27:20,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 08:27:20,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:27:20,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-12-02 08:27:20,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 08:27:21,544 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_10229 (Array Int Int)) (v_ArrVal_10232 Int) (v_ArrVal_10230 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~f.base v_ArrVal_10229) c_func_to_recursive_line_26_to_27_0_~e.base))) (or (< (+ (select .cse0 c_func_to_recursive_line_26_to_27_0_~e.offset) 1) v_ArrVal_10232) (< (select (select (store (store |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base (store .cse0 c_func_to_recursive_line_26_to_27_0_~e.offset v_ArrVal_10232)) c_func_to_recursive_line_26_to_27_0_~f.base v_ArrVal_10230) c_func_to_recursive_line_26_to_27_0_~e.base) c_func_to_recursive_line_26_to_27_0_~e.offset) 5)))) (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| |c_func_to_recursive_line_26_to_27_0_#in~f.base|)) is different from false [2023-12-02 08:27:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201158950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:27:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897189003] [2023-12-02 08:27:21,553 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 08:27:21,553 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:27:21,554 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 08:27:21,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:27:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 40 [2023-12-02 08:27:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049255543] [2023-12-02 08:27:21,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:27:21,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 08:27:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:27:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 08:27:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1119, Unknown=16, NotChecked=438, Total=1722 [2023-12-02 08:27:21,566 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 40 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 19 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (34), 20 states have call predecessors, (34), 19 states have call successors, (34) [2023-12-02 08:27:23,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|))) (and (= c_func_to_recursive_line_28_to_28_0_~f.base |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_53| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_53| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_53| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_53|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_53| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) .cse1) (= |c_#memory_int| (store |c_old(#memory_int)| c_func_to_recursive_line_28_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_28_to_28_0_~f.base))) (or (exists ((|v_#memory_int_BEFORE_CALL_54| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_54| |c_#memory_int|))) (and (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse2) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_54| .cse2 (select |c_#memory_int| .cse2))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_54| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_54|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_68| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_68| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_68| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_68|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse3) (= (store |v_#memory_int_BEFORE_CALL_68| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse4)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_69| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_69| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_69| .cse5 (select |c_#memory_int| .cse5))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_69| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_69|) (= .cse5 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) .cse1))) is different from false [2023-12-02 08:27:23,978 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |c_#memory_int| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |c_#memory_int|))) (and (= c_func_to_recursive_line_28_to_28_0_~f.base |c_func_to_recursive_line_28_to_28_0_#in~f.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_53| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_53| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_53| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_53|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_53| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) .cse1) (= |c_#memory_int| (store |c_old(#memory_int)| c_func_to_recursive_line_28_to_28_0_~f.base (select |c_#memory_int| c_func_to_recursive_line_28_to_28_0_~f.base))) (or (exists ((|v_#memory_int_BEFORE_CALL_54| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_54| |c_#memory_int|))) (and (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse2) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_54| .cse2 (select |c_#memory_int| .cse2))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_54| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_54|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_68| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_68| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_68| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_68|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse3) (= (store |v_#memory_int_BEFORE_CALL_68| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |c_func_to_recursive_line_28_to_28_0_#in~f.base| .cse4)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_69| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_69| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_69| .cse5 (select |c_#memory_int| .cse5))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_28_to_28_0_#in~f.base| (select |v_#memory_int_BEFORE_CALL_69| |c_func_to_recursive_line_28_to_28_0_#in~f.base|)) |v_#memory_int_BEFORE_CALL_69|) (= .cse5 |c_func_to_recursive_line_28_to_28_0_#in~f.base|)))) .cse1))) is different from true [2023-12-02 08:27:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:27:26,497 INFO L93 Difference]: Finished difference Result 369 states and 517 transitions. [2023-12-02 08:27:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 08:27:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 19 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (34), 20 states have call predecessors, (34), 19 states have call successors, (34) Word has length 4012 [2023-12-02 08:27:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:27:26,499 INFO L225 Difference]: With dead ends: 369 [2023-12-02 08:27:26,499 INFO L226 Difference]: Without dead ends: 175 [2023-12-02 08:27:26,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4129 GetRequests, 4056 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=356, Invalid=2727, Unknown=25, NotChecked=798, Total=3906 [2023-12-02 08:27:26,502 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 42 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:27:26,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 368 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 805 Invalid, 9 Unknown, 518 Unchecked, 1.7s Time] [2023-12-02 08:27:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-02 08:27:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-02 08:27:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 115 states have (on average 1.0956521739130434) internal successors, (126), 119 states have internal predecessors, (126), 43 states have call successors, (43), 4 states have call predecessors, (43), 16 states have return successors, (55), 51 states have call predecessors, (55), 43 states have call successors, (55) [2023-12-02 08:27:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions. [2023-12-02 08:27:26,530 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 4012 [2023-12-02 08:27:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:27:26,532 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 224 transitions. [2023-12-02 08:27:26,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 19 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (34), 20 states have call predecessors, (34), 19 states have call successors, (34) [2023-12-02 08:27:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions. [2023-12-02 08:27:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6965 [2023-12-02 08:27:26,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:27:26,929 INFO L195 NwaCegarLoop]: trace histogram [1008, 1008, 864, 864, 864, 180, 180, 144, 144, 144, 144, 144, 144, 144, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1] [2023-12-02 08:27:26,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 08:27:27,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51a586ea-7e97-4cfb-bdc4-63e181a2b998/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 08:27:27,130 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:27:27,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:27:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1087698252, now seen corresponding path program 9 times [2023-12-02 08:27:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:27:27,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997922025] [2023-12-02 08:27:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:27:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:27:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat