./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91 --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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:55:18,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:55:18,327 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-24 23:55:18,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:55:18,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:55:18,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:55:18,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:55:18,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:55:18,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:55:18,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:55:18,368 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:55:18,369 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:55:18,369 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:55:18,370 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:55:18,370 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:55:18,371 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:55:18,372 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:55:18,372 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:55:18,373 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:55:18,374 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:55:18,374 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:55:18,375 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:55:18,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:55:18,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:55:18,377 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:55:18,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:55:18,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:55:18,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:55:18,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:55:18,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:55:18,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:55:18,381 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-24 23:55:18,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:55:18,382 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:55:18,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:55:18,382 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:55:18,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:55:18,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:55:18,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:55:18,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:55:18,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:55:18,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:55:18,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:55:18,385 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:55:18,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:55:18,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:55:18,385 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:55:18,386 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:55:18,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:55:18,386 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_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/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_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2023-11-24 23:55:18,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:55:18,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:55:18,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:55:18,662 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:55:18,662 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:55:18,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-24 23:55:21,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:55:22,187 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:55:22,188 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-24 23:55:22,197 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/data/e902f2bf0/f9f248559c674445bbcd111413a5e7a1/FLAG36cc6eccd [2023-11-24 23:55:22,215 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/data/e902f2bf0/f9f248559c674445bbcd111413a5e7a1 [2023-11-24 23:55:22,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:55:22,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:55:22,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:55:22,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:55:22,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:55:22,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a7a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22, skipping insertion in model container [2023-11-24 23:55:22,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,272 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:55:22,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:55:22,473 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:55:22,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:55:22,515 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:55:22,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22 WrapperNode [2023-11-24 23:55:22,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:55:22,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:55:22,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:55:22,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:55:22,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,559 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2023-11-24 23:55:22,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:55:22,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:55:22,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:55:22,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:55:22,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:55:22,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:55:22,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:55:22,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:55:22,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (1/1) ... [2023-11-24 23:55:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:55:22,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:22,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:55:22,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:55:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:55:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:55:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:55:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:55:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-24 23:55:22,681 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-24 23:55:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-24 23:55:22,681 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-24 23:55:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-24 23:55:22,682 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-24 23:55:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:55:22,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:55:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:55:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2023-11-24 23:55:22,683 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2023-11-24 23:55:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-24 23:55:22,684 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-24 23:55:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:55:22,790 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:55:22,793 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:55:23,168 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:55:23,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:55:23,362 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 23:55:23,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:23 BoogieIcfgContainer [2023-11-24 23:55:23,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:55:23,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:55:23,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:55:23,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:55:23,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:55:22" (1/3) ... [2023-11-24 23:55:23,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d688e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:55:23, skipping insertion in model container [2023-11-24 23:55:23,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:22" (2/3) ... [2023-11-24 23:55:23,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d688e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:55:23, skipping insertion in model container [2023-11-24 23:55:23,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:23" (3/3) ... [2023-11-24 23:55:23,379 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2023-11-24 23:55:23,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:55:23,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-24 23:55:23,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:55:23,448 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;@45beba3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:55:23,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 23:55:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 46 states have internal predecessors, (46), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-24 23:55:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:55:23,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:23,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:23,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:23,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1666641975, now seen corresponding path program 1 times [2023-11-24 23:55:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420748725] [2023-11-24 23:55:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:24,167 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-24 23:55:24,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420748725] [2023-11-24 23:55:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420748725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:55:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375480762] [2023-11-24 23:55:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:24,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:24,211 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 46 states have internal predecessors, (46), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 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-24 23:55:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:24,557 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2023-11-24 23:55:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:24,560 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-24 23:55:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:24,573 INFO L225 Difference]: With dead ends: 122 [2023-11-24 23:55:24,574 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 23:55:24,581 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-24 23:55:24,589 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:24,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 152 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:55:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 23:55:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-11-24 23:55:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 44 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-24 23:55:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-11-24 23:55:24,649 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 11 [2023-11-24 23:55:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:24,650 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-11-24 23:55:24,650 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-24 23:55:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-11-24 23:55:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 23:55:24,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:24,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:24,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:55:24,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:24,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1209511883, now seen corresponding path program 1 times [2023-11-24 23:55:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519739513] [2023-11-24 23:55:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:24,926 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-24 23:55:24,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519739513] [2023-11-24 23:55:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519739513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:24,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:24,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:55:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349301867] [2023-11-24 23:55:24,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:24,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:24,933 INFO L87 Difference]: Start difference. First operand 55 states and 63 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-24 23:55:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:25,115 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2023-11-24 23:55:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:25,116 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-24 23:55:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:25,118 INFO L225 Difference]: With dead ends: 114 [2023-11-24 23:55:25,119 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 23:55:25,120 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-24 23:55:25,122 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:25,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 23:55:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-24 23:55:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 45 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-24 23:55:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-24 23:55:25,135 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2023-11-24 23:55:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:25,136 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-24 23:55:25,136 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-24 23:55:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-24 23:55:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:55:25,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:25,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:25,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:55:25,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:25,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2093948222, now seen corresponding path program 1 times [2023-11-24 23:55:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414962525] [2023-11-24 23:55:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:25,403 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-24 23:55:25,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414962525] [2023-11-24 23:55:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414962525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:55:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885097983] [2023-11-24 23:55:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:25,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:25,406 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:25,541 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2023-11-24 23:55:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:55:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-24 23:55:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:25,544 INFO L225 Difference]: With dead ends: 117 [2023-11-24 23:55:25,544 INFO L226 Difference]: Without dead ends: 62 [2023-11-24 23:55:25,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:55:25,547 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:25,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 222 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-24 23:55:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2023-11-24 23:55:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.411764705882353) internal successors, (48), 47 states have internal predecessors, (48), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-24 23:55:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-24 23:55:25,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 17 [2023-11-24 23:55:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:25,560 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-24 23:55:25,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-24 23:55:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:55:25,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:25,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:25,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:55:25,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:25,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2101787197, now seen corresponding path program 1 times [2023-11-24 23:55:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:25,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925380677] [2023-11-24 23:55:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:25,783 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-24 23:55:25,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925380677] [2023-11-24 23:55:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925380677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:55:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981047425] [2023-11-24 23:55:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:25,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:25,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:25,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:25,786 INFO L87 Difference]: Start difference. First operand 60 states and 68 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:55:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:25,963 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2023-11-24 23:55:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:25,967 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-24 23:55:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:25,970 INFO L225 Difference]: With dead ends: 122 [2023-11-24 23:55:25,970 INFO L226 Difference]: Without dead ends: 64 [2023-11-24 23:55:25,973 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-24 23:55:25,980 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:25,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-24 23:55:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-24 23:55:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 49 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-24 23:55:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-11-24 23:55:25,990 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 17 [2023-11-24 23:55:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:25,990 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-11-24 23:55:25,990 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:55:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-11-24 23:55:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 23:55:25,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:25,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:55:25,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:25,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 487885568, now seen corresponding path program 1 times [2023-11-24 23:55:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238192081] [2023-11-24 23:55:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:26,089 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-24 23:55:26,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:26,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238192081] [2023-11-24 23:55:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238192081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:26,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:26,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:55:26,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127864415] [2023-11-24 23:55:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:26,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:55:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:55:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:55:26,094 INFO L87 Difference]: Start difference. First operand 64 states and 72 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, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:26,152 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-11-24 23:55:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:55:26,153 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, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-24 23:55:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:26,154 INFO L225 Difference]: With dead ends: 64 [2023-11-24 23:55:26,155 INFO L226 Difference]: Without dead ends: 63 [2023-11-24 23:55:26,155 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-24 23:55:26,156 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:26,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:55:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-24 23:55:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-24 23:55:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 48 states have internal predecessors, (49), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-24 23:55:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2023-11-24 23:55:26,167 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2023-11-24 23:55:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:26,167 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2023-11-24 23:55:26,167 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, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2023-11-24 23:55:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 23:55:26,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:26,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:26,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:55:26,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:26,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash 438438072, now seen corresponding path program 1 times [2023-11-24 23:55:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:26,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50940234] [2023-11-24 23:55:26,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:26,536 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-24 23:55:26,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50940234] [2023-11-24 23:55:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50940234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:55:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247117236] [2023-11-24 23:55:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:26,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:55:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:55:26,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:26,551 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:26,731 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2023-11-24 23:55:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:55:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-24 23:55:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:26,736 INFO L225 Difference]: With dead ends: 67 [2023-11-24 23:55:26,736 INFO L226 Difference]: Without dead ends: 66 [2023-11-24 23:55:26,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 23:55:26,739 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:26,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 213 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-24 23:55:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2023-11-24 23:55:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 46 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-24 23:55:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-11-24 23:55:26,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 22 [2023-11-24 23:55:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:26,771 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-11-24 23:55:26,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-11-24 23:55:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 23:55:26,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:26,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:26,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:55:26,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:26,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1397037677, now seen corresponding path program 1 times [2023-11-24 23:55:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777593811] [2023-11-24 23:55:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:27,295 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-24 23:55:27,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777593811] [2023-11-24 23:55:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777593811] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:27,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592220957] [2023-11-24 23:55:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:27,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:27,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:27,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:27,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:55:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:27,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 23:55:27,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:27,523 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-24 23:55:27,743 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-24 23:55:27,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:28,245 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-24 23:55:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592220957] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:55:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [969604303] [2023-11-24 23:55:28,268 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-11-24 23:55:28,268 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:28,274 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-24 23:55:28,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:55:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2023-11-24 23:55:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131164957] [2023-11-24 23:55:28,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:28,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-24 23:55:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-24 23:55:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2023-11-24 23:55:28,284 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 24 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-24 23:55:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:28,861 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2023-11-24 23:55:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 23:55:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-11-24 23:55:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:28,863 INFO L225 Difference]: With dead ends: 124 [2023-11-24 23:55:28,863 INFO L226 Difference]: Without dead ends: 65 [2023-11-24 23:55:28,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2023-11-24 23:55:28,865 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:28,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 342 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:55:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-24 23:55:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-24 23:55:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 48 states have internal predecessors, (49), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-24 23:55:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2023-11-24 23:55:28,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 27 [2023-11-24 23:55:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:28,878 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2023-11-24 23:55:28,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-24 23:55:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2023-11-24 23:55:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-24 23:55:28,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:28,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:28,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:29,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 23:55:29,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:29,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 769941483, now seen corresponding path program 2 times [2023-11-24 23:55:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400538646] [2023-11-24 23:55:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 23:55:30,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400538646] [2023-11-24 23:55:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400538646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193592670] [2023-11-24 23:55:30,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 23:55:30,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:30,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:30,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:30,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:55:30,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-24 23:55:30,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:55:30,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-24 23:55:30,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:30,555 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-24 23:55:31,124 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-24 23:55:31,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:33,126 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-24 23:55:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193592670] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:55:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835772956] [2023-11-24 23:55:33,130 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-11-24 23:55:33,130 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:33,130 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-24 23:55:33,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:55:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 21] total 48 [2023-11-24 23:55:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756821617] [2023-11-24 23:55:33,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:33,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-24 23:55:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-24 23:55:33,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2023-11-24 23:55:33,141 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 39 states have internal predecessors, (59), 14 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-24 23:55:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:34,511 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2023-11-24 23:55:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 23:55:34,512 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 39 states have internal predecessors, (59), 14 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 41 [2023-11-24 23:55:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:34,513 INFO L225 Difference]: With dead ends: 132 [2023-11-24 23:55:34,513 INFO L226 Difference]: Without dead ends: 69 [2023-11-24 23:55:34,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=524, Invalid=4168, Unknown=0, NotChecked=0, Total=4692 [2023-11-24 23:55:34,517 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 116 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:34,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 668 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-24 23:55:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-24 23:55:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-24 23:55:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 50 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-24 23:55:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2023-11-24 23:55:34,526 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 41 [2023-11-24 23:55:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:34,526 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2023-11-24 23:55:34,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 39 states have internal predecessors, (59), 14 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-24 23:55:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2023-11-24 23:55:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-24 23:55:34,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:34,529 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:34,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-24 23:55:34,736 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:34,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -448379287, now seen corresponding path program 3 times [2023-11-24 23:55:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316551995] [2023-11-24 23:55:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-24 23:55:36,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316551995] [2023-11-24 23:55:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316551995] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666685415] [2023-11-24 23:55:36,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 23:55:36,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:36,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:36,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:36,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:55:36,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 23:55:36,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:55:36,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-24 23:55:36,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:36,643 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-24 23:55:37,375 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-24 23:55:37,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:41,491 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-24 23:55:41,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666685415] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:55:41,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1273397662] [2023-11-24 23:55:41,495 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-11-24 23:55:41,495 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:41,495 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-24 23:55:41,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:55:41,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 31] total 60 [2023-11-24 23:55:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557303207] [2023-11-24 23:55:41,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:41,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-24 23:55:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-24 23:55:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3062, Unknown=0, NotChecked=0, Total=3540 [2023-11-24 23:55:41,502 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 60 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 16 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-24 23:55:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:43,124 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2023-11-24 23:55:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-24 23:55:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 16 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 55 [2023-11-24 23:55:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:43,126 INFO L225 Difference]: With dead ends: 138 [2023-11-24 23:55:43,126 INFO L226 Difference]: Without dead ends: 71 [2023-11-24 23:55:43,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=806, Invalid=5836, Unknown=0, NotChecked=0, Total=6642 [2023-11-24 23:55:43,130 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 116 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:43,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 772 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 23:55:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-24 23:55:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-24 23:55:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.3) internal successors, (52), 51 states have internal predecessors, (52), 10 states have call successors, (10), 6 states have call predecessors, (10), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-24 23:55:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-24 23:55:43,150 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 55 [2023-11-24 23:55:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:43,154 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-24 23:55:43,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 16 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-24 23:55:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-24 23:55:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-24 23:55:43,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:43,159 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:43,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:43,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:43,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:43,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 466632546, now seen corresponding path program 4 times [2023-11-24 23:55:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:43,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113706076] [2023-11-24 23:55:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:48,098 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-24 23:55:48,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113706076] [2023-11-24 23:55:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113706076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695522790] [2023-11-24 23:55:48,098 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-24 23:55:48,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:48,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:48,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:48,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:55:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:48,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-24 23:55:48,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:48,335 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 830 treesize of output 822 [2023-11-24 23:55:48,379 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-24 23:55:48,398 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-24 23:55:48,597 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-24 23:55:48,610 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-24 23:55:48,667 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-24 23:55:49,359 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-24 23:55:49,467 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-24 23:55:51,028 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-24 23:55:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 94 trivial. 15 not checked. [2023-11-24 23:55:51,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695522790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1764587183] [2023-11-24 23:55:51,518 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-11-24 23:55:51,518 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:51,518 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-24 23:55:51,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:55:51,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 20 [2023-11-24 23:55:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819340872] [2023-11-24 23:55:51,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:51,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-24 23:55:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-24 23:55:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=12, NotChecked=126, Total=600 [2023-11-24 23:55:51,521 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-24 23:55:51,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse2 (select |c_#memory_int| .cse2)))))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from false [2023-11-24 23:55:51,997 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse2 (select |c_#memory_int| .cse2)))))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from true [2023-11-24 23:55:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:52,242 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-24 23:55:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 23:55:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2023-11-24 23:55:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:52,244 INFO L225 Difference]: With dead ends: 81 [2023-11-24 23:55:52,244 INFO L226 Difference]: Without dead ends: 77 [2023-11-24 23:55:52,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=152, Invalid=1110, Unknown=14, NotChecked=284, Total=1560 [2023-11-24 23:55:52,246 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 77 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:52,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 419 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 402 Invalid, 0 Unknown, 239 Unchecked, 0.4s Time] [2023-11-24 23:55:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-24 23:55:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-24 23:55:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 55 states have internal predecessors, (57), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (18), 14 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-24 23:55:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-24 23:55:52,261 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 62 [2023-11-24 23:55:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:52,262 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-24 23:55:52,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-24 23:55:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-24 23:55:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-24 23:55:52,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:52,268 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, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:52,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:52,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:55:52,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1343272550, now seen corresponding path program 1 times [2023-11-24 23:55:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74482530] [2023-11-24 23:55:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:56,420 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-24 23:55:56,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74482530] [2023-11-24 23:55:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74482530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816240456] [2023-11-24 23:55:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:56,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:56,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:56,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:55:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:56,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-24 23:55:56,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:56,677 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:55:56,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 133 [2023-11-24 23:55:57,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:55:57,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 23:55:57,492 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_63| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_63| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_63| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_63|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-24 23:55:57,501 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_63| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_63| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_63| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_63|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-24 23:55:57,544 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-24 23:55:59,549 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-24 23:55:59,669 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from false [2023-11-24 23:55:59,672 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from true [2023-11-24 23:55:59,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-24 23:55:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 98 trivial. 11 not checked. [2023-11-24 23:55:59,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816240456] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [745065076] [2023-11-24 23:56:00,305 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-11-24 23:56:00,306 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:00,306 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-24 23:56:00,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:56:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2023-11-24 23:56:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496486832] [2023-11-24 23:56:00,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:56:00,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-24 23:56:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-24 23:56:00,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1285, Unknown=14, NotChecked=222, Total=1640 [2023-11-24 23:56:00,311 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 27 states have internal predecessors, (47), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-24 23:56:01,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_63| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse2) (= (store |v_#memory_int_BEFORE_CALL_63| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_63| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_63|)))) .cse1))) is different from false [2023-11-24 23:56:01,085 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_63| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse2) (= (store |v_#memory_int_BEFORE_CALL_63| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_63| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_63|)))) .cse1))) is different from true [2023-11-24 23:56:01,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base)) (.cse1 (= c_func_to_recursive_line_26_to_27_0_~e.base c_func_to_recursive_line_26_to_27_0_~d.base))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) .cse0 (or (and .cse0 (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (= (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~d.base) (select |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~d.base))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|)) (or (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (not .cse1)))) is different from false [2023-11-24 23:56:01,119 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base)) (.cse1 (= c_func_to_recursive_line_26_to_27_0_~e.base c_func_to_recursive_line_26_to_27_0_~d.base))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) .cse0 (or (and .cse0 (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (= (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~d.base) (select |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~d.base))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_67| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_67| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_67|) (= (store |v_#memory_int_BEFORE_CALL_67| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|)) (or (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (not .cse1)))) is different from true [2023-11-24 23:56:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:01,869 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2023-11-24 23:56:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-24 23:56:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 27 states have internal predecessors, (47), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 72 [2023-11-24 23:56:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:01,871 INFO L225 Difference]: With dead ends: 159 [2023-11-24 23:56:01,871 INFO L226 Difference]: Without dead ends: 82 [2023-11-24 23:56:01,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=311, Invalid=3231, Unknown=18, NotChecked=600, Total=4160 [2023-11-24 23:56:01,874 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 118 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:01,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 487 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 686 Invalid, 0 Unknown, 285 Unchecked, 0.7s Time] [2023-11-24 23:56:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-24 23:56:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2023-11-24 23:56:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.25) internal successors, (60), 57 states have internal predecessors, (60), 11 states have call successors, (11), 8 states have call predecessors, (11), 14 states have return successors, (19), 15 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-24 23:56:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-11-24 23:56:01,885 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 72 [2023-11-24 23:56:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:01,886 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-11-24 23:56:01,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 27 states have internal predecessors, (47), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-24 23:56:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-11-24 23:56:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-24 23:56:01,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:01,888 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:01,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:02,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbc6e670-6286-4cdc-bfd4-49fa4ae3d065/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:02,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-24 23:56:02,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2060591059, now seen corresponding path program 1 times [2023-11-24 23:56:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:02,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927922611] [2023-11-24 23:56:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat