./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30e01a73 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_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:15:37,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:15:37,275 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-23 21:15:37,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:15:37,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:15:37,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:15:37,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:15:37,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:15:37,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:15:37,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:15:37,307 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:15:37,308 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:15:37,308 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:15:37,309 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:15:37,309 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:15:37,310 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:15:37,310 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:15:37,311 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:15:37,311 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:15:37,312 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:15:37,312 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:15:37,313 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:15:37,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:15:37,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:15:37,315 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:15:37,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:15:37,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:15:37,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:15:37,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:15:37,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:15:37,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:15:37,318 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-23 21:15:37,319 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:15:37,319 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:15:37,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:15:37,320 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:15:37,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:15:37,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:15:37,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:15:37,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:15:37,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:15:37,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:15:37,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:15:37,324 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:15:37,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:15:37,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:15:37,325 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:15:37,325 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:15:37,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:15:37,329 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_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/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_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire 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 ! overflow) ) 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2023-11-23 21:15:37,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:15:37,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:15:37,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:15:37,717 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:15:37,717 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:15:37,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-23 21:15:40,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:15:41,194 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:15:41,195 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-23 21:15:41,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/data/0257a2f30/db88f4af4a6140209b22a9cb13bd0741/FLAGbefdf6f2b [2023-11-23 21:15:41,219 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/data/0257a2f30/db88f4af4a6140209b22a9cb13bd0741 [2023-11-23 21:15:41,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:15:41,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:15:41,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:15:41,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:15:41,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:15:41,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7641f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41, skipping insertion in model container [2023-11-23 21:15:41,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,275 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:15:41,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:15:41,534 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:15:41,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:15:41,576 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:15:41,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41 WrapperNode [2023-11-23 21:15:41,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:15:41,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:15:41,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:15:41,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:15:41,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,616 INFO L138 Inliner]: procedures = 13, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2023-11-23 21:15:41,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:15:41,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:15:41,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:15:41,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:15:41,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:15:41,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:15:41,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:15:41,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:15:41,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (1/1) ... [2023-11-23 21:15:41,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:15:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:15:41,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:15:41,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:15:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:15:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:15:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:15:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:15:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-11-23 21:15:41,739 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-11-23 21:15:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:15:41,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:15:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:15:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-11-23 21:15:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-11-23 21:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:15:41,807 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:15:41,809 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:15:41,998 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:15:42,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:15:42,068 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:15:42,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:15:42 BoogieIcfgContainer [2023-11-23 21:15:42,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:15:42,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:15:42,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:15:42,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:15:42,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:15:41" (1/3) ... [2023-11-23 21:15:42,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c901853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:15:42, skipping insertion in model container [2023-11-23 21:15:42,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:41" (2/3) ... [2023-11-23 21:15:42,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c901853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:15:42, skipping insertion in model container [2023-11-23 21:15:42,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:15:42" (3/3) ... [2023-11-23 21:15:42,081 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-11-23 21:15:42,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:15:42,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-23 21:15:42,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:15:42,193 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;@3d587f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:15:42,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-23 21:15:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 21:15:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 21:15:42,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:42,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:42,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:42,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -488469868, now seen corresponding path program 1 times [2023-11-23 21:15:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:42,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894255337] [2023-11-23 21:15:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:15:42,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:15:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894255337] [2023-11-23 21:15:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894255337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:15:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:15:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:15:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414470067] [2023-11-23 21:15:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:15:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:15:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:15:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:15:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:15:42,996 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:15:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:15:43,122 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-23 21:15:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:15:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 21:15:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:15:43,133 INFO L225 Difference]: With dead ends: 51 [2023-11-23 21:15:43,134 INFO L226 Difference]: Without dead ends: 25 [2023-11-23 21:15:43,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:15:43,142 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:15:43,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:15:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-23 21:15:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-23 21:15:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:15:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-23 21:15:43,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 8 [2023-11-23 21:15:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:15:43,190 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-23 21:15:43,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:15:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-23 21:15:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:15:43,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:43,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:43,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:15:43,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:43,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2037303351, now seen corresponding path program 1 times [2023-11-23 21:15:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:43,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008519201] [2023-11-23 21:15:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:15:43,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:15:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008519201] [2023-11-23 21:15:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008519201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:15:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:15:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:15:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617152377] [2023-11-23 21:15:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:15:43,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:15:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:15:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:15:43,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:15:43,287 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:15:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:15:43,319 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-23 21:15:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:15:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 21:15:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:15:43,322 INFO L225 Difference]: With dead ends: 23 [2023-11-23 21:15:43,322 INFO L226 Difference]: Without dead ends: 22 [2023-11-23 21:15:43,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:15:43,324 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:15:43,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:15:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-23 21:15:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-23 21:15:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:15:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-23 21:15:43,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-11-23 21:15:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:15:43,334 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-23 21:15:43,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:15:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-23 21:15:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-23 21:15:43,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:43,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:15:43,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:43,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 402286886, now seen corresponding path program 1 times [2023-11-23 21:15:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544977940] [2023-11-23 21:15:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:15:43,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:15:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544977940] [2023-11-23 21:15:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544977940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:15:43,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:15:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:15:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140547573] [2023-11-23 21:15:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:15:43,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:15:43,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:15:43,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:15:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:15:43,699 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:15:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:15:43,815 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-23 21:15:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:15:43,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-23 21:15:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:15:43,818 INFO L225 Difference]: With dead ends: 28 [2023-11-23 21:15:43,819 INFO L226 Difference]: Without dead ends: 27 [2023-11-23 21:15:43,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:15:43,821 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:15:43,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:15:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-23 21:15:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-11-23 21:15:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 21:15:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-23 21:15:43,832 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2023-11-23 21:15:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:15:43,832 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-23 21:15:43,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:15:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-23 21:15:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 21:15:43,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:43,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:43,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:15:43,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:43,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash -986541066, now seen corresponding path program 1 times [2023-11-23 21:15:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96397290] [2023-11-23 21:15:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:15:44,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:15:44,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96397290] [2023-11-23 21:15:44,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96397290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:15:44,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390177320] [2023-11-23 21:15:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:44,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:15:44,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:15:44,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:15:44,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:15:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:44,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 21:15:44,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:15:44,531 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-11-23 21:15:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:15:44,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:15:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:15:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390177320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:15:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [778901120] [2023-11-23 21:15:45,446 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-23 21:15:45,447 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:15:45,451 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-11-23 21:15:45,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:15:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2023-11-23 21:15:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744929626] [2023-11-23 21:15:45,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:15:45,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 21:15:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:15:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 21:15:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2023-11-23 21:15:45,460 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 21:15:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:15:45,749 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-23 21:15:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:15:45,749 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 18 [2023-11-23 21:15:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:15:45,752 INFO L225 Difference]: With dead ends: 46 [2023-11-23 21:15:45,752 INFO L226 Difference]: Without dead ends: 26 [2023-11-23 21:15:45,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2023-11-23 21:15:45,756 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:15:45,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:15:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-23 21:15:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-23 21:15:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 21:15:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-11-23 21:15:45,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2023-11-23 21:15:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:15:45,765 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-11-23 21:15:45,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 21:15:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-11-23 21:15:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 21:15:45,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:45,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:45,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 21:15:45,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-23 21:15:45,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:45,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1949892678, now seen corresponding path program 2 times [2023-11-23 21:15:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:45,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606344854] [2023-11-23 21:15:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 21:15:46,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:15:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606344854] [2023-11-23 21:15:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606344854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:15:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404596644] [2023-11-23 21:15:46,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:15:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:15:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:15:46,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:15:46,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:15:47,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 21:15:47,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:15:47,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-23 21:15:47,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:15:47,078 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-11-23 21:15:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 21:15:47,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:15:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:15:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404596644] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:15:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1095168949] [2023-11-23 21:15:49,234 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-23 21:15:49,234 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:15:49,235 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-11-23 21:15:49,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:15:49,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 42 [2023-11-23 21:15:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356996908] [2023-11-23 21:15:49,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:15:49,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 21:15:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:15:49,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 21:15:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1439, Unknown=0, NotChecked=0, Total=1722 [2023-11-23 21:15:49,256 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 42 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-23 21:15:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:15:49,823 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-23 21:15:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 21:15:49,824 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 32 [2023-11-23 21:15:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:15:49,825 INFO L225 Difference]: With dead ends: 54 [2023-11-23 21:15:49,825 INFO L226 Difference]: Without dead ends: 30 [2023-11-23 21:15:49,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=413, Invalid=2137, Unknown=0, NotChecked=0, Total=2550 [2023-11-23 21:15:49,828 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:15:49,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 116 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:15:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-23 21:15:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-23 21:15:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 21:15:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-11-23 21:15:49,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 32 [2023-11-23 21:15:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:15:49,837 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-11-23 21:15:49,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-23 21:15:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-11-23 21:15:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 21:15:49,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:49,839 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:49,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:15:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:15:50,053 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:50,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash -956296042, now seen corresponding path program 3 times [2023-11-23 21:15:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548327459] [2023-11-23 21:15:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:15:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 21:15:51,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:15:51,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548327459] [2023-11-23 21:15:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548327459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:15:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213045061] [2023-11-23 21:15:51,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 21:15:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:15:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:15:51,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:15:51,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:15:51,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 21:15:51,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:15:51,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-23 21:15:51,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:15:51,727 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-11-23 21:15:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-23 21:15:52,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:15:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:15:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213045061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:15:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482419112] [2023-11-23 21:15:55,834 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-23 21:15:55,835 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:15:55,835 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-11-23 21:15:55,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:15:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 31] total 55 [2023-11-23 21:15:55,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227000053] [2023-11-23 21:15:55,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:15:55,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 21:15:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:15:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 21:15:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2474, Unknown=0, NotChecked=0, Total=2970 [2023-11-23 21:15:55,843 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-23 21:15:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:15:56,649 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-11-23 21:15:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 21:15:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 46 [2023-11-23 21:15:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:15:56,651 INFO L225 Difference]: With dead ends: 60 [2023-11-23 21:15:56,651 INFO L226 Difference]: Without dead ends: 32 [2023-11-23 21:15:56,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=707, Invalid=3453, Unknown=0, NotChecked=0, Total=4160 [2023-11-23 21:15:56,656 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:15:56,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 148 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:15:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-23 21:15:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-23 21:15:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 21:15:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-11-23 21:15:56,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 46 [2023-11-23 21:15:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:15:56,665 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-11-23 21:15:56,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-23 21:15:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-11-23 21:15:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 21:15:56,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:15:56,668 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:15:56,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:15:56,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 21:15:56,877 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:15:56,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:15:56,878 INFO L85 PathProgramCache]: Analyzing trace with hash 846289584, now seen corresponding path program 4 times [2023-11-23 21:15:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:15:56,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465697903] [2023-11-23 21:15:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:15:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:15:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-23 21:16:01,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465697903] [2023-11-23 21:16:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465697903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:16:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072015223] [2023-11-23 21:16:01,702 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-23 21:16:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:16:01,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:16:01,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:16:01,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:16:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:01,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-23 21:16:01,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:16:01,866 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 10 treesize of output 8 [2023-11-23 21:16:01,871 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-11-23 21:16:01,891 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-11-23 21:16:04,083 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from false [2023-11-23 21:16:06,085 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from true [2023-11-23 21:16:08,131 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) is different from false [2023-11-23 21:16:10,133 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) is different from true [2023-11-23 21:16:12,166 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0))))) is different from false [2023-11-23 21:16:14,169 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0))))) is different from true [2023-11-23 21:16:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 94 trivial. 15 not checked. [2023-11-23 21:16:14,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:16:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072015223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:16:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1017147204] [2023-11-23 21:16:14,552 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-23 21:16:14,552 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:16:14,553 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-11-23 21:16:14,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 21:16:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 13 [2023-11-23 21:16:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562024468] [2023-11-23 21:16:14,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 21:16:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 21:16:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 21:16:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=167, Unknown=10, NotChecked=84, Total=306 [2023-11-23 21:16:14,557 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 21:16:16,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse1 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse2) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse0) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse3))))))) is different from false [2023-11-23 21:16:18,662 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse1 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse2) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse0) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse3))))))) is different from true [2023-11-23 21:16:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:18,727 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2023-11-23 21:16:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 21:16:18,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-11-23 21:16:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:18,729 INFO L225 Difference]: With dead ends: 40 [2023-11-23 21:16:18,730 INFO L226 Difference]: Without dead ends: 38 [2023-11-23 21:16:18,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=79, Invalid=267, Unknown=12, NotChecked=148, Total=506 [2023-11-23 21:16:18,731 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:18,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2023-11-23 21:16:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-23 21:16:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-23 21:16:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 21:16:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-11-23 21:16:18,740 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 53 [2023-11-23 21:16:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:18,741 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-11-23 21:16:18,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 21:16:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-11-23 21:16:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-23 21:16:18,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:18,746 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:18,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 21:16:18,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-23 21:16:18,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-23 21:16:18,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash -790401520, now seen corresponding path program 1 times [2023-11-23 21:16:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257300927] [2023-11-23 21:16:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2023-11-23 21:16:25,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257300927] [2023-11-23 21:16:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257300927] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:16:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042777816] [2023-11-23 21:16:25,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:25,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:16:25,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:16:25,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:16:25,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbcde8a-a89c-4da3-88c8-a50b4ea4b691/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 21:16:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:25,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-23 21:16:25,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:16:25,790 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 10 treesize of output 8 [2023-11-23 21:16:25,794 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-11-23 21:16:25,811 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-11-23 21:16:27,986 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2023-11-23 21:16:29,988 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true