./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:13:29,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:13:29,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:13:29,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:13:29,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:13:29,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:13:29,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:13:29,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:13:29,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:13:29,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:13:29,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:13:29,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:13:29,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:13:29,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:13:29,661 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:13:29,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:13:29,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:13:29,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:13:29,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:13:29,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:13:29,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:13:29,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:13:29,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:13:29,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:13:29,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:13:29,664 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:13:29,665 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:13:29,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:13:29,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:13:29,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:13:29,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:13:29,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:13:29,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:13:29,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:13:29,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:13:29,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:13:29,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:13:29,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:13:29,668 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2024-10-14 21:13:29,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:13:29,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:13:29,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:13:29,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:13:29,893 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:13:29,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-10-14 21:13:31,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:13:31,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:13:31,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-10-14 21:13:31,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101de8ebc/3a5e6a5e079940b9b4b64cecc3ff6098/FLAGda2fe0c6b [2024-10-14 21:13:31,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101de8ebc/3a5e6a5e079940b9b4b64cecc3ff6098 [2024-10-14 21:13:31,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:13:31,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:13:31,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:13:31,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:13:31,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:13:31,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a9994c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31, skipping insertion in model container [2024-10-14 21:13:31,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:13:31,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:13:31,443 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:13:31,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:13:31,487 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:13:31,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31 WrapperNode [2024-10-14 21:13:31,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:13:31,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:13:31,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:13:31,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:13:31,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,548 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2024-10-14 21:13:31,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:13:31,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:13:31,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:13:31,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:13:31,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,584 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 21, 15, 11, 12, 5]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 2, 2, 2, 1]. [2024-10-14 21:13:31,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:13:31,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:13:31,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:13:31,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:13:31,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (1/1) ... [2024-10-14 21:13:31,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:13:31,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:31,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:13:31,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:13:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:13:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:13:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 21:13:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 21:13:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 21:13:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 21:13:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 21:13:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 21:13:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 21:13:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 21:13:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 21:13:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2024-10-14 21:13:31,685 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:13:31,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 21:13:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 21:13:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 21:13:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 21:13:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 21:13:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:13:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:13:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 21:13:31,803 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:13:31,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:13:32,475 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2024-10-14 21:13:32,475 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:13:32,503 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:13:32,504 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 21:13:32,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:32 BoogieIcfgContainer [2024-10-14 21:13:32,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:13:32,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:13:32,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:13:32,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:13:32,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:13:31" (1/3) ... [2024-10-14 21:13:32,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5973cb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:32, skipping insertion in model container [2024-10-14 21:13:32,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:31" (2/3) ... [2024-10-14 21:13:32,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5973cb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:32, skipping insertion in model container [2024-10-14 21:13:32,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:32" (3/3) ... [2024-10-14 21:13:32,511 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2024-10-14 21:13:32,523 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:13:32,523 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-10-14 21:13:32,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:13:32,581 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, 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;@15dc2fc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:13:32,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-10-14 21:13:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 158 states have (on average 1.8924050632911393) internal successors, (299), 297 states have internal predecessors, (299), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 21:13:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 21:13:32,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:32,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 21:13:32,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 370391600, now seen corresponding path program 1 times [2024-10-14 21:13:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652118797] [2024-10-14 21:13:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:33,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652118797] [2024-10-14 21:13:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652118797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:33,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:13:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570736963] [2024-10-14 21:13:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:33,084 INFO L87 Difference]: Start difference. First operand has 312 states, 158 states have (on average 1.8924050632911393) internal successors, (299), 297 states have internal predecessors, (299), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:33,293 INFO L93 Difference]: Finished difference Result 730 states and 784 transitions. [2024-10-14 21:13:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:33,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 21:13:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:33,305 INFO L225 Difference]: With dead ends: 730 [2024-10-14 21:13:33,306 INFO L226 Difference]: Without dead ends: 417 [2024-10-14 21:13:33,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:13:33,314 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 205 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:33,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1505 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-14 21:13:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 370. [2024-10-14 21:13:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8537735849056605) internal successors, (393), 350 states have internal predecessors, (393), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-10-14 21:13:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 428 transitions. [2024-10-14 21:13:33,378 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 428 transitions. Word has length 5 [2024-10-14 21:13:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:33,378 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 428 transitions. [2024-10-14 21:13:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 428 transitions. [2024-10-14 21:13:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 21:13:33,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:33,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:33,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:13:33,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2009196607, now seen corresponding path program 1 times [2024-10-14 21:13:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253257880] [2024-10-14 21:13:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:13:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253257880] [2024-10-14 21:13:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253257880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:33,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:13:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389810086] [2024-10-14 21:13:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:33,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:33,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:33,570 INFO L87 Difference]: Start difference. First operand 370 states and 428 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, (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) [2024-10-14 21:13:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:33,775 INFO L93 Difference]: Finished difference Result 417 states and 433 transitions. [2024-10-14 21:13:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:33,776 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, (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 15 [2024-10-14 21:13:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:33,777 INFO L225 Difference]: With dead ends: 417 [2024-10-14 21:13:33,778 INFO L226 Difference]: Without dead ends: 413 [2024-10-14 21:13:33,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:13:33,779 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 200 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:33,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1472 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:13:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-14 21:13:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 370. [2024-10-14 21:13:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8349056603773586) internal successors, (389), 350 states have internal predecessors, (389), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-10-14 21:13:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 424 transitions. [2024-10-14 21:13:33,795 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 424 transitions. Word has length 15 [2024-10-14 21:13:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 424 transitions. [2024-10-14 21:13:33,795 INFO L472 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, (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) [2024-10-14 21:13:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 424 transitions. [2024-10-14 21:13:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 21:13:33,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:33,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:33,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:13:33,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:33,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2015087747, now seen corresponding path program 1 times [2024-10-14 21:13:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319357282] [2024-10-14 21:13:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:13:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319357282] [2024-10-14 21:13:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319357282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:13:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877518493] [2024-10-14 21:13:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:33,920 INFO L87 Difference]: Start difference. First operand 370 states and 424 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-14 21:13:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:34,072 INFO L93 Difference]: Finished difference Result 413 states and 429 transitions. [2024-10-14 21:13:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:34,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 19 [2024-10-14 21:13:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:34,075 INFO L225 Difference]: With dead ends: 413 [2024-10-14 21:13:34,075 INFO L226 Difference]: Without dead ends: 411 [2024-10-14 21:13:34,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:13:34,076 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 186 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:34,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1474 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-14 21:13:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 370. [2024-10-14 21:13:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8254716981132075) internal successors, (387), 350 states have internal predecessors, (387), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-10-14 21:13:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 422 transitions. [2024-10-14 21:13:34,090 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 422 transitions. Word has length 19 [2024-10-14 21:13:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:34,090 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 422 transitions. [2024-10-14 21:13:34,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-14 21:13:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 422 transitions. [2024-10-14 21:13:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 21:13:34,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:34,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:34,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:13:34,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:34,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -530923867, now seen corresponding path program 1 times [2024-10-14 21:13:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:34,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191964538] [2024-10-14 21:13:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:34,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:13:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191964538] [2024-10-14 21:13:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191964538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:34,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:13:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718768514] [2024-10-14 21:13:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:34,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:34,217 INFO L87 Difference]: Start difference. First operand 370 states and 422 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-10-14 21:13:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:34,396 INFO L93 Difference]: Finished difference Result 411 states and 427 transitions. [2024-10-14 21:13:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 21 [2024-10-14 21:13:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:34,398 INFO L225 Difference]: With dead ends: 411 [2024-10-14 21:13:34,399 INFO L226 Difference]: Without dead ends: 409 [2024-10-14 21:13:34,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:13:34,400 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 181 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:34,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1750 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-14 21:13:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 370. [2024-10-14 21:13:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8160377358490567) internal successors, (385), 350 states have internal predecessors, (385), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-10-14 21:13:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 420 transitions. [2024-10-14 21:13:34,411 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 420 transitions. Word has length 21 [2024-10-14 21:13:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:34,412 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 420 transitions. [2024-10-14 21:13:34,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-10-14 21:13:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 420 transitions. [2024-10-14 21:13:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 21:13:34,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:34,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:34,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:13:34,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:34,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash 721229366, now seen corresponding path program 1 times [2024-10-14 21:13:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:34,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580915302] [2024-10-14 21:13:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:13:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:34,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580915302] [2024-10-14 21:13:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580915302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:13:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001123551] [2024-10-14 21:13:34,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:34,501 INFO L87 Difference]: Start difference. First operand 370 states and 420 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-10-14 21:13:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:34,620 INFO L93 Difference]: Finished difference Result 409 states and 425 transitions. [2024-10-14 21:13:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 22 [2024-10-14 21:13:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:34,621 INFO L225 Difference]: With dead ends: 409 [2024-10-14 21:13:34,621 INFO L226 Difference]: Without dead ends: 407 [2024-10-14 21:13:34,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:13:34,622 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 175 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:34,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1476 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-14 21:13:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 370. [2024-10-14 21:13:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8066037735849056) internal successors, (383), 350 states have internal predecessors, (383), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-10-14 21:13:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 418 transitions. [2024-10-14 21:13:34,630 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 418 transitions. Word has length 22 [2024-10-14 21:13:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:34,631 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 418 transitions. [2024-10-14 21:13:34,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-10-14 21:13:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 418 transitions. [2024-10-14 21:13:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 21:13:34,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:34,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:34,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:13:34,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:34,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash 133250338, now seen corresponding path program 1 times [2024-10-14 21:13:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623392432] [2024-10-14 21:13:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:13:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450184682] [2024-10-14 21:13:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:34,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:34,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:13:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:34,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 21:13:34,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:34,771 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 [2024-10-14 21:13:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:13:34,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623392432] [2024-10-14 21:13:34,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:13:34,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450184682] [2024-10-14 21:13:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450184682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:34,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:13:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290456793] [2024-10-14 21:13:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:34,890 INFO L87 Difference]: Start difference. First operand 370 states and 418 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:13:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:35,060 INFO L93 Difference]: Finished difference Result 589 states and 608 transitions. [2024-10-14 21:13:35,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:35,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-14 21:13:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:35,062 INFO L225 Difference]: With dead ends: 589 [2024-10-14 21:13:35,063 INFO L226 Difference]: Without dead ends: 585 [2024-10-14 21:13:35,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:13:35,063 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 344 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:35,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1646 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-14 21:13:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 452. [2024-10-14 21:13:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8159722222222223) internal successors, (523), 426 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:13:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 568 transitions. [2024-10-14 21:13:35,073 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 568 transitions. Word has length 31 [2024-10-14 21:13:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:35,073 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 568 transitions. [2024-10-14 21:13:35,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:13:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 568 transitions. [2024-10-14 21:13:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:13:35,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:35,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:35,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:35,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 21:13:35,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:13:35,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1037075609, now seen corresponding path program 1 times [2024-10-14 21:13:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652613730] [2024-10-14 21:13:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:13:35,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150930769] [2024-10-14 21:13:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:35,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:35,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:35,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:13:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 21:13:35,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:35,412 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 15 treesize of output 1 [2024-10-14 21:13:35,418 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 [2024-10-14 21:13:35,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 21:13:35,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2024-10-14 21:13:35,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 21:13:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:13:35,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652613730] [2024-10-14 21:13:35,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:13:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150930769] [2024-10-14 21:13:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150930769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:35,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-14 21:13:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230517520] [2024-10-14 21:13:35,941 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 21:13:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 21:13:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:13:35,943 INFO L87 Difference]: Start difference. First operand 452 states and 568 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:13:40,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:13:44,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:13:48,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:13:52,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:13:56,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:14:00,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:14:04,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:14:08,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:14:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:08,654 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2024-10-14 21:14:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 21:14:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-10-14 21:14:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:08,656 INFO L225 Difference]: With dead ends: 593 [2024-10-14 21:14:08,656 INFO L226 Difference]: Without dead ends: 592 [2024-10-14 21:14:08,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-14 21:14:08,657 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 630 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 34 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:08,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 2254 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 587 Invalid, 8 Unknown, 0 Unchecked, 32.5s Time] [2024-10-14 21:14:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-14 21:14:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 452. [2024-10-14 21:14:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8125) internal successors, (522), 426 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 567 transitions. [2024-10-14 21:14:08,671 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 567 transitions. Word has length 41 [2024-10-14 21:14:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 567 transitions. [2024-10-14 21:14:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:14:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 567 transitions. [2024-10-14 21:14:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 21:14:08,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:08,675 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:08,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:14:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 21:14:08,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2084572886, now seen corresponding path program 1 times [2024-10-14 21:14:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820291715] [2024-10-14 21:14:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654092134] [2024-10-14 21:14:08,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:08,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:08,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:08,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:08,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:14:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:08,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 21:14:08,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:08,985 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 [2024-10-14 21:14:08,989 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 [2024-10-14 21:14:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:14:09,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820291715] [2024-10-14 21:14:09,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:14:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654092134] [2024-10-14 21:14:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654092134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:09,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:14:09,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-14 21:14:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14804405] [2024-10-14 21:14:09,463 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:14:09,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:14:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:14:09,464 INFO L87 Difference]: Start difference. First operand 452 states and 567 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:14:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:09,898 INFO L93 Difference]: Finished difference Result 592 states and 611 transitions. [2024-10-14 21:14:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:14:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-10-14 21:14:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:09,900 INFO L225 Difference]: With dead ends: 592 [2024-10-14 21:14:09,900 INFO L226 Difference]: Without dead ends: 591 [2024-10-14 21:14:09,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:14:09,901 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 511 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:09,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1857 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:14:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-14 21:14:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 452. [2024-10-14 21:14:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8090277777777777) internal successors, (521), 426 states have internal predecessors, (521), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 566 transitions. [2024-10-14 21:14:09,912 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 566 transitions. Word has length 42 [2024-10-14 21:14:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:09,912 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 566 transitions. [2024-10-14 21:14:09,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:14:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 566 transitions. [2024-10-14 21:14:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 21:14:09,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:09,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:09,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:14:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:10,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash 197250107, now seen corresponding path program 1 times [2024-10-14 21:14:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504893147] [2024-10-14 21:14:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:10,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504893147] [2024-10-14 21:14:10,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504893147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303663393] [2024-10-14 21:14:10,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:10,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:10,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:10,255 INFO L87 Difference]: Start difference. First operand 452 states and 566 transitions. Second operand has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:10,445 INFO L93 Difference]: Finished difference Result 559 states and 579 transitions. [2024-10-14 21:14:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:10,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-14 21:14:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:10,447 INFO L225 Difference]: With dead ends: 559 [2024-10-14 21:14:10,447 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 21:14:10,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:10,448 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 313 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:10,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1424 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:14:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 21:14:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 452. [2024-10-14 21:14:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8020833333333333) internal successors, (519), 426 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 564 transitions. [2024-10-14 21:14:10,462 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 564 transitions. Word has length 43 [2024-10-14 21:14:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 564 transitions. [2024-10-14 21:14:10,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 564 transitions. [2024-10-14 21:14:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:14:10,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:10,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 21:14:10,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 578794461, now seen corresponding path program 1 times [2024-10-14 21:14:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504848630] [2024-10-14 21:14:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504848630] [2024-10-14 21:14:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504848630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:10,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:10,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:14:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286273187] [2024-10-14 21:14:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:10,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:14:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:14:10,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:14:10,615 INFO L87 Difference]: Start difference. First operand 452 states and 564 transitions. Second operand has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:10,926 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2024-10-14 21:14:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:14:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-14 21:14:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:10,929 INFO L225 Difference]: With dead ends: 557 [2024-10-14 21:14:10,929 INFO L226 Difference]: Without dead ends: 556 [2024-10-14 21:14:10,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:14:10,930 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 309 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:10,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1687 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:14:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-14 21:14:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 452. [2024-10-14 21:14:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7986111111111112) internal successors, (518), 426 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 563 transitions. [2024-10-14 21:14:10,943 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 563 transitions. Word has length 45 [2024-10-14 21:14:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:10,944 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 563 transitions. [2024-10-14 21:14:10,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 563 transitions. [2024-10-14 21:14:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 21:14:10,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:10,945 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:10,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 21:14:10,945 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 762759194, now seen corresponding path program 1 times [2024-10-14 21:14:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391603332] [2024-10-14 21:14:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:10,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391603332] [2024-10-14 21:14:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391603332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:11,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:11,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121167772] [2024-10-14 21:14:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:11,142 INFO L87 Difference]: Start difference. First operand 452 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:11,451 INFO L93 Difference]: Finished difference Result 556 states and 576 transitions. [2024-10-14 21:14:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:11,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-10-14 21:14:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:11,453 INFO L225 Difference]: With dead ends: 556 [2024-10-14 21:14:11,453 INFO L226 Difference]: Without dead ends: 555 [2024-10-14 21:14:11,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:11,454 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 306 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:11,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1424 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:14:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-14 21:14:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 452. [2024-10-14 21:14:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7951388888888888) internal successors, (517), 426 states have internal predecessors, (517), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 562 transitions. [2024-10-14 21:14:11,464 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 562 transitions. Word has length 46 [2024-10-14 21:14:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:11,465 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 562 transitions. [2024-10-14 21:14:11,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 562 transitions. [2024-10-14 21:14:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 21:14:11,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:11,467 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 21:14:11,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:11,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2124268673, now seen corresponding path program 1 times [2024-10-14 21:14:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:11,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468817270] [2024-10-14 21:14:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468817270] [2024-10-14 21:14:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468817270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010719048] [2024-10-14 21:14:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:11,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:11,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:11,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:11,604 INFO L87 Difference]: Start difference. First operand 452 states and 562 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:11,768 INFO L93 Difference]: Finished difference Result 567 states and 587 transitions. [2024-10-14 21:14:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-14 21:14:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:11,770 INFO L225 Difference]: With dead ends: 567 [2024-10-14 21:14:11,771 INFO L226 Difference]: Without dead ends: 565 [2024-10-14 21:14:11,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:11,772 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 311 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:11,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1416 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-14 21:14:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 452. [2024-10-14 21:14:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7881944444444444) internal successors, (515), 426 states have internal predecessors, (515), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 560 transitions. [2024-10-14 21:14:11,790 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 560 transitions. Word has length 47 [2024-10-14 21:14:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:11,791 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 560 transitions. [2024-10-14 21:14:11,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 560 transitions. [2024-10-14 21:14:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 21:14:11,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:11,792 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:11,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 21:14:11,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1312726239, now seen corresponding path program 1 times [2024-10-14 21:14:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215124845] [2024-10-14 21:14:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701152113] [2024-10-14 21:14:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:11,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:11,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:11,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:11,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:14:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:11,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 21:14:11,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:11,891 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 [2024-10-14 21:14:11,895 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 [2024-10-14 21:14:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:14:12,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215124845] [2024-10-14 21:14:13,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:14:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701152113] [2024-10-14 21:14:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701152113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:13,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:14:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-10-14 21:14:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422198914] [2024-10-14 21:14:13,016 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:13,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 21:14:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 21:14:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:14:13,017 INFO L87 Difference]: Start difference. First operand 452 states and 560 transitions. Second operand has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:14:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:14,528 INFO L93 Difference]: Finished difference Result 585 states and 604 transitions. [2024-10-14 21:14:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:14:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-14 21:14:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:14,530 INFO L225 Difference]: With dead ends: 585 [2024-10-14 21:14:14,530 INFO L226 Difference]: Without dead ends: 583 [2024-10-14 21:14:14,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 21:14:14,530 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 721 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 3779 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:14,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 3779 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 21:14:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-14 21:14:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 452. [2024-10-14 21:14:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.78125) internal successors, (513), 426 states have internal predecessors, (513), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 558 transitions. [2024-10-14 21:14:14,544 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 558 transitions. Word has length 49 [2024-10-14 21:14:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:14,544 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 558 transitions. [2024-10-14 21:14:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:14:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 558 transitions. [2024-10-14 21:14:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 21:14:14,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:14,545 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:14,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 21:14:14,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:14,750 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:14,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1190472387, now seen corresponding path program 1 times [2024-10-14 21:14:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133726344] [2024-10-14 21:14:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:14,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133726344] [2024-10-14 21:14:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133726344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297348017] [2024-10-14 21:14:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:14,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:14,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:14,897 INFO L87 Difference]: Start difference. First operand 452 states and 558 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:15,069 INFO L93 Difference]: Finished difference Result 575 states and 595 transitions. [2024-10-14 21:14:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-14 21:14:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:15,071 INFO L225 Difference]: With dead ends: 575 [2024-10-14 21:14:15,071 INFO L226 Difference]: Without dead ends: 573 [2024-10-14 21:14:15,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:15,071 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 309 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:15,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1409 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-10-14 21:14:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 452. [2024-10-14 21:14:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7743055555555556) internal successors, (511), 426 states have internal predecessors, (511), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 556 transitions. [2024-10-14 21:14:15,082 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 556 transitions. Word has length 51 [2024-10-14 21:14:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:15,083 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 556 transitions. [2024-10-14 21:14:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 556 transitions. [2024-10-14 21:14:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 21:14:15,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:15,084 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 21:14:15,084 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1582666341, now seen corresponding path program 1 times [2024-10-14 21:14:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473574314] [2024-10-14 21:14:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473574314] [2024-10-14 21:14:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473574314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:14:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749485971] [2024-10-14 21:14:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:15,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:14:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:14:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:14:15,229 INFO L87 Difference]: Start difference. First operand 452 states and 556 transitions. Second operand has 7 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:15,537 INFO L93 Difference]: Finished difference Result 573 states and 593 transitions. [2024-10-14 21:14:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:14:15,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-14 21:14:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:15,540 INFO L225 Difference]: With dead ends: 573 [2024-10-14 21:14:15,540 INFO L226 Difference]: Without dead ends: 571 [2024-10-14 21:14:15,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:14:15,541 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 303 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:15,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1645 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:14:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-14 21:14:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 452. [2024-10-14 21:14:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7673611111111112) internal successors, (509), 426 states have internal predecessors, (509), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 554 transitions. [2024-10-14 21:14:15,554 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 554 transitions. Word has length 53 [2024-10-14 21:14:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:15,554 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 554 transitions. [2024-10-14 21:14:15,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 554 transitions. [2024-10-14 21:14:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 21:14:15,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:15,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:15,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 21:14:15,555 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:15,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1818016418, now seen corresponding path program 1 times [2024-10-14 21:14:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498283670] [2024-10-14 21:14:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498283670] [2024-10-14 21:14:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498283670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:14:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495249148] [2024-10-14 21:14:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:14:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:14:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:14:15,787 INFO L87 Difference]: Start difference. First operand 452 states and 554 transitions. Second operand has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:16,104 INFO L93 Difference]: Finished difference Result 559 states and 579 transitions. [2024-10-14 21:14:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:14:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-10-14 21:14:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:16,106 INFO L225 Difference]: With dead ends: 559 [2024-10-14 21:14:16,106 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 21:14:16,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:14:16,106 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 293 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:16,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1589 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:14:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 21:14:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 452. [2024-10-14 21:14:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7604166666666667) internal successors, (507), 426 states have internal predecessors, (507), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 552 transitions. [2024-10-14 21:14:16,118 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 552 transitions. Word has length 54 [2024-10-14 21:14:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:16,118 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 552 transitions. [2024-10-14 21:14:16,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:14:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 552 transitions. [2024-10-14 21:14:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 21:14:16,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:16,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:16,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 21:14:16,119 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:16,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 653631038, now seen corresponding path program 1 times [2024-10-14 21:14:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882099941] [2024-10-14 21:14:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829382558] [2024-10-14 21:14:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:16,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:16,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:16,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:16,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 21:14:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:16,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 21:14:16,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:16,250 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 [2024-10-14 21:14:16,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-14 21:14:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:16,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882099941] [2024-10-14 21:14:16,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:14:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829382558] [2024-10-14 21:14:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829382558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:16,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:14:16,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-14 21:14:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132758281] [2024-10-14 21:14:16,492 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:16,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 21:14:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 21:14:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 21:14:16,493 INFO L87 Difference]: Start difference. First operand 452 states and 552 transitions. Second operand has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:14:20,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:14:24,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:14:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:24,973 INFO L93 Difference]: Finished difference Result 581 states and 600 transitions. [2024-10-14 21:14:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 21:14:24,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2024-10-14 21:14:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:24,975 INFO L225 Difference]: With dead ends: 581 [2024-10-14 21:14:24,975 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 21:14:24,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-14 21:14:24,976 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 382 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:24,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2634 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 547 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-10-14 21:14:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 21:14:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 452. [2024-10-14 21:14:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7569444444444444) internal successors, (506), 426 states have internal predecessors, (506), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 551 transitions. [2024-10-14 21:14:25,001 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 551 transitions. Word has length 63 [2024-10-14 21:14:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:25,001 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 551 transitions. [2024-10-14 21:14:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:14:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 551 transitions. [2024-10-14 21:14:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 21:14:25,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:25,002 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:25,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 21:14:25,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 21:14:25,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:25,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1212274189, now seen corresponding path program 1 times [2024-10-14 21:14:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098946656] [2024-10-14 21:14:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094932578] [2024-10-14 21:14:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:25,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:25,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:25,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:25,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:14:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:25,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 21:14:25,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:25,320 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 [2024-10-14 21:14:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:25,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098946656] [2024-10-14 21:14:25,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:14:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094932578] [2024-10-14 21:14:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094932578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:25,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:14:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-14 21:14:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288112586] [2024-10-14 21:14:25,681 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 21:14:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:25,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 21:14:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 21:14:25,682 INFO L87 Difference]: Start difference. First operand 452 states and 551 transitions. Second operand has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:14:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:26,222 INFO L93 Difference]: Finished difference Result 580 states and 599 transitions. [2024-10-14 21:14:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 21:14:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2024-10-14 21:14:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:26,224 INFO L225 Difference]: With dead ends: 580 [2024-10-14 21:14:26,225 INFO L226 Difference]: Without dead ends: 579 [2024-10-14 21:14:26,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-14 21:14:26,225 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 378 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:26,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2639 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:14:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-14 21:14:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 452. [2024-10-14 21:14:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7534722222222223) internal successors, (505), 426 states have internal predecessors, (505), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 550 transitions. [2024-10-14 21:14:26,236 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 550 transitions. Word has length 64 [2024-10-14 21:14:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:26,236 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 550 transitions. [2024-10-14 21:14:26,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:14:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 550 transitions. [2024-10-14 21:14:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 21:14:26,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:26,238 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:26,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:14:26,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 21:14:26,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1074205920, now seen corresponding path program 1 times [2024-10-14 21:14:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335420080] [2024-10-14 21:14:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:14:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335420080] [2024-10-14 21:14:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335420080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:26,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:26,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113776834] [2024-10-14 21:14:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:26,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:26,561 INFO L87 Difference]: Start difference. First operand 452 states and 550 transitions. Second operand has 6 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:14:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:26,752 INFO L93 Difference]: Finished difference Result 555 states and 575 transitions. [2024-10-14 21:14:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2024-10-14 21:14:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:26,754 INFO L225 Difference]: With dead ends: 555 [2024-10-14 21:14:26,754 INFO L226 Difference]: Without dead ends: 553 [2024-10-14 21:14:26,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:26,755 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 274 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:26,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1416 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:14:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-14 21:14:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 452. [2024-10-14 21:14:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7465277777777777) internal successors, (503), 426 states have internal predecessors, (503), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 548 transitions. [2024-10-14 21:14:26,765 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 548 transitions. Word has length 65 [2024-10-14 21:14:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:26,765 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 548 transitions. [2024-10-14 21:14:26,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:14:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 548 transitions. [2024-10-14 21:14:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 21:14:26,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:26,765 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 21:14:26,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:26,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1519741826, now seen corresponding path program 1 times [2024-10-14 21:14:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:26,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315965965] [2024-10-14 21:14:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014181905] [2024-10-14 21:14:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:26,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:26,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:14:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:26,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 21:14:26,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:26,872 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 [2024-10-14 21:14:26,876 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 [2024-10-14 21:14:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:14:27,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:27,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-10-14 21:14:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 21:14:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315965965] [2024-10-14 21:14:27,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:14:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014181905] [2024-10-14 21:14:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014181905] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:14:27,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:14:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 21 [2024-10-14 21:14:27,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563045760] [2024-10-14 21:14:27,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 21:14:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 21:14:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-10-14 21:14:27,684 INFO L87 Difference]: Start difference. First operand 452 states and 548 transitions. Second operand has 22 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:14:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:28,862 INFO L93 Difference]: Finished difference Result 573 states and 592 transitions. [2024-10-14 21:14:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 21:14:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2024-10-14 21:14:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:28,864 INFO L225 Difference]: With dead ends: 573 [2024-10-14 21:14:28,866 INFO L226 Difference]: Without dead ends: 571 [2024-10-14 21:14:28,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 21:14:28,867 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 834 mSDsluCounter, 3668 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:28,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 3923 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 21:14:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-14 21:14:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 452. [2024-10-14 21:14:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7395833333333333) internal successors, (501), 426 states have internal predecessors, (501), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 546 transitions. [2024-10-14 21:14:28,880 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 546 transitions. Word has length 67 [2024-10-14 21:14:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:28,880 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 546 transitions. [2024-10-14 21:14:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:14:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 546 transitions. [2024-10-14 21:14:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 21:14:28,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:28,881 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:28,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:14:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:29,084 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:29,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 183018020, now seen corresponding path program 1 times [2024-10-14 21:14:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928616450] [2024-10-14 21:14:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:14:29,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:29,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928616450] [2024-10-14 21:14:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928616450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:29,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:29,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467584549] [2024-10-14 21:14:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:29,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:29,212 INFO L87 Difference]: Start difference. First operand 452 states and 546 transitions. Second operand has 6 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:14:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:29,384 INFO L93 Difference]: Finished difference Result 563 states and 583 transitions. [2024-10-14 21:14:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:29,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2024-10-14 21:14:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:29,386 INFO L225 Difference]: With dead ends: 563 [2024-10-14 21:14:29,386 INFO L226 Difference]: Without dead ends: 561 [2024-10-14 21:14:29,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:29,387 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 272 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:29,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1408 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-14 21:14:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 452. [2024-10-14 21:14:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7326388888888888) internal successors, (499), 426 states have internal predecessors, (499), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 544 transitions. [2024-10-14 21:14:29,399 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 544 transitions. Word has length 69 [2024-10-14 21:14:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:29,399 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 544 transitions. [2024-10-14 21:14:29,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:14:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 544 transitions. [2024-10-14 21:14:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 21:14:29,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:29,400 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 21:14:29,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:29,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -213337914, now seen corresponding path program 1 times [2024-10-14 21:14:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109567027] [2024-10-14 21:14:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:29,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221884730] [2024-10-14 21:14:29,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:29,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:29,420 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:29,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:14:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:29,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 21:14:29,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:29,515 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 [2024-10-14 21:14:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:14:30,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109567027] [2024-10-14 21:14:30,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:14:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221884730] [2024-10-14 21:14:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221884730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:30,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:14:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-10-14 21:14:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609887776] [2024-10-14 21:14:30,369 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 21:14:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 21:14:30,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2024-10-14 21:14:30,370 INFO L87 Difference]: Start difference. First operand 452 states and 544 transitions. Second operand has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:14:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:31,509 INFO L93 Difference]: Finished difference Result 573 states and 592 transitions. [2024-10-14 21:14:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:14:31,511 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2024-10-14 21:14:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:31,513 INFO L225 Difference]: With dead ends: 573 [2024-10-14 21:14:31,513 INFO L226 Difference]: Without dead ends: 571 [2024-10-14 21:14:31,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 21:14:31,514 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 553 mSDsluCounter, 4207 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 4455 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:31,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 4455 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 21:14:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-14 21:14:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 452. [2024-10-14 21:14:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7256944444444444) internal successors, (497), 426 states have internal predecessors, (497), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 542 transitions. [2024-10-14 21:14:31,524 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 542 transitions. Word has length 71 [2024-10-14 21:14:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:31,524 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 542 transitions. [2024-10-14 21:14:31,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:14:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 542 transitions. [2024-10-14 21:14:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 21:14:31,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:31,525 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:31,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:14:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 21:14:31,725 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459387, now seen corresponding path program 1 times [2024-10-14 21:14:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280762369] [2024-10-14 21:14:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:14:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280762369] [2024-10-14 21:14:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280762369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:14:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232599441] [2024-10-14 21:14:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:32,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:14:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:14:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:14:32,004 INFO L87 Difference]: Start difference. First operand 452 states and 542 transitions. Second operand has 7 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:14:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:32,500 INFO L93 Difference]: Finished difference Result 547 states and 567 transitions. [2024-10-14 21:14:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:14:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 72 [2024-10-14 21:14:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:32,503 INFO L225 Difference]: With dead ends: 547 [2024-10-14 21:14:32,503 INFO L226 Difference]: Without dead ends: 545 [2024-10-14 21:14:32,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:14:32,504 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 256 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:32,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1603 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:14:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-14 21:14:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 452. [2024-10-14 21:14:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.71875) internal successors, (495), 426 states have internal predecessors, (495), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 540 transitions. [2024-10-14 21:14:32,514 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 540 transitions. Word has length 72 [2024-10-14 21:14:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:32,515 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 540 transitions. [2024-10-14 21:14:32,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:14:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 540 transitions. [2024-10-14 21:14:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 21:14:32,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:32,515 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:32,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 21:14:32,515 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:32,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1288863902, now seen corresponding path program 1 times [2024-10-14 21:14:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:32,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708417221] [2024-10-14 21:14:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:32,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 21:14:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708417221] [2024-10-14 21:14:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708417221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511539389] [2024-10-14 21:14:32,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:32,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:32,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:32,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:32,636 INFO L87 Difference]: Start difference. First operand 452 states and 540 transitions. Second operand has 6 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:32,729 INFO L93 Difference]: Finished difference Result 456 states and 544 transitions. [2024-10-14 21:14:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 82 [2024-10-14 21:14:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:32,732 INFO L225 Difference]: With dead ends: 456 [2024-10-14 21:14:32,732 INFO L226 Difference]: Without dead ends: 454 [2024-10-14 21:14:32,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:32,733 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 62 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:32,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1501 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-14 21:14:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-10-14 21:14:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 290 states have (on average 1.7137931034482758) internal successors, (497), 428 states have internal predecessors, (497), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 542 transitions. [2024-10-14 21:14:32,743 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 542 transitions. Word has length 82 [2024-10-14 21:14:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 542 transitions. [2024-10-14 21:14:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 542 transitions. [2024-10-14 21:14:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 21:14:32,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:32,745 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 21:14:32,745 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:32,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1647623996, now seen corresponding path program 1 times [2024-10-14 21:14:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620590159] [2024-10-14 21:14:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 21:14:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620590159] [2024-10-14 21:14:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620590159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222682538] [2024-10-14 21:14:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:32,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:32,958 INFO L87 Difference]: Start difference. First operand 454 states and 542 transitions. Second operand has 6 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:33,114 INFO L93 Difference]: Finished difference Result 531 states and 551 transitions. [2024-10-14 21:14:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2024-10-14 21:14:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:33,116 INFO L225 Difference]: With dead ends: 531 [2024-10-14 21:14:33,116 INFO L226 Difference]: Without dead ends: 529 [2024-10-14 21:14:33,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:33,117 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 209 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:33,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1420 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-14 21:14:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 456. [2024-10-14 21:14:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 292 states have (on average 1.7089041095890412) internal successors, (499), 430 states have internal predecessors, (499), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-14 21:14:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 544 transitions. [2024-10-14 21:14:33,131 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 544 transitions. Word has length 84 [2024-10-14 21:14:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:33,132 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 544 transitions. [2024-10-14 21:14:33,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 544 transitions. [2024-10-14 21:14:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 21:14:33,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:33,133 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:33,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 21:14:33,133 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:33,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 463128962, now seen corresponding path program 1 times [2024-10-14 21:14:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464771171] [2024-10-14 21:14:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:14:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:14:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 21:14:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:14:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 21:14:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 21:14:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464771171] [2024-10-14 21:14:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464771171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:33,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:33,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:33,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728680742] [2024-10-14 21:14:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:33,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:33,266 INFO L87 Difference]: Start difference. First operand 456 states and 544 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 21:14:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:33,400 INFO L93 Difference]: Finished difference Result 462 states and 546 transitions. [2024-10-14 21:14:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:14:33,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2024-10-14 21:14:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:33,402 INFO L225 Difference]: With dead ends: 462 [2024-10-14 21:14:33,402 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 21:14:33,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:33,403 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 165 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:33,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1023 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 21:14:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-10-14 21:14:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 293 states have (on average 1.6928327645051195) internal successors, (496), 431 states have internal predecessors, (496), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-10-14 21:14:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 542 transitions. [2024-10-14 21:14:33,414 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 542 transitions. Word has length 85 [2024-10-14 21:14:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 542 transitions. [2024-10-14 21:14:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 21:14:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 542 transitions. [2024-10-14 21:14:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 21:14:33,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:33,415 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:33,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 21:14:33,415 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1476276774, now seen corresponding path program 1 times [2024-10-14 21:14:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:33,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39593017] [2024-10-14 21:14:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 21:14:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39593017] [2024-10-14 21:14:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39593017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:33,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:33,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:33,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544418864] [2024-10-14 21:14:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:33,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:33,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:33,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:33,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:33,618 INFO L87 Difference]: Start difference. First operand 458 states and 542 transitions. Second operand has 6 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:33,828 INFO L93 Difference]: Finished difference Result 539 states and 559 transitions. [2024-10-14 21:14:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:33,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2024-10-14 21:14:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:33,830 INFO L225 Difference]: With dead ends: 539 [2024-10-14 21:14:33,830 INFO L226 Difference]: Without dead ends: 537 [2024-10-14 21:14:33,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:33,830 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 215 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:33,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1390 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:14:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-14 21:14:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 460. [2024-10-14 21:14:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 295 states have (on average 1.688135593220339) internal successors, (498), 433 states have internal predecessors, (498), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-10-14 21:14:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 544 transitions. [2024-10-14 21:14:33,846 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 544 transitions. Word has length 86 [2024-10-14 21:14:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 544 transitions. [2024-10-14 21:14:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 544 transitions. [2024-10-14 21:14:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 21:14:33,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:33,848 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 21:14:33,848 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1362776968, now seen corresponding path program 1 times [2024-10-14 21:14:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152491336] [2024-10-14 21:14:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 21:14:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152491336] [2024-10-14 21:14:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152491336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:14:33,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:14:33,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:14:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575761675] [2024-10-14 21:14:33,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:14:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:14:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:14:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:14:33,980 INFO L87 Difference]: Start difference. First operand 460 states and 544 transitions. Second operand has 6 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:34,126 INFO L93 Difference]: Finished difference Result 549 states and 569 transitions. [2024-10-14 21:14:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:14:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 88 [2024-10-14 21:14:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:34,128 INFO L225 Difference]: With dead ends: 549 [2024-10-14 21:14:34,128 INFO L226 Difference]: Without dead ends: 547 [2024-10-14 21:14:34,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:14:34,128 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 225 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:34,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1436 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:14:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-14 21:14:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 462. [2024-10-14 21:14:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 297 states have (on average 1.6835016835016836) internal successors, (500), 435 states have internal predecessors, (500), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-10-14 21:14:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 546 transitions. [2024-10-14 21:14:34,141 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 546 transitions. Word has length 88 [2024-10-14 21:14:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:34,141 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 546 transitions. [2024-10-14 21:14:34,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 21:14:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 546 transitions. [2024-10-14 21:14:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 21:14:34,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:34,142 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:34,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 21:14:34,142 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:34,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash -158992640, now seen corresponding path program 1 times [2024-10-14 21:14:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:34,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211745454] [2024-10-14 21:14:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 21:14:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211745454] [2024-10-14 21:14:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211745454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902677443] [2024-10-14 21:14:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:34,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:34,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:14:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:34,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 21:14:34,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:34,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2024-10-14 21:14:34,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 21:14:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:34,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902677443] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:14:34,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:14:34,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2024-10-14 21:14:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233437082] [2024-10-14 21:14:34,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:34,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 21:14:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:34,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 21:14:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-10-14 21:14:34,989 INFO L87 Difference]: Start difference. First operand 462 states and 546 transitions. Second operand has 21 states, 19 states have (on average 10.631578947368421) internal successors, (202), 17 states have internal predecessors, (202), 7 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 21:14:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:35,402 INFO L93 Difference]: Finished difference Result 465 states and 553 transitions. [2024-10-14 21:14:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 21:14:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 10.631578947368421) internal successors, (202), 17 states have internal predecessors, (202), 7 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 93 [2024-10-14 21:14:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:35,404 INFO L225 Difference]: With dead ends: 465 [2024-10-14 21:14:35,404 INFO L226 Difference]: Without dead ends: 462 [2024-10-14 21:14:35,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 174 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-10-14 21:14:35,405 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 884 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:35,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 3850 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:14:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-14 21:14:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2024-10-14 21:14:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 297 states have (on average 1.6734006734006734) internal successors, (497), 432 states have internal predecessors, (497), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-10-14 21:14:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 543 transitions. [2024-10-14 21:14:35,417 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 543 transitions. Word has length 93 [2024-10-14 21:14:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:35,417 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 543 transitions. [2024-10-14 21:14:35,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 10.631578947368421) internal successors, (202), 17 states have internal predecessors, (202), 7 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 21:14:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 543 transitions. [2024-10-14 21:14:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 21:14:35,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:35,418 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:35,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:14:35,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-14 21:14:35,619 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:35,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -633804507, now seen corresponding path program 1 times [2024-10-14 21:14:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:35,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687991201] [2024-10-14 21:14:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:14:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:14:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:14:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 21:14:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 21:14:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:35,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:14:35,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687991201] [2024-10-14 21:14:35,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687991201] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:14:35,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114170905] [2024-10-14 21:14:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:35,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:35,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:35,890 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:35,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:14:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:14:36,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 21:14:36,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:14:36,017 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 [2024-10-14 21:14:36,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 21:14:36,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 21:14:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:36,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:14:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:14:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114170905] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:14:36,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:14:36,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 17 [2024-10-14 21:14:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824245688] [2024-10-14 21:14:36,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:14:36,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 21:14:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:14:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 21:14:36,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-14 21:14:36,412 INFO L87 Difference]: Start difference. First operand 459 states and 543 transitions. Second operand has 18 states, 16 states have (on average 9.25) internal successors, (148), 15 states have internal predecessors, (148), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 21:14:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:14:36,775 INFO L93 Difference]: Finished difference Result 667 states and 696 transitions. [2024-10-14 21:14:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:14:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.25) internal successors, (148), 15 states have internal predecessors, (148), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-14 21:14:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:14:36,777 INFO L225 Difference]: With dead ends: 667 [2024-10-14 21:14:36,777 INFO L226 Difference]: Without dead ends: 664 [2024-10-14 21:14:36,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 182 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2024-10-14 21:14:36,778 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 825 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:14:36,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 3240 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:14:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-14 21:14:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 523. [2024-10-14 21:14:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 354 states have (on average 1.6807909604519775) internal successors, (595), 488 states have internal predecessors, (595), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2024-10-14 21:14:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 657 transitions. [2024-10-14 21:14:36,792 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 657 transitions. Word has length 94 [2024-10-14 21:14:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:14:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 657 transitions. [2024-10-14 21:14:36,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.25) internal successors, (148), 15 states have internal predecessors, (148), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 21:14:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 657 transitions. [2024-10-14 21:14:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 21:14:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:14:36,793 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:36,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:14:36,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:36,995 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-10-14 21:14:36,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:14:36,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1981656873, now seen corresponding path program 1 times [2024-10-14 21:14:36,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:14:36,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027485388] [2024-10-14 21:14:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:36,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:14:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:14:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081343982] [2024-10-14 21:14:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:14:37,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:14:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:14:37,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:14:37,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:14:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 21:14:37,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 21:14:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 21:14:37,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 21:14:37,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 21:14:37,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-10-14 21:14:37,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-10-14 21:14:37,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-10-14 21:14:37,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-10-14 21:14:37,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-10-14 21:14:37,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-10-14 21:14:37,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-10-14 21:14:37,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-10-14 21:14:37,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-10-14 21:14:37,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-10-14 21:14:37,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-10-14 21:14:37,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-10-14 21:14:37,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-10-14 21:14:37,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-10-14 21:14:37,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-10-14 21:14:37,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-10-14 21:14:37,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-10-14 21:14:37,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-10-14 21:14:37,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-10-14 21:14:37,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-10-14 21:14:37,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-10-14 21:14:37,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-10-14 21:14:37,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-10-14 21:14:37,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:14:37,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-14 21:14:37,404 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:14:37,464 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:14:37,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:14:37 BoogieIcfgContainer [2024-10-14 21:14:37,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:14:37,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:14:37,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:14:37,468 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:14:37,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:32" (3/4) ... [2024-10-14 21:14:37,472 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 21:14:37,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:14:37,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:14:37,523 INFO L158 Benchmark]: Toolchain (without parser) took 66240.02ms. Allocated memory was 140.5MB in the beginning and 247.5MB in the end (delta: 107.0MB). Free memory was 84.4MB in the beginning and 165.2MB in the end (delta: -80.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 45.4MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.19ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 71.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.66ms. Allocated memory is still 140.5MB. Free memory was 71.4MB in the beginning and 110.4MB in the end (delta: -39.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: Boogie Preprocessor took 47.50ms. Allocated memory is still 140.5MB. Free memory was 110.4MB in the beginning and 108.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: RCFGBuilder took 903.32ms. Allocated memory is still 140.5MB. Free memory was 108.0MB in the beginning and 64.4MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: TraceAbstraction took 64961.35ms. Allocated memory was 140.5MB in the beginning and 247.5MB in the end (delta: 107.0MB). Free memory was 63.6MB in the beginning and 172.5MB in the end (delta: -108.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:14:37,524 INFO L158 Benchmark]: Witness Printer took 55.48ms. Allocated memory is still 247.5MB. Free memory was 172.5MB in the beginning and 165.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 21:14:37,525 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 45.4MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.19ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 71.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.66ms. Allocated memory is still 140.5MB. Free memory was 71.4MB in the beginning and 110.4MB in the end (delta: -39.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.50ms. Allocated memory is still 140.5MB. Free memory was 110.4MB in the beginning and 108.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 903.32ms. Allocated memory is still 140.5MB. Free memory was 108.0MB in the beginning and 64.4MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 64961.35ms. Allocated memory was 140.5MB in the beginning and 247.5MB in the end (delta: 107.0MB). Free memory was 63.6MB in the beginning and 172.5MB in the end (delta: -108.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 55.48ms. Allocated memory is still 247.5MB. Free memory was 172.5MB in the beginning and 165.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 94]: integer overflow possible integer overflow possible We found a FailurePath: [L82] int a; [L83] int n; [L84] int x; [L85] int y; [L86] int z; [L87] a = __VERIFIER_nondet_int() [L88] n = 0 [L89] x = 0 [L90] y = 1 [L91] z = 6 [L92] CALL func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}] [L56] EXPR \read(*z) [L56] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L56] EXPR 6 * (*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L56] EXPR (6 * (*n)) + 6 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L56] CALL __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L56] RET __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] EXPR \read(*y) [L57] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] EXPR 3 * (*n) [L57] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] EXPR (3 * (*n)) * (*n) [L57] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] EXPR 3 * (*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] EXPR ((3 * (*n)) * (*n)) + (3 * (*n)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] EXPR (((3 * (*n)) * (*n)) + (3 * (*n))) + 1 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L57] CALL __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L58] EXPR \read(*x) [L58] EXPR \read(*n) [L58] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L58] EXPR (*n) * (*n) [L58] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L58] EXPR ((*n) * (*n)) * (*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L58] CALL __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR \read(*y) [L59] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR (*y) * (*z) [L59] EXPR \read(*x) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR 18 * (*x) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR ((*y) * (*z)) - (18 * (*x)) [L59] EXPR \read(*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR 12 * (*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR (((*y) * (*z)) - (18 * (*x))) - (12 * (*y)) [L59] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR 2 * (*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR ((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] EXPR (((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L59] CALL __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L59] RET __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR \read(*z) [L60] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR (*z) * (*z) [L60] EXPR \read(*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR 12 * (*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR ((*z) * (*z)) - (12 * (*y)) [L60] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR 6 * (*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR (((*z) * (*z)) - (12 * (*y))) - (6 * (*z)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] EXPR ((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L60] CALL __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L61] EXPR \read(*n) [L61] EXPR \read(*a) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={5:0}, \old(y)={4:0}, \old(z)={8:0}, a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L61] COND TRUE !((*n) <= (*a)) [L92] RET func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [a={7:0}, n={6:0}, x={5:0}, y={4:0}, z={8:0}] [L93] EXPR \read(z) [L93] EXPR \read(n) [L93] EXPR 6 * n VAL [a={7:0}, x={5:0}, y={4:0}, z={8:0}] [L93] EXPR (6 * n) + 6 VAL [a={7:0}, x={5:0}, y={4:0}, z={8:0}] [L93] CALL __VERIFIER_assert(z == ((6 * n) + 6)) [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(z == ((6 * n) + 6)) VAL [a={7:0}, x={5:0}, y={4:0}, z={8:0}] [L94] EXPR \read(a) [L94] 6 * a VAL [a={7:0}, x={5:0}, y={4:0}, z={8:0}] - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 312 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 64.8s, OverallIterations: 31, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 10928 SdHoareTripleChecker+Valid, 48.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10831 mSDsluCounter, 59745 SdHoareTripleChecker+Invalid, 47.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51186 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10262 IncrementalHoareTripleChecker+Invalid, 10848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 8559 mSDtfsCounter, 10262 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1311 GetRequests, 889 SyntacticMatches, 50 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=30, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 2695 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2472 NumberOfCodeBlocks, 2472 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2073 ConstructedInterpolants, 262 QuantifiedInterpolants, 19198 SizeOfPredicates, 137 NumberOfNonLiveVariables, 2590 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 35 InterpolantComputations, 21 PerfectInterpolantSequences, 688/777 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 21:14:37,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)