./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ --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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:01:08,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:01:08,617 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-19 05:01:08,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:01:08,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:01:08,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:01:08,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:01:08,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:01:08,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:01:08,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:01:08,651 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:01:08,652 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:01:08,652 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:01:08,653 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:01:08,653 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:01:08,654 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:01:08,654 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:01:08,655 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:01:08,655 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:01:08,656 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:01:08,656 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:01:08,663 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:01:08,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:01:08,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:01:08,664 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:01:08,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:01:08,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:01:08,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:01:08,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:01:08,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:01:08,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:01:08,667 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 05:01:08,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:01:08,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:01:08,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:01:08,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:01:08,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:01:08,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:01:08,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:08,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:01:08,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:01:08,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:01:08,672 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:01:08,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:01:08,673 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:01:08,673 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:01:08,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:01:08,674 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_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/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_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-19 05:01:08,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:01:08,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:01:08,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:01:08,981 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:01:08,981 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:01:08,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 05:01:12,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:01:12,554 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:01:12,555 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 05:01:12,564 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/data/6c3bde596/bc0116515125403abf7bda12e9cc4dc9/FLAG540766b23 [2023-11-19 05:01:12,584 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/data/6c3bde596/bc0116515125403abf7bda12e9cc4dc9 [2023-11-19 05:01:12,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:01:12,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:01:12,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:12,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:01:12,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:01:12,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fd1db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12, skipping insertion in model container [2023-11-19 05:01:12,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,642 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:01:12,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:12,865 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:01:12,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:12,900 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:01:12,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12 WrapperNode [2023-11-19 05:01:12,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:12,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:12,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:01:12,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:01:12,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,935 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-19 05:01:12,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:12,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:01:12,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:01:12,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:01:12,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:01:12,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:01:12,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:01:12,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:01:12,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:13,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:01:13,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:01:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:01:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:01:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:01:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:01:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 05:01:13,041 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 05:01:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 05:01:13,043 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 05:01:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:01:13,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:01:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:01:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 05:01:13,045 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 05:01:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:01:13,156 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:01:13,158 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:01:13,414 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:01:13,542 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:01:13,542 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:01:13,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:13 BoogieIcfgContainer [2023-11-19 05:01:13,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:01:13,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:01:13,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:01:13,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:01:13,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:01:12" (1/3) ... [2023-11-19 05:01:13,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547a8f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:13, skipping insertion in model container [2023-11-19 05:01:13,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (2/3) ... [2023-11-19 05:01:13,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547a8f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:13, skipping insertion in model container [2023-11-19 05:01:13,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:13" (3/3) ... [2023-11-19 05:01:13,559 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-19 05:01:13,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:01:13,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-19 05:01:13,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:01:13,632 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;@72d73256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:01:13,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 05:01:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:01:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:01:13,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:13,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:13,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:13,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash 810054862, now seen corresponding path program 1 times [2023-11-19 05:01:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:13,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355917832] [2023-11-19 05:01:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:14,283 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-19 05:01:14,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355917832] [2023-11-19 05:01:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355917832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:14,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:01:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420708067] [2023-11-19 05:01:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:14,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:14,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:14,340 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-19 05:01:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:14,530 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-19 05:01:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 11 [2023-11-19 05:01:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:14,540 INFO L225 Difference]: With dead ends: 48 [2023-11-19 05:01:14,540 INFO L226 Difference]: Without dead ends: 42 [2023-11-19 05:01:14,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:01:14,546 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:14,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-19 05:01:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-11-19 05:01:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-19 05:01:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-19 05:01:14,592 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2023-11-19 05:01:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:14,593 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-19 05:01:14,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-19 05:01:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-19 05:01:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:01:14,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:14,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:14,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:01:14,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:14,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 817017305, now seen corresponding path program 1 times [2023-11-19 05:01:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338928164] [2023-11-19 05:01:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:14,890 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-19 05:01:14,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338928164] [2023-11-19 05:01:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338928164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:01:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153283731] [2023-11-19 05:01:14,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:14,896 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:15,046 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-11-19 05:01:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:15,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-19 05:01:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:15,049 INFO L225 Difference]: With dead ends: 76 [2023-11-19 05:01:15,049 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 05:01:15,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:01:15,052 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:15,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 05:01:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-19 05:01:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 32 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 05:01:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-19 05:01:15,063 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2023-11-19 05:01:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:15,063 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-19 05:01:15,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-19 05:01:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:01:15,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:15,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:15,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:01:15,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:15,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1070065794, now seen corresponding path program 1 times [2023-11-19 05:01:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105656775] [2023-11-19 05:01:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:15,268 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-19 05:01:15,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105656775] [2023-11-19 05:01:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105656775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:01:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150992399] [2023-11-19 05:01:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:15,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:15,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:15,276 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:15,380 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2023-11-19 05:01:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:15,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-19 05:01:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:15,385 INFO L225 Difference]: With dead ends: 80 [2023-11-19 05:01:15,385 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:01:15,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:01:15,391 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:15,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:01:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 05:01:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:01:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-19 05:01:15,401 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2023-11-19 05:01:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:15,402 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-19 05:01:15,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-19 05:01:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:01:15,403 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:15,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:15,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:01:15,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:15,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 278857872, now seen corresponding path program 1 times [2023-11-19 05:01:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905696738] [2023-11-19 05:01:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:15,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905696738] [2023-11-19 05:01:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905696738] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039426366] [2023-11-19 05:01:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:15,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:15,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:15,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:01:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:15,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 05:01:15,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:15,910 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-19 05:01:15,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-19 05:01:16,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 05:01:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:16,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:16,134 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-19 05:01:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039426366] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 8] total 17 [2023-11-19 05:01:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950402370] [2023-11-19 05:01:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:16,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:16,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:16,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:16,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-19 05:01:16,136 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:16,247 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-19 05:01:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:01:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 05:01:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:16,249 INFO L225 Difference]: With dead ends: 42 [2023-11-19 05:01:16,249 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 05:01:16,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-11-19 05:01:16,251 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:16,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 05:01:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2023-11-19 05:01:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:01:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-19 05:01:16,260 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2023-11-19 05:01:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:16,261 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-19 05:01:16,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-19 05:01:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:01:16,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:16,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:16,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:16,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:16,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 54659477, now seen corresponding path program 1 times [2023-11-19 05:01:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708180699] [2023-11-19 05:01:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:01:16,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708180699] [2023-11-19 05:01:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708180699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:01:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984250184] [2023-11-19 05:01:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:16,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:01:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:16,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:01:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:01:16,535 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:16,564 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-19 05:01:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:01:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 05:01:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:16,566 INFO L225 Difference]: With dead ends: 38 [2023-11-19 05:01:16,566 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 05:01:16,567 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-19 05:01:16,568 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:16,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:01:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 05:01:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-19 05:01:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:01:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-19 05:01:16,576 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2023-11-19 05:01:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:16,576 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-19 05:01:16,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-19 05:01:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:01:16,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:16,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:16,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:01:16,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:16,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1689545606, now seen corresponding path program 1 times [2023-11-19 05:01:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581397880] [2023-11-19 05:01:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:16,903 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-19 05:01:16,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581397880] [2023-11-19 05:01:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581397880] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074749694] [2023-11-19 05:01:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:16,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:16,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:16,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:01:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:16,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 05:01:16,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:17,000 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-19 05:01:17,219 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-19 05:01:17,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:17,688 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-19 05:01:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074749694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734265493] [2023-11-19 05:01:17,709 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:17,709 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:17,713 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-19 05:01:17,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2023-11-19 05:01:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171731097] [2023-11-19 05:01:17,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:17,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 05:01:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 05:01:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2023-11-19 05:01:17,719 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:01:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:18,055 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-19 05:01:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 05:01:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2023-11-19 05:01:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:18,058 INFO L225 Difference]: With dead ends: 72 [2023-11-19 05:01:18,058 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:01:18,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2023-11-19 05:01:18,063 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:18,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:01:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 05:01:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 05:01:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-19 05:01:18,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2023-11-19 05:01:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:18,085 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-19 05:01:18,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:01:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-19 05:01:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 05:01:18,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:18,090 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:18,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:18,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 05:01:18,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:18,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash -68962506, now seen corresponding path program 2 times [2023-11-19 05:01:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:18,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592272655] [2023-11-19 05:01:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:01:19,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:19,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592272655] [2023-11-19 05:01:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592272655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717318840] [2023-11-19 05:01:19,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:01:19,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:19,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:19,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:19,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:01:19,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 05:01:19,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:01:19,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-19 05:01:19,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:19,278 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-19 05:01:19,774 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-19 05:01:19,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:21,561 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-19 05:01:21,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717318840] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:21,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558980667] [2023-11-19 05:01:21,565 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:21,565 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:21,566 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-19 05:01:21,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 21] total 43 [2023-11-19 05:01:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622364558] [2023-11-19 05:01:21,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:21,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-19 05:01:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-19 05:01:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2023-11-19 05:01:21,572 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-19 05:01:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:22,606 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2023-11-19 05:01:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-19 05:01:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 35 [2023-11-19 05:01:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:22,608 INFO L225 Difference]: With dead ends: 102 [2023-11-19 05:01:22,609 INFO L226 Difference]: Without dead ends: 65 [2023-11-19 05:01:22,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=494, Invalid=2928, Unknown=0, NotChecked=0, Total=3422 [2023-11-19 05:01:22,612 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:22,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 298 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 05:01:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-19 05:01:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2023-11-19 05:01:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-19 05:01:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-19 05:01:22,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2023-11-19 05:01:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:22,621 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-19 05:01:22,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-19 05:01:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-19 05:01:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-19 05:01:22,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:22,624 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:22,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:22,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 05:01:22,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:22,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:22,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1532947442, now seen corresponding path program 3 times [2023-11-19 05:01:22,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:22,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110118574] [2023-11-19 05:01:22,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:22,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-19 05:01:24,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110118574] [2023-11-19 05:01:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110118574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836988113] [2023-11-19 05:01:24,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:01:24,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:24,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:24,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:24,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:01:24,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:01:24,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:01:24,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-19 05:01:24,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:24,239 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-19 05:01:24,901 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-19 05:01:24,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:28,472 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-19 05:01:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836988113] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [368714001] [2023-11-19 05:01:28,475 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:28,475 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:28,475 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-19 05:01:28,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:28,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 31] total 55 [2023-11-19 05:01:28,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147318159] [2023-11-19 05:01:28,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:28,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-19 05:01:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:28,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-19 05:01:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2023-11-19 05:01:28,481 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-19 05:01:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:29,322 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-11-19 05:01:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 05:01:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 49 [2023-11-19 05:01:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:29,324 INFO L225 Difference]: With dead ends: 86 [2023-11-19 05:01:29,324 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 05:01:29,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=738, Invalid=4092, Unknown=0, NotChecked=0, Total=4830 [2023-11-19 05:01:29,327 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:29,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 297 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:01:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 05:01:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-19 05:01:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 31 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-19 05:01:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-11-19 05:01:29,342 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 49 [2023-11-19 05:01:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:29,342 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-11-19 05:01:29,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-19 05:01:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-11-19 05:01:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 05:01:29,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:29,353 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:29,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:29,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-19 05:01:29,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:29,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash -610414542, now seen corresponding path program 4 times [2023-11-19 05:01:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:29,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260879712] [2023-11-19 05:01:29,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:34,270 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-19 05:01:34,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:34,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260879712] [2023-11-19 05:01:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260879712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790610480] [2023-11-19 05:01:34,271 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 05:01:34,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:34,272 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:34,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 05:01:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:34,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-19 05:01:34,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:34,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-11-19 05:01:34,487 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-19 05:01:34,508 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-19 05:01:36,739 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from false [2023-11-19 05:01:38,746 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from true [2023-11-19 05:01:40,783 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 05:01:42,785 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 05:01:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 11 not checked. [2023-11-19 05:01:42,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790610480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1803148454] [2023-11-19 05:01:43,176 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:43,176 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:43,176 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-19 05:01:43,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 15 [2023-11-19 05:01:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761333639] [2023-11-19 05:01:43,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 05:01:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 05:01:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=257, Unknown=7, NotChecked=66, Total=380 [2023-11-19 05:01:43,179 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 05:01:43,367 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2023-11-19 05:01:45,370 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2023-11-19 05:01:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:45,500 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-11-19 05:01:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 05:01:45,501 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2023-11-19 05:01:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:45,510 INFO L225 Difference]: With dead ends: 55 [2023-11-19 05:01:45,510 INFO L226 Difference]: Without dead ends: 51 [2023-11-19 05:01:45,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=107, Invalid=546, Unknown=9, NotChecked=150, Total=812 [2023-11-19 05:01:45,514 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:45,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 151 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 101 Unchecked, 0.2s Time] [2023-11-19 05:01:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-19 05:01:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-19 05:01:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-19 05:01:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-19 05:01:45,538 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 56 [2023-11-19 05:01:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:45,539 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-19 05:01:45,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 05:01:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-19 05:01:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-19 05:01:45,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:45,545 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:45,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-19 05:01:45,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 05:01:45,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1885674721, now seen corresponding path program 1 times [2023-11-19 05:01:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:45,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811249122] [2023-11-19 05:01:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 05:01:49,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:49,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811249122] [2023-11-19 05:01:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811249122] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:49,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512666856] [2023-11-19 05:01:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:49,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:49,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:49,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:49,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac06e4b9-862f-440d-88cd-214a8f7529f7/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 05:01:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:49,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-19 05:01:49,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:49,573 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-19 05:01:49,578 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 18 treesize of output 16 [2023-11-19 05:01:49,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:01:51,935 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 05:01:53,937 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 05:01:56,062 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 05:01:56,066 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-19 05:01:58,092 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (<= |c_func_to_recursive_line_22_to_23_0_#t~mem8| (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 05:01:58,095 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (<= |c_func_to_recursive_line_22_to_23_0_#t~mem8| (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-19 05:01:58,177 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset))) (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (and (<= .cse0 (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)) (= (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse3 (select |v_#memory_int_312| .cse3))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_36| .cse3)))))) (= (store |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|) (<= .cse0 (+ 1 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset)))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 05:01:58,181 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset))) (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (and (<= .cse0 (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)) (= (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse3 (select |v_#memory_int_312| .cse3))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_36| .cse3)))))) (= (store |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|) (<= .cse0 (+ 1 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset)))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-19 05:02:00,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (or (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |v_#memory_int_312| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)))))) (= (store |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)) (= |c_#memory_int| (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)))))))) (<= 6 .cse2))) is different from false [2023-11-19 05:02:00,301 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (or (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |v_#memory_int_312| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)))))) (= (store |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)) (= |c_#memory_int| (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)))))))) (<= 6 .cse2))) is different from true [2023-11-19 05:02:00,482 INFO L349 Elim1Store]: treesize reduction 95, result has 34.5 percent of original size [2023-11-19 05:02:00,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 246 [2023-11-19 05:02:00,592 INFO L349 Elim1Store]: treesize reduction 132, result has 9.6 percent of original size [2023-11-19 05:02:00,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 60 [2023-11-19 05:02:00,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:02:00,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2023-11-19 05:02:00,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:02:00,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:02:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2023-11-19 05:02:00,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:02:00,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:02:00,830 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-11-19 05:02:00,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 40 [2023-11-19 05:02:03,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~a.base))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= (select (select (store |c_#memory_int| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)) c_func_to_recursive_line_21_to_22_0_~a.base) c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (not (= .cse0 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse0) func_to_recursive_line_21_to_22_0_~b.offset))))) (and (= (select .cse1 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (not (= .cse2 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse2) func_to_recursive_line_21_to_22_0_~b.offset))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_14) .cse4 (select |v_old(#memory_int)_AFTER_CALL_36| .cse4))) func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse3 func_to_recursive_line_21_to_22_0_~b.offset) 0) (= .cse3 v_DerPreprocessor_14)))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse7 (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_10) .cse8 (select |v_old(#memory_int)_AFTER_CALL_36| .cse8))))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_21_to_22_0_~a.base)) (.cse6 (select .cse7 func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse5 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (= .cse5 .cse1) (= 0 (select .cse6 func_to_recursive_line_21_to_22_0_~b.offset)) (= .cse6 v_DerPreprocessor_10))))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) is different from false [2023-11-19 05:02:03,037 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~a.base))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= (select (select (store |c_#memory_int| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)) c_func_to_recursive_line_21_to_22_0_~a.base) c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (not (= .cse0 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse0) func_to_recursive_line_21_to_22_0_~b.offset))))) (and (= (select .cse1 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (not (= .cse2 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse2) func_to_recursive_line_21_to_22_0_~b.offset))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_14) .cse4 (select |v_old(#memory_int)_AFTER_CALL_36| .cse4))) func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse3 func_to_recursive_line_21_to_22_0_~b.offset) 0) (= .cse3 v_DerPreprocessor_14)))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse7 (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_10) .cse8 (select |v_old(#memory_int)_AFTER_CALL_36| .cse8))))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_21_to_22_0_~a.base)) (.cse6 (select .cse7 func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse5 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (= .cse5 .cse1) (= 0 (select .cse6 func_to_recursive_line_21_to_22_0_~b.offset)) (= .cse6 v_DerPreprocessor_10))))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) is different from true [2023-11-19 05:02:03,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:02:03,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 468 treesize of output 530 [2023-11-19 05:02:03,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:02:03,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3