./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/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_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/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_07552794-0fc5-4aa4-a55d-2ab815784e98/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 dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:37:35,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:37:35,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:37:35,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:37:35,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:37:35,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:37:35,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:37:35,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:37:35,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:37:35,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:37:35,996 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:37:35,996 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:37:35,997 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:37:35,997 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:37:35,998 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:37:35,998 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:37:35,999 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:37:35,999 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:37:36,000 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:37:36,000 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:37:36,001 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:37:36,003 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:37:36,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:37:36,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:37:36,005 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:37:36,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:37:36,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:37:36,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:37:36,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:37:36,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:37:36,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:37:36,007 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:37:36,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:37:36,008 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:37:36,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:37:36,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:37:36,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:37:36,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:37:36,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:37:36,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:37:36,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:37:36,009 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:37:36,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:37:36,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:37:36,010 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:37:36,010 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:37:36,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:37:36,010 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_07552794-0fc5-4aa4-a55d-2ab815784e98/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_07552794-0fc5-4aa4-a55d-2ab815784e98/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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2023-12-02 17:37:36,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:37:36,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:37:36,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:37:36,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:37:36,246 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:37:36,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2023-12-02 17:37:39,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:37:39,277 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:37:39,278 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2023-12-02 17:37:39,286 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/data/f06da1cf3/e0eba4ca5c844499ab187e2b8694dc9e/FLAGb861b3c48 [2023-12-02 17:37:39,300 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/data/f06da1cf3/e0eba4ca5c844499ab187e2b8694dc9e [2023-12-02 17:37:39,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:37:39,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:37:39,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:37:39,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:37:39,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:37:39,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590e009b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39, skipping insertion in model container [2023-12-02 17:37:39,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,334 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:37:39,471 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_07552794-0fc5-4aa4-a55d-2ab815784e98/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2023-12-02 17:37:39,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:37:39,504 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:37:39,518 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_07552794-0fc5-4aa4-a55d-2ab815784e98/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2023-12-02 17:37:39,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:37:39,548 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:37:39,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39 WrapperNode [2023-12-02 17:37:39,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:37:39,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:37:39,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:37:39,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:37:39,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,585 INFO L138 Inliner]: procedures = 16, calls = 71, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-12-02 17:37:39,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:37:39,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:37:39,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:37:39,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:37:39,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:37:39,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:37:39,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:37:39,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:37:39,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (1/1) ... [2023-12-02 17:37:39,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:37:39,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:39,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:37:39,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:37:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2023-12-02 17:37:39,697 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2023-12-02 17:37:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:37:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2023-12-02 17:37:39,697 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2023-12-02 17:37:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2023-12-02 17:37:39,697 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2023-12-02 17:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2023-12-02 17:37:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2023-12-02 17:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2023-12-02 17:37:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2023-12-02 17:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:37:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:37:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:37:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:37:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:37:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:37:39,813 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:37:39,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:37:40,122 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:37:40,198 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:37:40,198 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 17:37:40,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:40 BoogieIcfgContainer [2023-12-02 17:37:40,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:37:40,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:37:40,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:37:40,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:37:40,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:37:39" (1/3) ... [2023-12-02 17:37:40,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f477f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:40, skipping insertion in model container [2023-12-02 17:37:40,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:39" (2/3) ... [2023-12-02 17:37:40,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f477f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:40, skipping insertion in model container [2023-12-02 17:37:40,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:40" (3/3) ... [2023-12-02 17:37:40,210 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_deep-nested.c [2023-12-02 17:37:40,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:37:40,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:37:40,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:37:40,275 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;@5ed8f825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:37:40,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 17:37:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 17:37:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:37:40,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:40,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:40,286 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:37:40,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2117252113, now seen corresponding path program 1 times [2023-12-02 17:37:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391347910] [2023-12-02 17:37:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:43,143 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 17:37:43,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391347910] [2023-12-02 17:37:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391347910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:37:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:37:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 17:37:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190227898] [2023-12-02 17:37:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:37:43,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 17:37:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:43,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 17:37:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:37:43,177 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 16 states, 13 states have (on average 1.0) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:43,920 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2023-12-02 17:37:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 17:37:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.0) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:37:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:43,931 INFO L225 Difference]: With dead ends: 111 [2023-12-02 17:37:43,931 INFO L226 Difference]: Without dead ends: 65 [2023-12-02 17:37:43,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2023-12-02 17:37:43,939 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:43,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 292 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:37:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-02 17:37:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-12-02 17:37:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 45 states have internal predecessors, (46), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2023-12-02 17:37:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2023-12-02 17:37:43,988 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 18 [2023-12-02 17:37:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:43,989 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2023-12-02 17:37:43,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.0) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2023-12-02 17:37:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 17:37:43,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:43,992 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] [2023-12-02 17:37:43,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:37:43,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:37:43,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash 200392441, now seen corresponding path program 1 times [2023-12-02 17:37:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223938839] [2023-12-02 17:37:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:45,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223938839] [2023-12-02 17:37:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223938839] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568675113] [2023-12-02 17:37:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:45,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:45,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:45,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:45,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:37:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:45,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 142 conjunts are in the unsatisfiable core [2023-12-02 17:37:45,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:45,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:45,900 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 2841 treesize of output 2813 [2023-12-02 17:37:46,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 17:37:46,502 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:37:46,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:37:46,720 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 17:37:46,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:37:47,062 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2023-12-02 17:37:47,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 39 [2023-12-02 17:37:47,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:47,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 211 [2023-12-02 17:37:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:47,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:57,296 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-02 17:37:57,297 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 463 treesize of output 446 [2023-12-02 17:37:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568675113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [703759032] [2023-12-02 17:37:57,727 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 17:37:57,727 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:37:57,730 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 17:37:57,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:37:57,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2023-12-02 17:37:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933924093] [2023-12-02 17:37:57,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:57,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-02 17:37:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-02 17:37:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2617, Unknown=3, NotChecked=0, Total=2756 [2023-12-02 17:37:57,738 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 18 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:38:02,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base)) (.cse3 (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base|))) (let ((.cse5 (select .cse3 |c_func_to_recursive_line_14_to_16_0_#in~e.offset|)) (.cse8 (select .cse14 c_func_to_recursive_line_14_to_16_0_~e.offset))) (and (let ((.cse4 (+ .cse5 1))) (let ((.cse2 (mod .cse4 4294967296)) (.cse0 (store |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base| (store .cse3 |c_func_to_recursive_line_14_to_16_0_#in~e.offset| .cse4)))) (or (forall ((func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int)) (let ((.cse1 (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (or (not (= (mod (select (select .cse0 |c_func_to_recursive_line_14_to_16_0_#in~c.base|) |c_func_to_recursive_line_14_to_16_0_#in~c.offset|) 4294967296) .cse1)) (not (= .cse2 .cse1))))) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse2 (mod (+ (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))))))) (let ((.cse6 (mod .cse8 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= (mod (+ (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse6))) (forall ((func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int)) (let ((.cse7 (mod (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (or (not (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~c.base) c_func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) .cse7)) (not (= .cse7 .cse6))))))) (let ((.cse9 (mod .cse5 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse9 (mod (+ (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296)))) (forall ((func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int)) (let ((.cse10 (mod (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (or (not (= (mod (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~c.base|) |c_func_to_recursive_line_14_to_16_0_#in~c.offset|) 4294967296) .cse10)) (not (= .cse9 .cse10))))))) (let ((.cse15 (+ .cse8 1))) (let ((.cse11 (mod .cse15 4294967296)) (.cse12 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base (store .cse14 c_func_to_recursive_line_14_to_16_0_~e.offset .cse15)))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse11 (mod (+ (select (select .cse12 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296)))) (forall ((func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int)) (let ((.cse13 (mod (select (select .cse12 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (or (not (= .cse13 (mod (select (select .cse12 c_func_to_recursive_line_14_to_16_0_~c.base) c_func_to_recursive_line_14_to_16_0_~c.offset) 4294967296))) (not (= .cse11 .cse13))))))))))) is different from false [2023-12-02 17:38:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:07,414 INFO L93 Difference]: Finished difference Result 123 states and 156 transitions. [2023-12-02 17:38:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 17:38:07,415 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 40 states have (on average 1.175) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 18 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 17:38:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:07,418 INFO L225 Difference]: With dead ends: 123 [2023-12-02 17:38:07,418 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 17:38:07,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=387, Invalid=6585, Unknown=4, NotChecked=164, Total=7140 [2023-12-02 17:38:07,422 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 160 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:07,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 840 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1307 Invalid, 0 Unknown, 155 Unchecked, 3.7s Time] [2023-12-02 17:38:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 17:38:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2023-12-02 17:38:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 20 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (32), 10 states have call predecessors, (32), 18 states have call successors, (32) [2023-12-02 17:38:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2023-12-02 17:38:07,451 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 23 [2023-12-02 17:38:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:07,452 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2023-12-02 17:38:07,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 40 states have (on average 1.175) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 18 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:38:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2023-12-02 17:38:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:38:07,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:07,455 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] [2023-12-02 17:38:07,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:38:07,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:07,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:38:07,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1001565442, now seen corresponding path program 1 times [2023-12-02 17:38:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477088096] [2023-12-02 17:38:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:09,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477088096] [2023-12-02 17:38:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477088096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745757520] [2023-12-02 17:38:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:09,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:09,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:38:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:09,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 17:38:09,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:09,887 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 75 treesize of output 73 [2023-12-02 17:38:09,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-02 17:38:09,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-12-02 17:38:09,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 17:38:09,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-12-02 17:38:09,940 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:38:10,359 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-12-02 17:38:10,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 105 [2023-12-02 17:38:10,396 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:38:10,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:38:10,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:10,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 17:38:10,590 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 44 treesize of output 42 [2023-12-02 17:38:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 17:38:11,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 17:38:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:11,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:38:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745757520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:38:11,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:38:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [23] total 35 [2023-12-02 17:38:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525300848] [2023-12-02 17:38:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:38:11,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 17:38:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 17:38:11,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 17:38:11,363 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:38:13,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:38:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:14,345 INFO L93 Difference]: Finished difference Result 201 states and 262 transitions. [2023-12-02 17:38:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 17:38:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-12-02 17:38:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:14,348 INFO L225 Difference]: With dead ends: 201 [2023-12-02 17:38:14,348 INFO L226 Difference]: Without dead ends: 117 [2023-12-02 17:38:14,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=1757, Unknown=0, NotChecked=0, Total=1892 [2023-12-02 17:38:14,351 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:14,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 204 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 373 Invalid, 3 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 17:38:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-02 17:38:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2023-12-02 17:38:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.25) internal successors, (90), 85 states have internal predecessors, (90), 20 states have call successors, (20), 18 states have call predecessors, (20), 20 states have return successors, (37), 10 states have call predecessors, (37), 18 states have call successors, (37) [2023-12-02 17:38:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2023-12-02 17:38:14,379 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 27 [2023-12-02 17:38:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:14,379 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2023-12-02 17:38:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:38:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2023-12-02 17:38:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:38:14,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:14,382 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] [2023-12-02 17:38:14,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 17:38:14,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:14,583 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:38:14,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -53924427, now seen corresponding path program 1 times [2023-12-02 17:38:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:14,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086910337] [2023-12-02 17:38:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:17,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086910337] [2023-12-02 17:38:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086910337] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670849950] [2023-12-02 17:38:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:17,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:17,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:17,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:17,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 17:38:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:17,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 17:38:17,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:17,362 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 1998 treesize of output 1966 [2023-12-02 17:38:17,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 17:38:17,393 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:38:17,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-02 17:38:17,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:17,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-02 17:38:17,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 17:38:17,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:38:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 17:38:17,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:38:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:17,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670849950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1963693128] [2023-12-02 17:38:19,343 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 17:38:19,343 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:38:19,343 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 17:38:19,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:38:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2023-12-02 17:38:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331358670] [2023-12-02 17:38:19,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:19,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 17:38:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:19,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 17:38:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1781, Unknown=0, NotChecked=0, Total=1892 [2023-12-02 17:38:19,347 INFO L87 Difference]: Start difference. First operand 113 states and 147 transitions. Second operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 13 states have call predecessors, (14), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:38:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:22,571 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2023-12-02 17:38:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 17:38:22,572 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 13 states have call predecessors, (14), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 17:38:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:22,574 INFO L225 Difference]: With dead ends: 206 [2023-12-02 17:38:22,574 INFO L226 Difference]: Without dead ends: 204 [2023-12-02 17:38:22,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=489, Invalid=7167, Unknown=0, NotChecked=0, Total=7656 [2023-12-02 17:38:22,577 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 158 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:22,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 472 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:38:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-02 17:38:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 189. [2023-12-02 17:38:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 138 states have internal predecessors, (146), 34 states have call successors, (34), 29 states have call predecessors, (34), 37 states have return successors, (73), 22 states have call predecessors, (73), 32 states have call successors, (73) [2023-12-02 17:38:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 253 transitions. [2023-12-02 17:38:22,604 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 253 transitions. Word has length 27 [2023-12-02 17:38:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:22,604 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 253 transitions. [2023-12-02 17:38:22,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 13 states have call predecessors, (14), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:38:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 253 transitions. [2023-12-02 17:38:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:38:22,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:22,606 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] [2023-12-02 17:38:22,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 17:38:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:22,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:38:22,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -566109157, now seen corresponding path program 1 times [2023-12-02 17:38:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:22,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511456819] [2023-12-02 17:38:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:24,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:24,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511456819] [2023-12-02 17:38:24,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511456819] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:24,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834495525] [2023-12-02 17:38:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:24,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:24,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:24,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:24,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 17:38:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:25,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 198 conjunts are in the unsatisfiable core [2023-12-02 17:38:25,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:25,173 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 17:38:25,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:25,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-12-02 17:38:25,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 17:38:25,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-12-02 17:38:25,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:25,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:38:25,227 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-02 17:38:25,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 541 treesize of output 545 [2023-12-02 17:38:25,837 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:38:25,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:38:26,114 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 17:38:26,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:38:26,255 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-02 17:38:26,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2023-12-02 17:38:26,453 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 17:38:26,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-12-02 17:38:26,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:38:26,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:38:27,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:27,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 169 treesize of output 249 [2023-12-02 17:38:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:27,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:29,236 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_292 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_292))) (store .cse1 c_func_to_recursive_line_12_to_13_0_~e.base (store (select .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))))) (or (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 4294967296) 0)) (not (= (mod (+ 4294967294 (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) 0))))) is different from false [2023-12-02 17:38:29,351 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_292 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_func_to_recursive_line_12_to_13_0_#in~d.base| v_ArrVal_292))) (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| (store (select .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 0))))) (or (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 |c_func_to_recursive_line_12_to_13_0_#in~b.base|) |c_func_to_recursive_line_12_to_13_0_#in~b.offset|) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) 0)) (not (= (mod (+ 4294967294 (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0))))) is different from false [2023-12-02 17:38:29,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_292 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~d.base v_ArrVal_292))) (store .cse1 c_func_to_recursive_line_11_to_12_0_~e.base (store (select .cse1 c_func_to_recursive_line_11_to_12_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))))) (or (not (= (mod (+ 4294967294 (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) 0))))) is different from false [2023-12-02 17:38:29,418 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~c.base v_ArrVal_291) c_func_to_recursive_line_11_to_12_0_~d.base v_ArrVal_292))) (store .cse1 c_func_to_recursive_line_11_to_12_0_~e.base (store (select .cse1 c_func_to_recursive_line_11_to_12_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))))) (or (not (= (mod (select (select .cse0 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) 0)) (not (= (mod (+ 4294967294 (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) 0))))) is different from false [2023-12-02 17:38:29,455 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_func_to_recursive_line_11_to_12_0_#in~c.base| v_ArrVal_291) |c_func_to_recursive_line_11_to_12_0_#in~d.base| v_ArrVal_292))) (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| (store (select .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 0))))) (or (not (= (mod (+ (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0)) (not (= 0 (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~b.base|) |c_func_to_recursive_line_11_to_12_0_#in~b.offset|) 4294967296) 0))))) is different from false [2023-12-02 17:38:29,532 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (let ((.cse1 (store (store (store |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~b.base (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~b.base))) (store .cse2 c_func_to_recursive_line_11_to_12_0_~b.offset (+ (select .cse2 c_func_to_recursive_line_11_to_12_0_~b.offset) 1)))) c_func_to_recursive_line_11_to_12_0_~c.base v_ArrVal_291) c_func_to_recursive_line_11_to_12_0_~d.base v_ArrVal_292))) (store .cse1 c_func_to_recursive_line_11_to_12_0_~e.base (store (select .cse1 c_func_to_recursive_line_11_to_12_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))))) (or (not (= (mod (select (select .cse0 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) 0)) (not (= (mod (+ 4294967294 (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) 0))))) is different from false [2023-12-02 17:38:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834495525] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:29,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [392046114] [2023-12-02 17:38:29,586 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 17:38:29,586 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:38:29,586 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 17:38:29,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:38:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2023-12-02 17:38:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23718769] [2023-12-02 17:38:29,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:29,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 17:38:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 17:38:29,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1878, Unknown=6, NotChecked=546, Total=2550 [2023-12-02 17:38:29,590 INFO L87 Difference]: Start difference. First operand 189 states and 253 transitions. Second operand has 39 states, 30 states have (on average 1.1) internal successors, (33), 26 states have internal predecessors, (33), 14 states have call successors, (14), 13 states have call predecessors, (14), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:38:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:33,567 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2023-12-02 17:38:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 17:38:33,568 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.1) internal successors, (33), 26 states have internal predecessors, (33), 14 states have call successors, (14), 13 states have call predecessors, (14), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 17:38:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:33,570 INFO L225 Difference]: With dead ends: 253 [2023-12-02 17:38:33,570 INFO L226 Difference]: Without dead ends: 251 [2023-12-02 17:38:33,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=356, Invalid=5212, Unknown=6, NotChecked=906, Total=6480 [2023-12-02 17:38:33,573 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:33,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 724 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 17:38:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-02 17:38:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 227. [2023-12-02 17:38:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 140 states have (on average 1.25) internal successors, (175), 165 states have internal predecessors, (175), 41 states have call successors, (41), 35 states have call predecessors, (41), 45 states have return successors, (93), 28 states have call predecessors, (93), 39 states have call successors, (93) [2023-12-02 17:38:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2023-12-02 17:38:33,617 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 27 [2023-12-02 17:38:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:33,618 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2023-12-02 17:38:33,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.1) internal successors, (33), 26 states have internal predecessors, (33), 14 states have call successors, (14), 13 states have call predecessors, (14), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:38:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2023-12-02 17:38:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:38:33,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:33,620 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] [2023-12-02 17:38:33,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 17:38:33,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:33,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:38:33,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -438203139, now seen corresponding path program 1 times [2023-12-02 17:38:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505703115] [2023-12-02 17:38:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:36,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505703115] [2023-12-02 17:38:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505703115] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381029948] [2023-12-02 17:38:36,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:36,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:36,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:36,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:36,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:38:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:36,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-02 17:38:36,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:36,230 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 26 treesize of output 24 [2023-12-02 17:38:36,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 17:38:36,418 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 17:38:36,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:38:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:36,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:38:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381029948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:38:36,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:38:36,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [21] total 27 [2023-12-02 17:38:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556108176] [2023-12-02 17:38:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:38:36,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 17:38:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 17:38:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2023-12-02 17:38:36,572 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:38:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:36,903 INFO L93 Difference]: Finished difference Result 321 states and 429 transitions. [2023-12-02 17:38:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:38:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-12-02 17:38:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:36,907 INFO L225 Difference]: With dead ends: 321 [2023-12-02 17:38:36,907 INFO L226 Difference]: Without dead ends: 229 [2023-12-02 17:38:36,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2023-12-02 17:38:36,909 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:36,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 130 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:38:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-02 17:38:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2023-12-02 17:38:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 164 states have internal predecessors, (174), 41 states have call successors, (41), 35 states have call predecessors, (41), 45 states have return successors, (93), 28 states have call predecessors, (93), 39 states have call successors, (93) [2023-12-02 17:38:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 308 transitions. [2023-12-02 17:38:36,947 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 308 transitions. Word has length 27 [2023-12-02 17:38:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:36,947 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 308 transitions. [2023-12-02 17:38:36,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:38:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 308 transitions. [2023-12-02 17:38:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:38:36,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:36,949 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:38:36,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 17:38:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 17:38:37,150 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:38:37,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2048526579, now seen corresponding path program 1 times [2023-12-02 17:38:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367421084] [2023-12-02 17:38:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:38,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367421084] [2023-12-02 17:38:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367421084] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173644379] [2023-12-02 17:38:38,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:38,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:38,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:38:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:39,110 WARN L260 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 437 conjunts are in the unsatisfiable core [2023-12-02 17:38:39,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:39,142 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-12-02 17:38:39,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 76 [2023-12-02 17:38:39,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 17:38:39,726 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:38:39,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:38:40,317 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 17:38:40,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 17:38:40,928 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 17:38:40,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2023-12-02 17:38:41,554 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 17:38:41,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 51 [2023-12-02 17:38:41,731 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-12-02 17:38:41,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 51 [2023-12-02 17:38:42,201 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-12-02 17:38:42,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 58 [2023-12-02 17:38:43,114 INFO L349 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2023-12-02 17:38:43,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 54 treesize of output 65 [2023-12-02 17:38:43,832 INFO L349 Elim1Store]: treesize reduction 44, result has 72.7 percent of original size [2023-12-02 17:38:43,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 109 treesize of output 189 [2023-12-02 17:38:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:43,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173644379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281175733] [2023-12-02 17:38:46,456 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:38:46,456 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:38:46,456 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 17:38:46,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:38:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-12-02 17:38:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298115283] [2023-12-02 17:38:46,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 17:38:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 17:38:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2563, Unknown=0, NotChecked=0, Total=2756 [2023-12-02 17:38:46,459 INFO L87 Difference]: Start difference. First operand 227 states and 308 transitions. Second operand has 44 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 29 states have internal predecessors, (41), 16 states have call successors, (16), 15 states have call predecessors, (16), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:38:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:52,273 INFO L93 Difference]: Finished difference Result 279 states and 376 transitions. [2023-12-02 17:38:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 17:38:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 29 states have internal predecessors, (41), 16 states have call successors, (16), 15 states have call predecessors, (16), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-12-02 17:38:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:52,276 INFO L225 Difference]: With dead ends: 279 [2023-12-02 17:38:52,276 INFO L226 Difference]: Without dead ends: 277 [2023-12-02 17:38:52,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=542, Invalid=7648, Unknown=0, NotChecked=0, Total=8190 [2023-12-02 17:38:52,279 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 157 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:52,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 625 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 17:38:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-12-02 17:38:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2023-12-02 17:38:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 163 states have (on average 1.2392638036809815) internal successors, (202), 191 states have internal predecessors, (202), 47 states have call successors, (47), 40 states have call predecessors, (47), 52 states have return successors, (109), 34 states have call predecessors, (109), 45 states have call successors, (109) [2023-12-02 17:38:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 358 transitions. [2023-12-02 17:38:52,320 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 358 transitions. Word has length 32 [2023-12-02 17:38:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:52,321 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 358 transitions. [2023-12-02 17:38:52,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 29 states have internal predecessors, (41), 16 states have call successors, (16), 15 states have call predecessors, (16), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:38:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 358 transitions. [2023-12-02 17:38:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 17:38:52,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:52,323 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:38:52,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:38:52,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 17:38:52,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:38:52,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1091391673, now seen corresponding path program 2 times [2023-12-02 17:38:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886602976] [2023-12-02 17:38:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:54,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:54,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886602976] [2023-12-02 17:38:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886602976] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:54,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706412542] [2023-12-02 17:38:54,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:38:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:54,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:54,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:38:54,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 17:38:54,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:38:54,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 178 conjunts are in the unsatisfiable core [2023-12-02 17:38:54,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:54,721 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 1094 treesize of output 1078 [2023-12-02 17:38:54,827 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 17:38:55,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 17:38:55,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:38:55,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:38:55,418 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 17:38:55,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:38:55,551 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 17:38:55,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:38:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:55,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:57,154 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 35 treesize of output 31 [2023-12-02 17:38:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706412542] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:38:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [37376533] [2023-12-02 17:38:57,589 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 17:38:57,589 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:38:57,589 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 17:38:57,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:38:57,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 64 [2023-12-02 17:38:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600703904] [2023-12-02 17:38:57,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:57,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-12-02 17:38:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-12-02 17:38:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=3899, Unknown=0, NotChecked=0, Total=4160 [2023-12-02 17:38:57,594 INFO L87 Difference]: Start difference. First operand 263 states and 358 transitions. Second operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 40 states have internal predecessors, (71), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:39:29,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base|)) (.cse2 (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base))) (let ((.cse4 (select .cse2 c_func_to_recursive_line_14_to_16_0_~e.offset)) (.cse9 (select .cse7 |c_func_to_recursive_line_14_to_16_0_#in~e.offset|))) (and (let ((.cse3 (+ .cse4 1))) (let ((.cse0 (mod .cse3 4294967296)) (.cse1 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base (store .cse2 c_func_to_recursive_line_14_to_16_0_~e.offset .cse3)))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse0 (mod (+ (select (select .cse1 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296)))) (not (= .cse0 (mod (select (select .cse1 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296)))))) (let ((.cse8 (+ .cse9 3))) (let ((.cse5 (mod .cse8 4294967296)) (.cse6 (store |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base| (store .cse7 |c_func_to_recursive_line_14_to_16_0_#in~e.offset| .cse8)))) (or (not (= .cse5 (mod (select (select .cse6 |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296))) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse5 (mod (+ 4294967294 (select (select .cse6 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))))))) (let ((.cse12 (+ .cse9 2))) (let ((.cse10 (store |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base| (store .cse7 |c_func_to_recursive_line_14_to_16_0_#in~e.offset| .cse12))) (.cse11 (mod .cse12 4294967296))) (or (not (= (mod (select (select .cse10 |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296) .cse11)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= (mod (+ 4294967294 (select (select .cse10 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse11)))))) (let ((.cse15 (+ 3 .cse4))) (let ((.cse13 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base (store .cse2 c_func_to_recursive_line_14_to_16_0_~e.offset .cse15))) (.cse14 (mod .cse15 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= (mod (+ 4294967294 (select (select .cse13 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse14))) (not (= (mod (select (select .cse13 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) .cse14))))) (let ((.cse16 (mod .cse9 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse16 (mod (+ (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296)))) (not (= .cse16 (mod (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296))))) (let ((.cse19 (+ 2 .cse4))) (let ((.cse17 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base (store .cse2 c_func_to_recursive_line_14_to_16_0_~e.offset .cse19))) (.cse18 (mod .cse19 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= (mod (+ (select (select .cse17 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse18))) (not (= (mod (select (select .cse17 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) .cse18))))) (let ((.cse20 (mod .cse4 4294967296))) (or (not (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) .cse20)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= (mod (+ (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse20))))) (let ((.cse23 (+ .cse9 1))) (let ((.cse21 (mod .cse23 4294967296)) (.cse22 (store |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base| (store .cse7 |c_func_to_recursive_line_14_to_16_0_#in~e.offset| .cse23)))) (or (not (= .cse21 (mod (select (select .cse22 |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296))) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (not (= .cse21 (mod (+ (select (select .cse22 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296)))))))))) is different from false [2023-12-02 17:39:31,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:49,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:51,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:53,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:55,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:39:57,178 INFO L93 Difference]: Finished difference Result 513 states and 683 transitions. [2023-12-02 17:39:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-12-02 17:39:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 40 states have internal predecessors, (71), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-02 17:39:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:39:57,183 INFO L225 Difference]: With dead ends: 513 [2023-12-02 17:39:57,183 INFO L226 Difference]: Without dead ends: 511 [2023-12-02 17:39:57,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3855 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=1145, Invalid=13375, Unknown=4, NotChecked=238, Total=14762 [2023-12-02 17:39:57,189 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 258 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 120 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:39:57,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1038 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1856 Invalid, 2 Unknown, 253 Unchecked, 17.8s Time] [2023-12-02 17:39:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-02 17:39:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 448. [2023-12-02 17:39:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 284 states have (on average 1.2394366197183098) internal successors, (352), 332 states have internal predecessors, (352), 72 states have call successors, (72), 64 states have call predecessors, (72), 91 states have return successors, (176), 56 states have call predecessors, (176), 70 states have call successors, (176) [2023-12-02 17:39:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 600 transitions. [2023-12-02 17:39:57,272 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 600 transitions. Word has length 33 [2023-12-02 17:39:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:39:57,273 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 600 transitions. [2023-12-02 17:39:57,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 40 states have internal predecessors, (71), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:39:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 600 transitions. [2023-12-02 17:39:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 17:39:57,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:39:57,275 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 17:39:57,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:39:57,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:39:57,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:39:57,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:39:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 889859728, now seen corresponding path program 1 times [2023-12-02 17:39:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:39:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100019067] [2023-12-02 17:39:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:39:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:39:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:39:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:39:59,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:39:59,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100019067] [2023-12-02 17:39:59,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100019067] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:39:59,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903910730] [2023-12-02 17:39:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:39:59,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:39:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:39:59,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:39:59,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:40:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:40:00,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 159 conjunts are in the unsatisfiable core [2023-12-02 17:40:00,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:40:00,128 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:40:00,128 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 13855 treesize of output 13663 [2023-12-02 17:40:00,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 17:40:00,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:40:01,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:40:01,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2023-12-02 17:40:01,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 17:40:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:40:01,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:40:03,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:03,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 645 treesize of output 535 [2023-12-02 17:40:05,921 WARN L854 $PredicateComparison]: unable to prove that (and (or (< (mod (+ 4294967295 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_14_to_16_0_#in~uint32_max.base|) |c_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset|)) 4294967296) (+ (mod (select (select |c_old(#memory_int)| |c_func_to_recursive_line_14_to_16_0_#in~e.base|) |c_func_to_recursive_line_14_to_16_0_#in~e.offset|) 4294967296) 1)) (forall ((|v_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1| Int) (|v_func_to_recursive_line_14_to_16_0_#in~uint32_max.base_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_int| |v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1|))) (let ((.cse1 (+ (select .cse0 |v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1|) 1))) (< (mod (+ (select (select (store |c_#memory_int| |v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1| (store .cse0 |v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1| .cse1)) |v_func_to_recursive_line_14_to_16_0_#in~uint32_max.base_BEFORE_CALL_2|) |v_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset_BEFORE_CALL_2|) 4294967295) 4294967296) (+ (mod .cse1 4294967296) 1)))))) (forall ((|v_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1| Int) (|v_func_to_recursive_line_14_to_16_0_#in~uint32_max.base_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1| Int)) (or (let ((.cse2 (select |c_#memory_int| |v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1|))) (let ((.cse3 (+ (select .cse2 |v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1|) 1))) (< (mod (+ (select (select (store |c_#memory_int| |v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1| (store .cse2 |v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1| .cse3)) |v_func_to_recursive_line_14_to_16_0_#in~uint32_max.base_BEFORE_CALL_2|) |v_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset_BEFORE_CALL_2|) 4294967295) 4294967296) (+ (mod .cse3 4294967296) 1)))) (let ((.cse5 (select |c_old(#memory_int)| |v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1|))) (let ((.cse4 (+ (select .cse5 |v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1|) 1))) (< (mod .cse4 4294967296) (mod (+ 4294967295 (select (select (store |c_old(#memory_int)| |v_func_to_recursive_line_14_to_16_0_#in~d.base_BEFORE_CALL_1| (store .cse5 |v_func_to_recursive_line_14_to_16_0_#in~d.offset_BEFORE_CALL_1| .cse4)) |v_func_to_recursive_line_14_to_16_0_#in~uint32_max.base_BEFORE_CALL_2|) |v_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset_BEFORE_CALL_2|)) 4294967296))))))) is different from false [2023-12-02 17:40:08,733 INFO L349 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2023-12-02 17:40:08,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 693 treesize of output 1 [2023-12-02 17:40:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 17:40:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903910730] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:40:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498510976] [2023-12-02 17:40:08,737 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:40:08,737 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:40:08,738 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 17:40:08,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:40:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 17] total 62 [2023-12-02 17:40:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143513979] [2023-12-02 17:40:08,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:40:08,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-02 17:40:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:40:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-02 17:40:08,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3467, Unknown=1, NotChecked=118, Total=3782 [2023-12-02 17:40:08,740 INFO L87 Difference]: Start difference. First operand 448 states and 600 transitions. Second operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 44 states have internal predecessors, (67), 21 states have call successors, (23), 18 states have call predecessors, (23), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:40:25,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:27,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:29,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:31,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:33,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:35,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:37,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:40,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:42,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:44,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:46,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:48,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:50,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:52,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:54,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:40:56,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 17:40:58,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:00,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:02,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:04,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:06,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:08,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:10,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:13,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:15,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:17,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:19,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:21,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:23,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:25,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:27,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:29,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:31,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:33,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:35,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:37,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 17:41:39,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:41,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:41:43,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 17:43:20,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:22,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:24,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:26,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:28,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:31,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:34,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:36,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:38,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:40,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:42,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:44,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:46,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:48,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:50,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:52,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:54,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:56,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:43:58,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 17:44:00,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:44:02,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:44:04,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:44:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:31,962 INFO L93 Difference]: Finished difference Result 799 states and 1120 transitions. [2023-12-02 17:44:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-02 17:44:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 44 states have internal predecessors, (67), 21 states have call successors, (23), 18 states have call predecessors, (23), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-02 17:44:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:31,969 INFO L225 Difference]: With dead ends: 799 [2023-12-02 17:44:31,969 INFO L226 Difference]: Without dead ends: 403 [2023-12-02 17:44:31,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2714 ImplicationChecksByTransitivity, 137.7s TimeCoverageRelationStatistics Valid=868, Invalid=13361, Unknown=55, NotChecked=236, Total=14520 [2023-12-02 17:44:31,973 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 199 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 156 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 132.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:31,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 605 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1993 Invalid, 61 Unknown, 141 Unchecked, 132.5s Time] [2023-12-02 17:44:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-02 17:44:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 378. [2023-12-02 17:44:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 237 states have (on average 1.1983122362869199) internal successors, (284), 274 states have internal predecessors, (284), 64 states have call successors, (64), 54 states have call predecessors, (64), 76 states have return successors, (156), 52 states have call predecessors, (156), 62 states have call successors, (156) [2023-12-02 17:44:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 504 transitions. [2023-12-02 17:44:32,065 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 504 transitions. Word has length 34 [2023-12-02 17:44:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:32,066 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 504 transitions. [2023-12-02 17:44:32,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 44 states have internal predecessors, (67), 21 states have call successors, (23), 18 states have call predecessors, (23), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 504 transitions. [2023-12-02 17:44:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 17:44:32,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:32,067 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 17:44:32,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 17:44:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:32,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:44:32,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1989817426, now seen corresponding path program 1 times [2023-12-02 17:44:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:44:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779328729] [2023-12-02 17:44:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:44:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:35,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:44:35,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779328729] [2023-12-02 17:44:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779328729] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:44:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377778531] [2023-12-02 17:44:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:35,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:35,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:44:35,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 17:44:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:35,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 127 conjunts are in the unsatisfiable core [2023-12-02 17:44:35,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:35,413 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 17:44:35,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-12-02 17:44:35,442 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-02 17:44:35,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 430 treesize of output 425 [2023-12-02 17:44:35,854 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 17:44:35,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:44:36,146 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 17:44:36,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 17:44:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:44:36,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377778531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:44:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [28] total 37 [2023-12-02 17:44:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102181158] [2023-12-02 17:44:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:36,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:44:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:44:36,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:44:36,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 17:44:36,380 INFO L87 Difference]: Start difference. First operand 378 states and 504 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:44:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:37,060 INFO L93 Difference]: Finished difference Result 660 states and 869 transitions. [2023-12-02 17:44:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:44:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-12-02 17:44:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:37,063 INFO L225 Difference]: With dead ends: 660 [2023-12-02 17:44:37,063 INFO L226 Difference]: Without dead ends: 343 [2023-12-02 17:44:37,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=128, Invalid=1594, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:44:37,065 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:37,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 201 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:44:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-02 17:44:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2023-12-02 17:44:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 211 states have (on average 1.1895734597156398) internal successors, (251), 243 states have internal predecessors, (251), 57 states have call successors, (57), 48 states have call predecessors, (57), 66 states have return successors, (133), 47 states have call predecessors, (133), 55 states have call successors, (133) [2023-12-02 17:44:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 441 transitions. [2023-12-02 17:44:37,114 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 441 transitions. Word has length 36 [2023-12-02 17:44:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:37,114 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 441 transitions. [2023-12-02 17:44:37,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:44:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 441 transitions. [2023-12-02 17:44:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 17:44:37,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:37,115 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:37,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 17:44:37,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 17:44:37,317 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:44:37,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -191962055, now seen corresponding path program 3 times [2023-12-02 17:44:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:44:37,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849031345] [2023-12-02 17:44:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:44:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:42,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:44:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849031345] [2023-12-02 17:44:42,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849031345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:44:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107138272] [2023-12-02 17:44:42,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:44:42,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:42,178 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:44:42,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:44:42,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:44:42,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:44:42,930 WARN L260 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 555 conjunts are in the unsatisfiable core [2023-12-02 17:44:42,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:42,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 17:44:42,957 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:44:42,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-02 17:44:42,974 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-12-02 17:44:42,993 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-12-02 17:44:42,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 539 treesize of output 527 [2023-12-02 17:44:43,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:44:43,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-12-02 17:44:43,715 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:44:43,723 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:44:44,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:44:45,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 17:44:45,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-12-02 17:44:47,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2023-12-02 17:44:47,428 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 17:44:48,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2023-12-02 17:44:48,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2023-12-02 17:44:49,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2023-12-02 17:44:49,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2023-12-02 17:44:50,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2023-12-02 17:44:51,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2023-12-02 17:44:52,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:44:52,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 198 [2023-12-02 17:44:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 17:44:52,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:44:56,890 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base) c_func_to_recursive_line_14_to_16_0_~e.offset) 4294967296)) (.cse1 (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~b.base) c_func_to_recursive_line_14_to_16_0_~b.offset) 4294967296)) (.cse2 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse9 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base v_ArrVal_755))) (let ((.cse8 (mod (select (select .cse9 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse10 (mod (select (select .cse9 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (or (not (= .cse8 (mod (+ 4294967294 (select (select .cse9 c_func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))) (not (= .cse8 .cse10)) (not (= (mod (select (select .cse9 c_func_to_recursive_line_14_to_16_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse10))))))) (.cse0 (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~c.base) c_func_to_recursive_line_14_to_16_0_~c.offset) 4294967296)) (.cse3 (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (and (or (= .cse0 .cse1) .cse2) (or (= .cse3 .cse4) .cse2) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int)) (let ((.cse5 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base v_ArrVal_755))) (let ((.cse6 (mod (select (select .cse5 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))) (or (not (= (mod (select (select .cse5 c_func_to_recursive_line_14_to_16_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse6)) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse7 (mod (select (select .cse5 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse7 .cse6)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= (mod (+ (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse4) (not (= .cse7 (mod (+ 4294967294 (select (select .cse5 c_func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296)))))))))))) (or .cse2 (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~a.base) c_func_to_recursive_line_14_to_16_0_~a.offset) 4294967296) .cse1)) (or .cse2 (= .cse0 .cse3)))) is different from false [2023-12-02 17:44:58,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) c_func_to_recursive_line_13_to_14_0_~e.offset) 4294967296)) (.cse6 (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296)) (.cse5 (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~c.base) c_func_to_recursive_line_13_to_14_0_~c.offset) 4294967296)) (.cse7 (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~b.base) c_func_to_recursive_line_13_to_14_0_~b.offset) 4294967296)) (.cse4 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse9 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_755))) (let ((.cse8 (mod (select (select .cse9 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse10 (mod (select (select .cse9 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))) (or (not (= .cse8 (mod (+ (select (select .cse9 c_func_to_recursive_line_13_to_14_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))) (not (= .cse8 .cse10)) (not (= .cse10 (mod (select (select .cse9 c_func_to_recursive_line_13_to_14_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))))))))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int)) (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_755))) (let ((.cse1 (mod (select (select .cse2 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))) (or (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse0 (mod (select (select .cse2 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse0 .cse1)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (not (= .cse0 (mod (+ (select (select .cse2 c_func_to_recursive_line_13_to_14_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))) (= .cse3 (mod (+ 4294967294 (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))))))) (not (= .cse1 (mod (select (select .cse2 c_func_to_recursive_line_13_to_14_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))))))) (or .cse4 (= .cse5 .cse6)) (or (= .cse3 .cse6) .cse4) (or (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~a.base) c_func_to_recursive_line_13_to_14_0_~a.offset) 4294967296) .cse7) .cse4) (or (= .cse5 .cse7) .cse4))) is different from false [2023-12-02 17:44:58,266 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse9 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_755))) (let ((.cse8 (mod (select (select .cse9 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse10 (mod (select (select .cse9 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))) (or (not (= .cse8 (mod (+ (select (select .cse9 c_func_to_recursive_line_13_to_14_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))) (not (= .cse8 .cse10)) (not (= .cse10 (mod (select (select .cse9 c_func_to_recursive_line_13_to_14_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296)))))))) (.cse0 (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base))) (and (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (= (mod (select (select (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base (store .cse0 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296) 0)) .cse1) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base (store .cse0 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse2 c_func_to_recursive_line_13_to_14_0_~c.base) c_func_to_recursive_line_13_to_14_0_~c.offset) 4294967296) (mod (select (select .cse2 c_func_to_recursive_line_13_to_14_0_~b.base) c_func_to_recursive_line_13_to_14_0_~b.offset) 4294967296)))) .cse1) (or .cse1 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse3 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base (store .cse0 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse3 c_func_to_recursive_line_13_to_14_0_~c.base) c_func_to_recursive_line_13_to_14_0_~c.offset) 4294967296) (mod (select (select .cse3 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))))) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base (store .cse0 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 c_func_to_recursive_line_13_to_14_0_~a.base) c_func_to_recursive_line_13_to_14_0_~a.offset) 4294967296) (mod (select (select .cse4 c_func_to_recursive_line_13_to_14_0_~b.base) c_func_to_recursive_line_13_to_14_0_~b.offset) 4294967296)))) .cse1) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse6 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_755))) (let ((.cse7 (mod (select (select .cse6 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))) (or (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse5 (mod (select (select .cse6 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= (mod (+ (select (select (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base (store .cse0 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_13_to_14_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0) (not (= .cse5 (mod (+ (select (select .cse6 c_func_to_recursive_line_13_to_14_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))))) (not (= .cse5 .cse7))))) (not (= .cse7 (mod (select (select .cse6 c_func_to_recursive_line_13_to_14_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))))))))) is different from false [2023-12-02 17:44:58,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse10 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| v_ArrVal_755))) (let ((.cse8 (mod (select (select .cse10 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse9 (mod (select (select .cse10 |c_func_to_recursive_line_13_to_14_0_#in~d.base|) |c_func_to_recursive_line_13_to_14_0_#in~d.offset|) 4294967296))) (or (not (= .cse8 .cse9)) (not (= .cse8 (mod (+ (select (select .cse10 |c_func_to_recursive_line_13_to_14_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))) (not (= .cse9 (mod (select (select .cse10 |c_func_to_recursive_line_13_to_14_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296)))))))) (.cse2 (select |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base|))) (and (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse1 |c_func_to_recursive_line_13_to_14_0_#in~b.base|) |c_func_to_recursive_line_13_to_14_0_#in~b.offset|) 4294967296) (mod (select (select .cse1 |c_func_to_recursive_line_13_to_14_0_#in~a.base|) |c_func_to_recursive_line_13_to_14_0_#in~a.offset|) 4294967296))))) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse3 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse3 |c_func_to_recursive_line_13_to_14_0_#in~b.base|) |c_func_to_recursive_line_13_to_14_0_#in~b.offset|) 4294967296) (mod (select (select .cse3 |c_func_to_recursive_line_13_to_14_0_#in~c.base|) |c_func_to_recursive_line_13_to_14_0_#in~c.offset|) 4294967296)))) .cse0) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (= (mod (select (select (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)) |c_func_to_recursive_line_13_to_14_0_#in~d.base|) |c_func_to_recursive_line_13_to_14_0_#in~d.offset|) 4294967296) 0))) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 |c_func_to_recursive_line_13_to_14_0_#in~c.base|) |c_func_to_recursive_line_13_to_14_0_#in~c.offset|) 4294967296) (mod (select (select .cse4 |c_func_to_recursive_line_13_to_14_0_#in~d.base|) |c_func_to_recursive_line_13_to_14_0_#in~d.offset|) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse6 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| v_ArrVal_755))) (let ((.cse5 (mod (select (select .cse6 |c_func_to_recursive_line_13_to_14_0_#in~d.base|) |c_func_to_recursive_line_13_to_14_0_#in~d.offset|) 4294967296))) (or (not (= .cse5 (mod (select (select .cse6 |c_func_to_recursive_line_13_to_14_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse7 (mod (select (select .cse6 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse7 .cse5)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (not (= .cse7 (mod (+ (select (select .cse6 |c_func_to_recursive_line_13_to_14_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))) (= (mod (+ (select (select (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)) |c_func_to_recursive_line_13_to_14_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0)))))))))))) is different from false [2023-12-02 17:44:58,561 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base)) (.cse2 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse8 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base v_ArrVal_755))) (let ((.cse10 (mod (select (select .cse8 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse9 (mod (select (select .cse8 c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (or (not (= (mod (select (select .cse8 c_func_to_recursive_line_12_to_13_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse9)) (not (= .cse10 (mod (+ 4294967294 (select (select .cse8 c_func_to_recursive_line_12_to_13_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))) (not (= .cse10 .cse9)))))))) (and (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse0 c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 4294967296)))) .cse2) (or .cse2 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse3 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse3 c_func_to_recursive_line_12_to_13_0_~a.base) c_func_to_recursive_line_12_to_13_0_~a.offset) 4294967296) (mod (select (select .cse3 c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base v_ArrVal_755))) (let ((.cse5 (mod (select (select .cse4 c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (or (not (= (mod (select (select .cse4 c_func_to_recursive_line_12_to_13_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse5)) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse6 (mod (select (select .cse4 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (not (= .cse6 (mod (+ 4294967294 (select (select .cse4 c_func_to_recursive_line_12_to_13_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))) (= (mod (+ (select (select (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0))) (not (= .cse6 .cse5))))))))) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (= (mod (select (select (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 0)) .cse2) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse7 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse7 c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 4294967296) (mod (select (select .cse7 c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296)))) .cse2))) is different from false [2023-12-02 17:44:58,709 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~d.base (store (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset 0)))) (let ((.cse3 (select .cse2 c_func_to_recursive_line_12_to_13_0_~e.base)) (.cse0 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse11 (store .cse2 c_func_to_recursive_line_12_to_13_0_~e.base v_ArrVal_755))) (let ((.cse10 (mod (select (select .cse11 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse9 (mod (select (select .cse11 c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (or (not (= .cse9 .cse10)) (not (= .cse10 (mod (+ 4294967294 (select (select .cse11 c_func_to_recursive_line_12_to_13_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))) (not (= (mod (select (select .cse11 c_func_to_recursive_line_12_to_13_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse9)))))))) (and (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse1 (store .cse2 c_func_to_recursive_line_12_to_13_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse1 c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) (mod (select (select .cse1 c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 4294967296))))) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse2 c_func_to_recursive_line_12_to_13_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 4294967296) (mod (select (select .cse4 c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse7 (store .cse2 c_func_to_recursive_line_12_to_13_0_~e.base v_ArrVal_755))) (let ((.cse5 (mod (select (select .cse7 c_func_to_recursive_line_12_to_13_0_~d.base) c_func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (or (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse6 (mod (select (select .cse7 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse5 .cse6)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (not (= .cse6 (mod (+ 4294967294 (select (select .cse7 c_func_to_recursive_line_12_to_13_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))) (= (mod (+ (select (select (store .cse2 c_func_to_recursive_line_12_to_13_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0)))))) (not (= (mod (select (select .cse7 c_func_to_recursive_line_12_to_13_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse5)))))) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse8 (store .cse2 c_func_to_recursive_line_12_to_13_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse8 c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 4294967296) (mod (select (select .cse8 c_func_to_recursive_line_12_to_13_0_~a.base) c_func_to_recursive_line_12_to_13_0_~a.offset) 4294967296)))) .cse0)))) is different from false [2023-12-02 17:44:58,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_func_to_recursive_line_12_to_13_0_#in~d.base| (store (select |c_#memory_int| |c_func_to_recursive_line_12_to_13_0_#in~d.base|) |c_func_to_recursive_line_12_to_13_0_#in~d.offset| 0)))) (let ((.cse3 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse9 (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| v_ArrVal_755))) (let ((.cse10 (mod (select (select .cse9 |c_func_to_recursive_line_12_to_13_0_#in~d.base|) |c_func_to_recursive_line_12_to_13_0_#in~d.offset|) 4294967296)) (.cse11 (mod (select (select .cse9 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= (mod (select (select .cse9 |c_func_to_recursive_line_12_to_13_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse10)) (not (= .cse11 .cse10)) (not (= .cse11 (mod (+ 4294967294 (select (select .cse9 |c_func_to_recursive_line_12_to_13_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296)))))))) (.cse2 (select .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base|))) (and (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse0 |c_func_to_recursive_line_12_to_13_0_#in~b.base|) |c_func_to_recursive_line_12_to_13_0_#in~b.offset|) 4294967296) (mod (select (select .cse0 |c_func_to_recursive_line_12_to_13_0_#in~c.base|) |c_func_to_recursive_line_12_to_13_0_#in~c.offset|) 4294967296)))) .cse3) (or .cse3 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 |c_func_to_recursive_line_12_to_13_0_#in~d.base|) |c_func_to_recursive_line_12_to_13_0_#in~d.offset|) 4294967296) (mod (select (select .cse4 |c_func_to_recursive_line_12_to_13_0_#in~c.base|) |c_func_to_recursive_line_12_to_13_0_#in~c.offset|) 4294967296))))) (or .cse3 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse5 (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse5 |c_func_to_recursive_line_12_to_13_0_#in~b.base|) |c_func_to_recursive_line_12_to_13_0_#in~b.offset|) 4294967296) (mod (select (select .cse5 |c_func_to_recursive_line_12_to_13_0_#in~a.base|) |c_func_to_recursive_line_12_to_13_0_#in~a.offset|) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse6 (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| v_ArrVal_755))) (let ((.cse7 (mod (select (select .cse6 |c_func_to_recursive_line_12_to_13_0_#in~d.base|) |c_func_to_recursive_line_12_to_13_0_#in~d.offset|) 4294967296))) (or (not (= (mod (select (select .cse6 |c_func_to_recursive_line_12_to_13_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse7)) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse8 (mod (select (select .cse6 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse8 .cse7)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= 0 (mod (+ 4294967294 (select (select (store .cse1 |c_func_to_recursive_line_12_to_13_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)) |c_func_to_recursive_line_12_to_13_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296)) (not (= .cse8 (mod (+ 4294967294 (select (select .cse6 |c_func_to_recursive_line_12_to_13_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))))))))))))))) is different from false [2023-12-02 17:44:58,966 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~d.base (store (select |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset 0)))) (let ((.cse0 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse10 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base v_ArrVal_755))) (let ((.cse9 (mod (select (select .cse10 c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset) 4294967296)) (.cse11 (mod (select (select .cse10 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse9 (mod (select (select .cse10 c_func_to_recursive_line_11_to_12_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (not (= (mod (+ (select (select .cse10 c_func_to_recursive_line_11_to_12_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse11)) (not (= .cse9 .cse11))))))) (.cse3 (select .cse2 c_func_to_recursive_line_11_to_12_0_~e.base))) (and (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse1 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse1 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) (mod (select (select .cse1 c_func_to_recursive_line_11_to_12_0_~a.base) c_func_to_recursive_line_11_to_12_0_~a.offset) 4294967296))))) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) (mod (select (select .cse4 c_func_to_recursive_line_11_to_12_0_~c.base) c_func_to_recursive_line_11_to_12_0_~c.offset) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse6 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base v_ArrVal_755))) (let ((.cse5 (mod (select (select .cse6 c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset) 4294967296))) (or (not (= .cse5 (mod (select (select .cse6 c_func_to_recursive_line_11_to_12_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse7 (mod (select (select .cse6 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse5 .cse7)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (not (= (mod (+ (select (select .cse6 c_func_to_recursive_line_11_to_12_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse7)) (= (mod (+ (select (select (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_11_to_12_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0)))))))))) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse8 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse8 c_func_to_recursive_line_11_to_12_0_~c.base) c_func_to_recursive_line_11_to_12_0_~c.offset) 4294967296) (mod (select (select .cse8 c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset) 4294967296)))))))) is different from false [2023-12-02 17:45:01,123 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse11 (store |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~c.base (store (select |c_#memory_int| c_func_to_recursive_line_11_to_12_0_~c.base) c_func_to_recursive_line_11_to_12_0_~c.offset 0)))) (store .cse11 c_func_to_recursive_line_11_to_12_0_~d.base (store (select .cse11 c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset 0))))) (let ((.cse0 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse10 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base v_ArrVal_755))) (let ((.cse8 (mod (select (select .cse10 c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset) 4294967296)) (.cse9 (mod (select (select .cse10 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse8 .cse9)) (not (= .cse8 (mod (select (select .cse10 c_func_to_recursive_line_11_to_12_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (not (= (mod (+ 4294967294 (select (select .cse10 c_func_to_recursive_line_11_to_12_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse9))))))) (.cse3 (select .cse2 c_func_to_recursive_line_11_to_12_0_~e.base))) (and (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse1 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse1 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) (mod (select (select .cse1 c_func_to_recursive_line_11_to_12_0_~a.base) c_func_to_recursive_line_11_to_12_0_~a.offset) 4294967296))))) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 c_func_to_recursive_line_11_to_12_0_~b.base) c_func_to_recursive_line_11_to_12_0_~b.offset) 4294967296) (mod (select (select .cse4 c_func_to_recursive_line_11_to_12_0_~c.base) c_func_to_recursive_line_11_to_12_0_~c.offset) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse6 (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base v_ArrVal_755))) (let ((.cse5 (mod (select (select .cse6 c_func_to_recursive_line_11_to_12_0_~d.base) c_func_to_recursive_line_11_to_12_0_~d.offset) 4294967296))) (or (not (= .cse5 (mod (select (select .cse6 c_func_to_recursive_line_11_to_12_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse7 (mod (select (select .cse6 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse5 .cse7)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (not (= (mod (+ 4294967294 (select (select .cse6 c_func_to_recursive_line_11_to_12_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse7)) (= (mod (+ (select (select (store .cse2 c_func_to_recursive_line_11_to_12_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_11_to_12_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 0))))))))))))) is different from false [2023-12-02 17:45:01,252 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse11 (store |c_#memory_int| |c_func_to_recursive_line_11_to_12_0_#in~c.base| (store (select |c_#memory_int| |c_func_to_recursive_line_11_to_12_0_#in~c.base|) |c_func_to_recursive_line_11_to_12_0_#in~c.offset| 0)))) (store .cse11 |c_func_to_recursive_line_11_to_12_0_#in~d.base| (store (select .cse11 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) |c_func_to_recursive_line_11_to_12_0_#in~d.offset| 0))))) (let ((.cse3 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse8 (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| v_ArrVal_755))) (let ((.cse10 (mod (select (select .cse8 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse9 (mod (select (select .cse8 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) |c_func_to_recursive_line_11_to_12_0_#in~d.offset|) 4294967296))) (or (not (= (mod (select (select .cse8 |c_func_to_recursive_line_11_to_12_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse9)) (not (= (mod (+ 4294967294 (select (select .cse8 |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse10)) (not (= .cse10 .cse9))))))) (.cse2 (select .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base|))) (and (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse0 (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~c.base|) |c_func_to_recursive_line_11_to_12_0_#in~c.offset|) 4294967296) (mod (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~b.base|) |c_func_to_recursive_line_11_to_12_0_#in~b.offset|) 4294967296)))) .cse3) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse4 |c_func_to_recursive_line_11_to_12_0_#in~b.base|) |c_func_to_recursive_line_11_to_12_0_#in~b.offset|) 4294967296) (mod (select (select .cse4 |c_func_to_recursive_line_11_to_12_0_#in~a.base|) |c_func_to_recursive_line_11_to_12_0_#in~a.offset|) 4294967296)))) .cse3) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse5 (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| v_ArrVal_755))) (let ((.cse6 (mod (select (select .cse5 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) |c_func_to_recursive_line_11_to_12_0_#in~d.offset|) 4294967296))) (or (not (= (mod (select (select .cse5 |c_func_to_recursive_line_11_to_12_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse6)) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse7 (mod (select (select .cse5 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse7 .cse6)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= (mod (+ 4294967294 (select (select (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| (store .cse2 func_to_recursive_line_13_to_14_0_~e.offset 0)) |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0) (not (= (mod (+ 4294967294 (select (select .cse5 |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse7)))))))))))))) is different from false [2023-12-02 17:45:01,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse11 (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~c.base (store (select |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~c.base) c_func_to_recursive_line_10_to_11_0_~c.offset 0)))) (store .cse11 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse11 c_func_to_recursive_line_10_to_11_0_~d.base) c_func_to_recursive_line_10_to_11_0_~d.offset 0))))) (let ((.cse0 (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse8 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base v_ArrVal_755))) (let ((.cse10 (mod (select (select .cse8 c_func_to_recursive_line_10_to_11_0_~d.base) c_func_to_recursive_line_10_to_11_0_~d.offset) 4294967296)) (.cse9 (mod (select (select .cse8 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= (mod (+ 4294967294 (select (select .cse8 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse9)) (not (= (mod (select (select .cse8 c_func_to_recursive_line_10_to_11_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse10)) (not (= .cse10 .cse9))))))) (.cse3 (select .cse2 c_func_to_recursive_line_10_to_11_0_~e.base))) (and (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse1 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse1 c_func_to_recursive_line_10_to_11_0_~a.base) c_func_to_recursive_line_10_to_11_0_~a.offset) 4294967296) (mod (select (select .cse1 c_func_to_recursive_line_10_to_11_0_~b.base) c_func_to_recursive_line_10_to_11_0_~b.offset) 4294967296))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base v_ArrVal_755))) (let ((.cse6 (mod (select (select .cse4 c_func_to_recursive_line_10_to_11_0_~d.base) c_func_to_recursive_line_10_to_11_0_~d.offset) 4294967296))) (or (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse5 (mod (select (select .cse4 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= (mod (+ 4294967294 (select (select (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_10_to_11_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0) (not (= (mod (+ 4294967294 (select (select .cse4 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) .cse5)))) (not (= .cse6 .cse5))))) (not (= (mod (select (select .cse4 c_func_to_recursive_line_10_to_11_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse6)))))) (or .cse0 (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse7 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse7 c_func_to_recursive_line_10_to_11_0_~c.base) c_func_to_recursive_line_10_to_11_0_~c.offset) 4294967296) (mod (select (select .cse7 c_func_to_recursive_line_10_to_11_0_~b.base) c_func_to_recursive_line_10_to_11_0_~b.offset) 4294967296)))))))) is different from false [2023-12-02 17:45:01,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~b.base (store (select |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~b.base) c_func_to_recursive_line_10_to_11_0_~b.offset 0)))) (store .cse10 c_func_to_recursive_line_10_to_11_0_~c.base (store (select .cse10 c_func_to_recursive_line_10_to_11_0_~c.base) c_func_to_recursive_line_10_to_11_0_~c.offset 0))))) (store .cse9 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse9 c_func_to_recursive_line_10_to_11_0_~d.base) c_func_to_recursive_line_10_to_11_0_~d.offset 0))))) (let ((.cse3 (select .cse2 c_func_to_recursive_line_10_to_11_0_~e.base))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse4 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base v_ArrVal_755))) (let ((.cse1 (mod (select (select .cse4 c_func_to_recursive_line_10_to_11_0_~d.base) c_func_to_recursive_line_10_to_11_0_~d.offset) 4294967296))) (or (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse0 (mod (select (select .cse4 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse0 .cse1)) (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= 0 (mod (+ (select (select (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_10_to_11_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296)) (not (= .cse0 (mod (+ 4294967294 (select (select .cse4 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296)))))))) (not (= (mod (select (select .cse4 c_func_to_recursive_line_10_to_11_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse1)))))) (or (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse5 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base v_ArrVal_755))) (let ((.cse6 (mod (select (select .cse5 c_func_to_recursive_line_10_to_11_0_~d.base) c_func_to_recursive_line_10_to_11_0_~d.offset) 4294967296)) (.cse7 (mod (select (select .cse5 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= (mod (select (select .cse5 c_func_to_recursive_line_10_to_11_0_~c.base) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296) .cse6)) (not (= .cse7 .cse6)) (not (= .cse7 (mod (+ 4294967294 (select (select .cse5 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296))))))) (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse8 (store .cse2 c_func_to_recursive_line_10_to_11_0_~e.base (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse8 c_func_to_recursive_line_10_to_11_0_~b.base) c_func_to_recursive_line_10_to_11_0_~b.offset) 4294967296) (mod (select (select .cse8 c_func_to_recursive_line_10_to_11_0_~a.base) c_func_to_recursive_line_10_to_11_0_~a.offset) 4294967296)))))))) is different from false [2023-12-02 17:45:03,950 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_func_to_recursive_line_10_to_11_0_#in~b.base| (store (select |c_#memory_int| |c_func_to_recursive_line_10_to_11_0_#in~b.base|) |c_func_to_recursive_line_10_to_11_0_#in~b.offset| 0)))) (store .cse10 |c_func_to_recursive_line_10_to_11_0_#in~c.base| (store (select .cse10 |c_func_to_recursive_line_10_to_11_0_#in~c.base|) |c_func_to_recursive_line_10_to_11_0_#in~c.offset| 0))))) (store .cse9 |c_func_to_recursive_line_10_to_11_0_#in~d.base| (store (select .cse9 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) |c_func_to_recursive_line_10_to_11_0_#in~d.offset| 0))))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~e.base|))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse3 (store .cse0 |c_func_to_recursive_line_10_to_11_0_#in~e.base| v_ArrVal_755))) (let ((.cse4 (mod (select (select .cse3 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) |c_func_to_recursive_line_10_to_11_0_#in~d.offset|) 4294967296))) (or (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse2 (mod (select (select .cse3 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= (mod (+ 4294967294 (select (select (store .cse0 |c_func_to_recursive_line_10_to_11_0_#in~e.base| (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)) |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0) (not (= .cse2 (mod (+ (select (select .cse3 |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))))) (not (= .cse4 .cse2))))) (not (= .cse4 (mod (select (select .cse3 |c_func_to_recursive_line_10_to_11_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))))))) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse5 (store .cse0 |c_func_to_recursive_line_10_to_11_0_#in~e.base| (store .cse1 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse5 |c_func_to_recursive_line_10_to_11_0_#in~b.base|) |c_func_to_recursive_line_10_to_11_0_#in~b.offset|) 4294967296) (mod (select (select .cse5 |c_func_to_recursive_line_10_to_11_0_#in~a.base|) |c_func_to_recursive_line_10_to_11_0_#in~a.offset|) 4294967296)))) (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse8 (store .cse0 |c_func_to_recursive_line_10_to_11_0_#in~e.base| v_ArrVal_755))) (let ((.cse7 (mod (select (select .cse8 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296)) (.cse6 (mod (select (select .cse8 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) |c_func_to_recursive_line_10_to_11_0_#in~d.offset|) 4294967296))) (or (not (= .cse6 .cse7)) (not (= .cse7 (mod (+ (select (select .cse8 |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296))) (not (= .cse6 (mod (select (select .cse8 |c_func_to_recursive_line_10_to_11_0_#in~c.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))))))))))) is different from false [2023-12-02 17:45:04,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) |c_ULTIMATE.start_main_~#b~0#1.offset| 0)))) (store .cse10 |c_ULTIMATE.start_main_~#c~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#c~0#1.base|) |c_ULTIMATE.start_main_~#c~0#1.offset| 0))))) (store .cse9 |c_ULTIMATE.start_main_~#d~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#d~0#1.base|) |c_ULTIMATE.start_main_~#d~0#1.offset| 0))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#e~0#1.base|))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#e~0#1.base| v_ArrVal_755))) (let ((.cse0 (mod (select (select .cse1 |c_ULTIMATE.start_main_~#d~0#1.base|) |c_ULTIMATE.start_main_~#d~0#1.offset|) 4294967296))) (or (not (= .cse0 (mod (select (select .cse1 |c_ULTIMATE.start_main_~#c~0#1.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (forall ((v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse4 (mod (select (select .cse1 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int)) (or (= (mod (+ 4294967294 (select (select (store .cse2 |c_ULTIMATE.start_main_~#e~0#1.base| (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)) |c_ULTIMATE.start_main_~#uint32_max~0#1.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset)) 4294967296) 0) (not (= (mod (+ (select (select .cse1 |c_ULTIMATE.start_main_~#uint32_max~0#1.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse4)))) (not (= .cse0 .cse4))))))))) (or (forall ((func_to_recursive_line_13_to_14_0_~e.offset Int)) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#e~0#1.base| (store .cse3 func_to_recursive_line_13_to_14_0_~e.offset 0)))) (= (mod (select (select .cse5 |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 4294967296) (mod (select (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) |c_ULTIMATE.start_main_~#b~0#1.offset|) 4294967296)))) (forall ((v_ArrVal_755 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_func_to_recursive_line_14_to_16_0_~c.offset_58 Int) (v_func_to_recursive_line_14_to_16_0_~e.base_46 Int) (v_func_to_recursive_line_14_to_16_0_~e.offset_46 Int)) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#e~0#1.base| v_ArrVal_755))) (let ((.cse6 (mod (select (select .cse7 |c_ULTIMATE.start_main_~#d~0#1.base|) |c_ULTIMATE.start_main_~#d~0#1.offset|) 4294967296)) (.cse8 (mod (select (select .cse7 v_func_to_recursive_line_14_to_16_0_~e.base_46) v_func_to_recursive_line_14_to_16_0_~e.offset_46) 4294967296))) (or (not (= .cse6 (mod (select (select .cse7 |c_ULTIMATE.start_main_~#c~0#1.base|) v_func_to_recursive_line_14_to_16_0_~c.offset_58) 4294967296))) (not (= .cse6 .cse8)) (not (= (mod (+ (select (select .cse7 |c_ULTIMATE.start_main_~#uint32_max~0#1.base|) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse8)))))))))) is different from false [2023-12-02 17:45:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 81 trivial. 7 not checked. [2023-12-02 17:45:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107138272] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:45:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2074719068] [2023-12-02 17:45:04,150 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 17:45:04,150 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:45:04,151 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 17:45:04,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:45:04,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28, 23] total 84 [2023-12-02 17:45:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895526366] [2023-12-02 17:45:04,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:45:04,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-12-02 17:45:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:45:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-12-02 17:45:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=4686, Unknown=73, NotChecked=2114, Total=7140 [2023-12-02 17:45:04,155 INFO L87 Difference]: Start difference. First operand 335 states and 441 transitions. Second operand has 85 states, 70 states have (on average 1.3) internal successors, (91), 56 states have internal predecessors, (91), 28 states have call successors, (28), 28 states have call predecessors, (28), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:29,985 INFO L93 Difference]: Finished difference Result 427 states and 555 transitions. [2023-12-02 17:45:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 17:45:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 70 states have (on average 1.3) internal successors, (91), 56 states have internal predecessors, (91), 28 states have call successors, (28), 28 states have call predecessors, (28), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 17:45:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:29,989 INFO L225 Difference]: With dead ends: 427 [2023-12-02 17:45:29,989 INFO L226 Difference]: Without dead ends: 423 [2023-12-02 17:45:29,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 165 ConstructedPredicates, 14 IntricatePredicates, 2 DeprecatedPredicates, 6445 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=1354, Invalid=21865, Unknown=93, NotChecked=4410, Total=27722 [2023-12-02 17:45:29,992 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 318 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 3935 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 7067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3935 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 3042 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:29,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1570 Invalid, 7067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3935 Invalid, 2 Unknown, 3042 Unchecked, 5.1s Time] [2023-12-02 17:45:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-02 17:45:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 411. [2023-12-02 17:45:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 262 states have (on average 1.183206106870229) internal successors, (310), 301 states have internal predecessors, (310), 65 states have call successors, (65), 57 states have call predecessors, (65), 83 states have return successors, (157), 56 states have call predecessors, (157), 63 states have call successors, (157) [2023-12-02 17:45:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 532 transitions. [2023-12-02 17:45:30,057 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 532 transitions. Word has length 53 [2023-12-02 17:45:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:30,057 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 532 transitions. [2023-12-02 17:45:30,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 70 states have (on average 1.3) internal successors, (91), 56 states have internal predecessors, (91), 28 states have call successors, (28), 28 states have call predecessors, (28), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 532 transitions. [2023-12-02 17:45:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 17:45:30,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:30,059 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:30,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 17:45:30,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:30,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:45:30,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1749425439, now seen corresponding path program 1 times [2023-12-02 17:45:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:45:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9960096] [2023-12-02 17:45:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:45:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:45:35,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:45:35,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9960096] [2023-12-02 17:45:35,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9960096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:45:35,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762162226] [2023-12-02 17:45:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:35,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:35,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:45:35,444 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:45:35,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 17:45:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:35,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 213 conjunts are in the unsatisfiable core [2023-12-02 17:45:35,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:35,815 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 17:45:35,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 58 [2023-12-02 17:45:35,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 17:45:35,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:45:36,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:45:36,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:45:36,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:45:38,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:45:38,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:45:38,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:45:38,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-12-02 17:45:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:45:38,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762162226] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:45:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1030088617] [2023-12-02 17:45:39,311 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 17:45:39,311 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:45:39,311 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 17:45:39,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:45:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 26] total 61 [2023-12-02 17:45:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339557975] [2023-12-02 17:45:39,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:45:39,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-02 17:45:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:45:39,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-02 17:45:39,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3676, Unknown=3, NotChecked=0, Total=3906 [2023-12-02 17:45:39,314 INFO L87 Difference]: Start difference. First operand 411 states and 532 transitions. Second operand has 62 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 49 states have internal predecessors, (71), 19 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 17:45:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:44,653 INFO L93 Difference]: Finished difference Result 737 states and 970 transitions. [2023-12-02 17:45:44,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 17:45:44,654 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 49 states have internal predecessors, (71), 19 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 52 [2023-12-02 17:45:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:44,657 INFO L225 Difference]: With dead ends: 737 [2023-12-02 17:45:44,657 INFO L226 Difference]: Without dead ends: 424 [2023-12-02 17:45:44,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=607, Invalid=8510, Unknown=3, NotChecked=0, Total=9120 [2023-12-02 17:45:44,659 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:44,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 580 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1434 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 17:45:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-12-02 17:45:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 415. [2023-12-02 17:45:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 264 states have (on average 1.178030303030303) internal successors, (311), 302 states have internal predecessors, (311), 67 states have call successors, (67), 57 states have call predecessors, (67), 83 states have return successors, (168), 59 states have call predecessors, (168), 65 states have call successors, (168) [2023-12-02 17:45:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 546 transitions. [2023-12-02 17:45:44,753 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 546 transitions. Word has length 52 [2023-12-02 17:45:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:44,753 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 546 transitions. [2023-12-02 17:45:44,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 49 states have internal predecessors, (71), 19 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 17:45:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 546 transitions. [2023-12-02 17:45:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 17:45:44,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:44,754 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:44,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 17:45:44,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 17:45:44,954 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:45:44,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1514934126, now seen corresponding path program 2 times [2023-12-02 17:45:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:45:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022513893] [2023-12-02 17:45:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:44,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:45:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 17:45:47,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:45:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022513893] [2023-12-02 17:45:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022513893] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:45:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230948224] [2023-12-02 17:45:47,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:45:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:45:47,473 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:45:47,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 17:45:48,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:45:48,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:45:48,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 208 conjunts are in the unsatisfiable core [2023-12-02 17:45:48,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:48,210 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:45:48,211 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 239 treesize of output 233 [2023-12-02 17:45:48,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 17:45:48,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:45:48,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 17:45:49,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 17:45:49,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-02 17:45:49,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:45:49,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:45:49,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:45:49,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 160 [2023-12-02 17:45:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 17:45:49,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:53,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (func_to_recursive_line_14_to_16_0_~d.base Int) (func_to_recursive_line_14_to_16_0_~d.offset Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int) (func_to_recursive_line_13_to_14_0_~e.offset Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base v_ArrVal_940) c_func_to_recursive_line_13_to_14_0_~e.base (store (select (store (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_953) c_func_to_recursive_line_13_to_14_0_~d.base v_ArrVal_940) c_func_to_recursive_line_13_to_14_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 1)))) (or (not (= (mod (+ (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 1)) (not (= (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~d.base) func_to_recursive_line_14_to_16_0_~d.offset) 4294967296) 1)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~c.base) c_func_to_recursive_line_13_to_14_0_~c.offset) 4294967296) 1))))) is different from false [2023-12-02 17:45:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230948224] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:45:53,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [609098025] [2023-12-02 17:45:53,970 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:45:53,970 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:45:53,971 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 17:45:53,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:45:53,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2023-12-02 17:45:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499560259] [2023-12-02 17:45:53,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:45:53,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 17:45:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:45:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 17:45:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3182, Unknown=31, NotChecked=114, Total=3540 [2023-12-02 17:45:53,973 INFO L87 Difference]: Start difference. First operand 415 states and 546 transitions. Second operand has 51 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 36 states have internal predecessors, (59), 20 states have call successors, (20), 15 states have call predecessors, (20), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:45:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:56,588 INFO L93 Difference]: Finished difference Result 486 states and 634 transitions. [2023-12-02 17:45:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 17:45:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 36 states have internal predecessors, (59), 20 states have call successors, (20), 15 states have call predecessors, (20), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-12-02 17:45:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:56,593 INFO L225 Difference]: With dead ends: 486 [2023-12-02 17:45:56,593 INFO L226 Difference]: Without dead ends: 484 [2023-12-02 17:45:56,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=544, Invalid=6568, Unknown=32, NotChecked=166, Total=7310 [2023-12-02 17:45:56,595 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 138 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:56,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 813 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:45:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-12-02 17:45:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 464. [2023-12-02 17:45:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 294 states have (on average 1.1734693877551021) internal successors, (345), 337 states have internal predecessors, (345), 75 states have call successors, (75), 61 states have call predecessors, (75), 94 states have return successors, (191), 70 states have call predecessors, (191), 73 states have call successors, (191) [2023-12-02 17:45:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 611 transitions. [2023-12-02 17:45:56,680 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 611 transitions. Word has length 53 [2023-12-02 17:45:56,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:56,680 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 611 transitions. [2023-12-02 17:45:56,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 36 states have internal predecessors, (59), 20 states have call successors, (20), 15 states have call predecessors, (20), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:45:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 611 transitions. [2023-12-02 17:45:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 17:45:56,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:56,682 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:56,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 17:45:56,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 17:45:56,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:45:56,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1810649818, now seen corresponding path program 3 times [2023-12-02 17:45:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:45:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165472314] [2023-12-02 17:45:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:45:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 17:45:59,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:45:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165472314] [2023-12-02 17:45:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165472314] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:45:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221511325] [2023-12-02 17:45:59,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:45:59,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:59,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:45:59,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:45:59,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:46:00,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:46:00,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:46:00,209 WARN L260 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 548 conjunts are in the unsatisfiable core [2023-12-02 17:46:00,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:00,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-02 17:46:00,239 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-12-02 17:46:00,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 17:46:00,257 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:46:00,270 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-12-02 17:46:00,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 76 [2023-12-02 17:46:00,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:46:00,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-12-02 17:46:00,939 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:46:00,948 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:46:01,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 17:46:02,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 17:46:02,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-12-02 17:46:05,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 66 [2023-12-02 17:46:05,888 INFO L349 Elim1Store]: treesize reduction 44, result has 18.5 percent of original size [2023-12-02 17:46:05,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 65 [2023-12-02 17:46:06,627 INFO L349 Elim1Store]: treesize reduction 60, result has 36.2 percent of original size [2023-12-02 17:46:06,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 68 [2023-12-02 17:46:07,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2023-12-02 17:46:08,066 INFO L349 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2023-12-02 17:46:08,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 56 [2023-12-02 17:46:08,914 INFO L349 Elim1Store]: treesize reduction 16, result has 82.8 percent of original size [2023-12-02 17:46:08,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 168 treesize of output 212 [2023-12-02 17:46:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 17:46:08,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221511325] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:46:16,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [49352971] [2023-12-02 17:46:16,607 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:46:16,608 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:46:16,608 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 17:46:16,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:46:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 40] total 65 [2023-12-02 17:46:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701484518] [2023-12-02 17:46:16,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:46:16,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-02 17:46:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:46:16,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-02 17:46:16,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5584, Unknown=2, NotChecked=0, Total=5852 [2023-12-02 17:46:16,611 INFO L87 Difference]: Start difference. First operand 464 states and 611 transitions. Second operand has 66 states, 50 states have (on average 1.38) internal successors, (69), 48 states have internal predecessors, (69), 22 states have call successors, (22), 17 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 17:46:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:46:36,834 INFO L93 Difference]: Finished difference Result 614 states and 877 transitions. [2023-12-02 17:46:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-02 17:46:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 50 states have (on average 1.38) internal successors, (69), 48 states have internal predecessors, (69), 22 states have call successors, (22), 17 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 58 [2023-12-02 17:46:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:46:36,839 INFO L225 Difference]: With dead ends: 614 [2023-12-02 17:46:36,839 INFO L226 Difference]: Without dead ends: 606 [2023-12-02 17:46:36,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5164 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=1116, Invalid=20343, Unknown=3, NotChecked=0, Total=21462 [2023-12-02 17:46:36,841 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 183 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 121 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:46:36,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1206 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3850 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2023-12-02 17:46:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-12-02 17:46:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 549. [2023-12-02 17:46:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 351 states have (on average 1.170940170940171) internal successors, (411), 400 states have internal predecessors, (411), 87 states have call successors, (87), 74 states have call predecessors, (87), 110 states have return successors, (254), 82 states have call predecessors, (254), 85 states have call successors, (254) [2023-12-02 17:46:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 752 transitions. [2023-12-02 17:46:36,944 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 752 transitions. Word has length 58 [2023-12-02 17:46:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:46:36,945 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 752 transitions. [2023-12-02 17:46:36,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 50 states have (on average 1.38) internal successors, (69), 48 states have internal predecessors, (69), 22 states have call successors, (22), 17 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 17:46:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 752 transitions. [2023-12-02 17:46:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 17:46:36,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:46:36,946 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:46:36,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-02 17:46:37,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 17:46:37,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:46:37,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:46:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1799967470, now seen corresponding path program 4 times [2023-12-02 17:46:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:46:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532217800] [2023-12-02 17:46:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:46:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:46:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:46:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 17:46:40,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:46:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532217800] [2023-12-02 17:46:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532217800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:46:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046653671] [2023-12-02 17:46:40,517 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:46:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:46:40,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:46:40,518 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:46:40,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 17:46:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:46:41,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 307 conjunts are in the unsatisfiable core [2023-12-02 17:46:41,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:41,039 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 119 treesize of output 117 [2023-12-02 17:46:41,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:46:41,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:46:41,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:46:41,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 17:46:42,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 17:46:42,611 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:46:42,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2023-12-02 17:46:42,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 17:46:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 17:46:43,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 17:46:43,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 17:46:43,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 17:46:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 17:46:43,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:45,739 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1147 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (< (mod (+ 4294967295 (select (select (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base v_ArrVal_1147))) (store .cse0 c_func_to_recursive_line_13_to_14_0_~e.base (store (select .cse0 c_func_to_recursive_line_13_to_14_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 3))) c_func_to_recursive_line_13_to_14_0_~uint32_max.base) c_func_to_recursive_line_13_to_14_0_~uint32_max.offset)) 4294967296) 4)) is different from false [2023-12-02 17:46:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046653671] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:46:46,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [878760430] [2023-12-02 17:46:46,587 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:46:46,587 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:46:46,587 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 17:46:46,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:46:46,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 65 [2023-12-02 17:46:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695176069] [2023-12-02 17:46:46,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:46:46,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-02 17:46:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:46:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-02 17:46:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=5945, Unknown=1, NotChecked=154, Total=6320 [2023-12-02 17:46:46,590 INFO L87 Difference]: Start difference. First operand 549 states and 752 transitions. Second operand has 66 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 46 states have internal predecessors, (77), 23 states have call successors, (23), 19 states have call predecessors, (23), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 17:47:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:04,691 INFO L93 Difference]: Finished difference Result 1259 states and 1815 transitions. [2023-12-02 17:47:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-12-02 17:47:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 46 states have internal predecessors, (77), 23 states have call successors, (23), 19 states have call predecessors, (23), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2023-12-02 17:47:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:04,696 INFO L225 Difference]: With dead ends: 1259 [2023-12-02 17:47:04,696 INFO L226 Difference]: Without dead ends: 825 [2023-12-02 17:47:04,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9013 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2062, Invalid=37741, Unknown=1, NotChecked=396, Total=40200 [2023-12-02 17:47:04,700 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 349 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 5232 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 5519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 5232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:04,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2435 Invalid, 5519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 5232 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 17:47:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2023-12-02 17:47:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 736. [2023-12-02 17:47:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 467 states have (on average 1.1734475374732334) internal successors, (548), 532 states have internal predecessors, (548), 112 states have call successors, (112), 93 states have call predecessors, (112), 156 states have return successors, (361), 123 states have call predecessors, (361), 110 states have call successors, (361) [2023-12-02 17:47:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1021 transitions. [2023-12-02 17:47:04,884 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1021 transitions. Word has length 63 [2023-12-02 17:47:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:04,884 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1021 transitions. [2023-12-02 17:47:04,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 46 states have internal predecessors, (77), 23 states have call successors, (23), 19 states have call predecessors, (23), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 17:47:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1021 transitions. [2023-12-02 17:47:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 17:47:04,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:04,886 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 8, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:04,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-02 17:47:05,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 17:47:05,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:47:05,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash 211813833, now seen corresponding path program 5 times [2023-12-02 17:47:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115359071] [2023-12-02 17:47:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:47:09,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:09,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115359071] [2023-12-02 17:47:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115359071] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:09,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467774584] [2023-12-02 17:47:09,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:47:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:47:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:47:09,829 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:47:09,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 17:47:16,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-02 17:47:16,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:47:16,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 483 conjunts are in the unsatisfiable core [2023-12-02 17:47:17,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:47:17,020 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-12-02 17:47:17,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 65 [2023-12-02 17:47:17,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 17:47:18,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:47:18,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:47:18,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 17:47:18,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 17:47:19,317 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-12-02 17:47:19,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 25 [2023-12-02 17:47:19,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:47:20,224 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 17:47:20,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:47:20,933 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 17:47:20,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 17:47:21,438 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 17:47:21,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 187 treesize of output 235 [2023-12-02 17:47:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 17:47:21,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:28,249 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~uint32_max.offset Int) (v_ArrVal_1276 (Array Int Int)) (func_to_recursive_line_14_to_16_0_~b.offset Int) (|func_to_recursive_line_14_to_16_0_#in~c.offset| Int) (func_to_recursive_line_14_to_16_0_~uint32_max.base Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_1276))) (let ((.cse1 (let ((.cse3 (select .cse2 c_func_to_recursive_line_13_to_14_0_~d.base))) (store .cse3 c_func_to_recursive_line_13_to_14_0_~d.offset (+ (select .cse3 c_func_to_recursive_line_13_to_14_0_~d.offset) 1))))) (store (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base .cse1) c_func_to_recursive_line_13_to_14_0_~e.base (store (select (store .cse2 c_func_to_recursive_line_13_to_14_0_~d.base .cse1) c_func_to_recursive_line_13_to_14_0_~e.base) c_func_to_recursive_line_13_to_14_0_~e.offset 4)))))) (or (not (= (mod (+ (select (select .cse0 func_to_recursive_line_14_to_16_0_~uint32_max.base) func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) 4)) (not (= 4 (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~b.base) func_to_recursive_line_14_to_16_0_~b.offset) 4294967296))) (not (= (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296) 4)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~c.base) |func_to_recursive_line_14_to_16_0_#in~c.offset|) 4294967296) 4)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~a.base) c_func_to_recursive_line_13_to_14_0_~a.offset) 4294967296) 4))))) is different from false [2023-12-02 17:47:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467774584] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:28,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1938195890] [2023-12-02 17:47:28,255 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:47:28,255 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:47:28,255 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 17:47:28,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:47:28,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32] total 65 [2023-12-02 17:47:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616612601] [2023-12-02 17:47:28,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:47:28,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-02 17:47:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-02 17:47:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=6394, Unknown=1, NotChecked=162, Total=6972 [2023-12-02 17:47:28,258 INFO L87 Difference]: Start difference. First operand 736 states and 1021 transitions. Second operand has 66 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 45 states have internal predecessors, (84), 27 states have call successors, (27), 21 states have call predecessors, (27), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-02 17:47:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:36,306 INFO L93 Difference]: Finished difference Result 826 states and 1126 transitions. [2023-12-02 17:47:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 17:47:36,307 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 45 states have internal predecessors, (84), 27 states have call successors, (27), 21 states have call predecessors, (27), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) Word has length 75 [2023-12-02 17:47:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:36,313 INFO L225 Difference]: With dead ends: 826 [2023-12-02 17:47:36,314 INFO L226 Difference]: Without dead ends: 824 [2023-12-02 17:47:36,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3760 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1212, Invalid=13797, Unknown=1, NotChecked=242, Total=15252 [2023-12-02 17:47:36,316 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 184 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 3503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:36,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1204 Invalid, 3503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 17:47:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2023-12-02 17:47:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 760. [2023-12-02 17:47:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 481 states have (on average 1.1704781704781704) internal successors, (563), 548 states have internal predecessors, (563), 114 states have call successors, (114), 94 states have call predecessors, (114), 164 states have return successors, (368), 130 states have call predecessors, (368), 112 states have call successors, (368) [2023-12-02 17:47:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1045 transitions. [2023-12-02 17:47:36,544 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1045 transitions. Word has length 75 [2023-12-02 17:47:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:36,544 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1045 transitions. [2023-12-02 17:47:36,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 45 states have internal predecessors, (84), 27 states have call successors, (27), 21 states have call predecessors, (27), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-02 17:47:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1045 transitions. [2023-12-02 17:47:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 17:47:36,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:36,546 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 9, 9, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:36,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 17:47:36,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 17:47:36,747 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:47:36,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1729421985, now seen corresponding path program 6 times [2023-12-02 17:47:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662172428] [2023-12-02 17:47:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:47:42,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662172428] [2023-12-02 17:47:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662172428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230349863] [2023-12-02 17:47:42,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:47:42,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:47:42,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:47:42,150 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:47:42,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 17:47:43,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:47:43,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:47:43,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 356 conjunts are in the unsatisfiable core [2023-12-02 17:47:43,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:47:43,164 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 256 treesize of output 252 [2023-12-02 17:47:43,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:47:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:47:43,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 17:47:44,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 17:47:45,000 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:47:45,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2023-12-02 17:47:45,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 17:47:45,564 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-12-02 17:47:45,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2023-12-02 17:47:45,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 17:47:46,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 17:47:46,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 17:47:46,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 17:47:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 52 proven. 163 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-02 17:47:46,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230349863] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:50,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1483174268] [2023-12-02 17:47:50,490 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:47:50,490 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:47:50,490 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 17:47:50,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:47:50,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 73 [2023-12-02 17:47:50,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842847191] [2023-12-02 17:47:50,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:47:50,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-12-02 17:47:50,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:50,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-12-02 17:47:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=7752, Unknown=0, NotChecked=0, Total=8010 [2023-12-02 17:47:50,494 INFO L87 Difference]: Start difference. First operand 760 states and 1045 transitions. Second operand has 74 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 51 states have internal predecessors, (94), 27 states have call successors, (27), 23 states have call predecessors, (27), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-02 17:48:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:48:20,619 INFO L93 Difference]: Finished difference Result 1752 states and 2476 transitions. [2023-12-02 17:48:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2023-12-02 17:48:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 51 states have internal predecessors, (94), 27 states have call successors, (27), 23 states have call predecessors, (27), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 80 [2023-12-02 17:48:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:48:20,626 INFO L225 Difference]: With dead ends: 1752 [2023-12-02 17:48:20,626 INFO L226 Difference]: Without dead ends: 1115 [2023-12-02 17:48:20,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16199 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=2893, Invalid=60863, Unknown=0, NotChecked=0, Total=63756 [2023-12-02 17:48:20,631 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 425 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 8076 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 8417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 8076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:48:20,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 3177 Invalid, 8417 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [341 Valid, 8076 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-12-02 17:48:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-02 17:48:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 998. [2023-12-02 17:48:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 627 states have (on average 1.1690590111642742) internal successors, (733), 711 states have internal predecessors, (733), 143 states have call successors, (143), 117 states have call predecessors, (143), 227 states have return successors, (503), 187 states have call predecessors, (503), 141 states have call successors, (503) [2023-12-02 17:48:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1379 transitions. [2023-12-02 17:48:20,881 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1379 transitions. Word has length 80 [2023-12-02 17:48:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:48:20,882 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1379 transitions. [2023-12-02 17:48:20,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 51 states have internal predecessors, (94), 27 states have call successors, (27), 23 states have call predecessors, (27), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-02 17:48:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1379 transitions. [2023-12-02 17:48:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-02 17:48:20,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:48:20,884 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:48:20,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 17:48:21,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 17:48:21,091 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:48:21,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:48:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1129225087, now seen corresponding path program 2 times [2023-12-02 17:48:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:48:21,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371314470] [2023-12-02 17:48:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:48:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 87 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 17:48:27,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:48:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371314470] [2023-12-02 17:48:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371314470] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:48:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187188053] [2023-12-02 17:48:27,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:48:27,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:48:27,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:48:27,067 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:48:27,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07552794-0fc5-4aa4-a55d-2ab815784e98/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 17:48:28,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:48:28,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:48:28,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 352 conjunts are in the unsatisfiable core [2023-12-02 17:48:28,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:28,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-02 17:48:28,845 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 36 treesize of output 17 [2023-12-02 17:48:28,850 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:48:28,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 17:48:28,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-12-02 17:48:28,870 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 17:48:28,885 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 17:48:28,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1528 treesize of output 1478 [2023-12-02 17:48:30,173 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 17:48:31,008 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-02 17:48:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 41 [2023-12-02 17:48:31,016 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 17:48:31,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:48:31,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-02 17:48:31,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:48:31,158 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 1 case distinctions, treesize of input 24 treesize of output 23 [2023-12-02 17:48:31,172 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 9 treesize of output 7 [2023-12-02 17:48:31,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-12-02 17:48:31,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-12-02 17:48:32,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-12-02 17:48:32,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:48:32,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 198 treesize of output 242 [2023-12-02 17:48:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 17:48:33,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:48:38,884 INFO L349 Elim1Store]: treesize reduction 75, result has 48.6 percent of original size [2023-12-02 17:48:38,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 13233 treesize of output 12949 [2023-12-02 17:48:39,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:48:39,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4441 treesize of output 4271 [2023-12-02 17:48:40,477 INFO L349 Elim1Store]: treesize reduction 40, result has 71.2 percent of original size [2023-12-02 17:48:40,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 4504 treesize of output 4426 [2023-12-02 17:48:40,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:48:40,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1861 treesize of output 1887 [2023-12-02 17:48:41,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:48:41,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3111 treesize of output 3055 [2023-12-02 17:48:42,164 INFO L349 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2023-12-02 17:48:42,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1331 treesize of output 1349 [2023-12-02 17:48:46,951 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 8 treesize of output 6 [2023-12-02 17:48:48,031 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 8 treesize of output 6 [2023-12-02 17:48:54,675 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 8 treesize of output 6 [2023-12-02 17:48:54,731 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 17:48:55,909 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 351 treesize of output 341 [2023-12-02 17:48:57,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:48:57,144 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 312 treesize of output 310 [2023-12-02 17:49:56,461 WARN L293 SmtUtils]: Spent 24.23s on a formula simplification that was a NOOP. DAG size: 393 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 17:49:56,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:56,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 4340622827 treesize of output 4286486349 [2023-12-02 17:51:40,207 WARN L293 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 78977 DAG size of output: 5687 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)