./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 12:15:45,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:15:45,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:15:45,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:15:45,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:15:45,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:15:45,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:15:45,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:15:45,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:15:45,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:15:45,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:15:45,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:15:45,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:15:45,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:15:45,964 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:15:45,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:15:45,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:15:45,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:15:45,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:15:45,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:15:45,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:15:45,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:15:45,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:15:45,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:15:45,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:15:45,972 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:15:45,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:15:45,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:15:45,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:15:45,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:15:45,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:15:45,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:15:45,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:15:45,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:15:45,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:15:45,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:15:45,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:15:45,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:15:45,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:15:45,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:15:45,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:15:45,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:15:45,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:15:45,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:15:45,979 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-11-09 12:15:46,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:15:46,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:15:46,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:15:46,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:15:46,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:15:46,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-11-09 12:15:48,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:15:48,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:15:48,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-11-09 12:15:48,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4262ff95/0849ad32bedc47bd809373cd884e1ecd/FLAGfc7b86332 [2024-11-09 12:15:48,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4262ff95/0849ad32bedc47bd809373cd884e1ecd [2024-11-09 12:15:48,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:15:48,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:15:48,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:15:48,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:15:48,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:15:48,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ae21d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48, skipping insertion in model container [2024-11-09 12:15:48,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:15:48,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:15:48,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:15:48,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:15:48,602 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:15:48,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48 WrapperNode [2024-11-09 12:15:48,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:15:48,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:15:48,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:15:48,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:15:48,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,654 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2024-11-09 12:15:48,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:15:48,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:15:48,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:15:48,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:15:48,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,693 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 12, 5, 15, 21, 11]. 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, 1, 2, 2, 2]. [2024-11-09 12:15:48,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:15:48,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:15:48,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:15:48,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:15:48,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (1/1) ... [2024-11-09 12:15:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:15:48,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:15:48,772 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-11-09 12:15:48,777 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-11-09 12:15:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:15:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:15:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 12:15:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 12:15:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 12:15:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 12:15:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 12:15:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 12:15:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 12:15:48,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 12:15:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 12:15:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 12:15:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 12:15:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 12:15:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2024-11-09 12:15:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2024-11-09 12:15:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:15:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:15:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 12:15:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 12:15:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 12:15:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 12:15:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 12:15:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 12:15:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:15:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:15:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 12:15:48,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:15:48,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:15:50,072 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2024-11-09 12:15:50,073 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:15:50,108 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:15:50,108 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 12:15:50,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:15:50 BoogieIcfgContainer [2024-11-09 12:15:50,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:15:50,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:15:50,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:15:50,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:15:50,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:15:48" (1/3) ... [2024-11-09 12:15:50,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9e450d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:15:50, skipping insertion in model container [2024-11-09 12:15:50,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:15:48" (2/3) ... [2024-11-09 12:15:50,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9e450d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:15:50, skipping insertion in model container [2024-11-09 12:15:50,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:15:50" (3/3) ... [2024-11-09 12:15:50,122 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2024-11-09 12:15:50,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:15:50,142 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-11-09 12:15:50,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:15:50,246 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;@575967b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:15:50,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-11-09 12:15:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 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-11-09 12:15:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:15:50,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:50,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:15:50,263 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-11-09 12:15:50,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash 476001869, now seen corresponding path program 1 times [2024-11-09 12:15:50,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:50,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002545213] [2024-11-09 12:15:50,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:15:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002545213] [2024-11-09 12:15:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002545213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:15:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226939647] [2024-11-09 12:15:50,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:15:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:15:50,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:15:50,911 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 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.25) internal successors, (5), 5 states have internal predecessors, (5), 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-11-09 12:15:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:15:51,213 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2024-11-09 12:15:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:15:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 6 [2024-11-09 12:15:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:15:51,227 INFO L225 Difference]: With dead ends: 738 [2024-11-09 12:15:51,227 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 12:15:51,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11-09 12:15:51,236 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:15:51,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:15:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 12:15:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2024-11-09 12:15:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 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-11-09 12:15:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2024-11-09 12:15:51,332 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2024-11-09 12:15:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:15:51,333 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2024-11-09 12:15:51,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-11-09 12:15:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2024-11-09 12:15:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 12:15:51,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:51,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:15:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:15:51,340 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-11-09 12:15:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 13280284, now seen corresponding path program 1 times [2024-11-09 12:15:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975412508] [2024-11-09 12:15:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:15:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:15:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975412508] [2024-11-09 12:15:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975412508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:15:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767104808] [2024-11-09 12:15:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:51,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:15:51,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:15:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:15:51,600 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-09 12:15:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:15:51,806 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2024-11-09 12:15:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:15:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2024-11-09 12:15:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:15:51,810 INFO L225 Difference]: With dead ends: 418 [2024-11-09 12:15:51,810 INFO L226 Difference]: Without dead ends: 414 [2024-11-09 12:15:51,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11-09 12:15:51,812 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:15:51,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:15:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-09 12:15:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2024-11-09 12:15:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 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-11-09 12:15:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2024-11-09 12:15:51,844 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2024-11-09 12:15:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:15:51,845 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2024-11-09 12:15:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-09 12:15:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2024-11-09 12:15:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 12:15:51,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:51,847 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] [2024-11-09 12:15:51,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:15:51,848 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-11-09 12:15:51,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1803988512, now seen corresponding path program 1 times [2024-11-09 12:15:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749958352] [2024-11-09 12:15:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:51,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:52,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:15:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:15:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749958352] [2024-11-09 12:15:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749958352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:52,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:15:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940411569] [2024-11-09 12:15:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:52,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:15:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:15:52,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:15:52,077 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-11-09 12:15:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:15:52,283 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2024-11-09 12:15:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:15:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 20 [2024-11-09 12:15:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:15:52,286 INFO L225 Difference]: With dead ends: 414 [2024-11-09 12:15:52,286 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 12:15:52,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11-09 12:15:52,288 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:15:52,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:15:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 12:15:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2024-11-09 12:15:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 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-11-09 12:15:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2024-11-09 12:15:52,312 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2024-11-09 12:15:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:15:52,313 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2024-11-09 12:15:52,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-11-09 12:15:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2024-11-09 12:15:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 12:15:52,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:52,314 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-11-09 12:15:52,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:15:52,315 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-11-09 12:15:52,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1533829314, now seen corresponding path program 1 times [2024-11-09 12:15:52,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:52,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657274406] [2024-11-09 12:15:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:15:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:15:52,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657274406] [2024-11-09 12:15:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657274406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:15:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329746445] [2024-11-09 12:15:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:52,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:15:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:15:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:15:52,511 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-09 12:15:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:15:52,713 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2024-11-09 12:15:52,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:15:52,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-09 12:15:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:15:52,716 INFO L225 Difference]: With dead ends: 412 [2024-11-09 12:15:52,717 INFO L226 Difference]: Without dead ends: 410 [2024-11-09 12:15:52,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:15:52,718 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:15:52,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:15:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-09 12:15:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2024-11-09 12:15:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 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-11-09 12:15:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2024-11-09 12:15:52,743 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2024-11-09 12:15:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:15:52,744 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2024-11-09 12:15:52,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-09 12:15:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2024-11-09 12:15:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 12:15:52,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:52,745 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, 1] [2024-11-09 12:15:52,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:15:52,746 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-11-09 12:15:52,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 304068537, now seen corresponding path program 1 times [2024-11-09 12:15:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714575496] [2024-11-09 12:15:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:15:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:15:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714575496] [2024-11-09 12:15:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714575496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:15:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521550123] [2024-11-09 12:15:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:15:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:52,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:15:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:15:52,961 INFO L87 Difference]: Start difference. First operand 371 states and 421 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11-09 12:15:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:15:53,143 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2024-11-09 12:15:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:15:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2024-11-09 12:15:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:15:53,146 INFO L225 Difference]: With dead ends: 410 [2024-11-09 12:15:53,147 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 12:15:53,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11-09 12:15:53,149 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:15:53,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:15:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 12:15:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2024-11-09 12:15:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 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-11-09 12:15:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2024-11-09 12:15:53,172 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2024-11-09 12:15:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:15:53,173 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2024-11-09 12:15:53,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11-09 12:15:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2024-11-09 12:15:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 12:15:53,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:53,176 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, 1] [2024-11-09 12:15:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:15:53,177 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-11-09 12:15:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 952671999, now seen corresponding path program 1 times [2024-11-09 12:15:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284998862] [2024-11-09 12:15:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:15:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892487903] [2024-11-09 12:15:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:15:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:15:53,211 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-11-09 12:15:53,212 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-11-09 12:15:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:53,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 12:15:53,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:15:53,386 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-11-09 12:15:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:15:53,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:15:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284998862] [2024-11-09 12:15:53,570 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:15:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892487903] [2024-11-09 12:15:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892487903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:53,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:53,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:15:53,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471426246] [2024-11-09 12:15:53,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:53,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:15:53,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:53,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:15:53,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:15:53,573 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-09 12:15:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:15:53,864 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2024-11-09 12:15:53,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:15:53,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 32 [2024-11-09 12:15:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:15:53,867 INFO L225 Difference]: With dead ends: 590 [2024-11-09 12:15:53,869 INFO L226 Difference]: Without dead ends: 586 [2024-11-09 12:15:53,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 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-11-09 12:15:53,870 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 344 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:15:53,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1619 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:15:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-09 12:15:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2024-11-09 12:15:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 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-11-09 12:15:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2024-11-09 12:15:53,897 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2024-11-09 12:15:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:15:53,897 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2024-11-09 12:15:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-09 12:15:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2024-11-09 12:15:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 12:15:53,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:15:53,899 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-11-09 12:15:53,921 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-11-09 12:15:54,100 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-11-09 12:15:54,101 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-11-09 12:15:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:15:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1089407434, now seen corresponding path program 1 times [2024-11-09 12:15:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:15:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559817430] [2024-11-09 12:15:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:15:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:15:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314930569] [2024-11-09 12:15:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:15:54,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:15:54,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:15:54,142 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-11-09 12:15:54,144 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-11-09 12:15:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:15:54,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 12:15:54,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:15:54,285 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-11-09 12:15:54,288 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-11-09 12:15:54,632 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-11-09 12:15:54,640 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-11-09 12:15:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:15:54,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:15:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:15:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559817430] [2024-11-09 12:15:54,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:15:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314930569] [2024-11-09 12:15:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314930569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:15:54,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:15:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:15:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621418597] [2024-11-09 12:15:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:15:54,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:15:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:15:54,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:15:54,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:15:54,655 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 12:15:58,845 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-11-09 12:16:02,994 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-11-09 12:16:07,001 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-11-09 12:16:11,007 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-11-09 12:16:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:11,076 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2024-11-09 12:16:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:16:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 42 [2024-11-09 12:16:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:11,080 INFO L225 Difference]: With dead ends: 594 [2024-11-09 12:16:11,080 INFO L226 Difference]: Without dead ends: 593 [2024-11-09 12:16:11,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:16:11,081 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 361 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:11,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1506 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2024-11-09 12:16:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-09 12:16:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2024-11-09 12:16:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 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-11-09 12:16:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2024-11-09 12:16:11,101 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2024-11-09 12:16:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:11,102 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2024-11-09 12:16:11,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 12:16:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2024-11-09 12:16:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 12:16:11,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:11,104 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-11-09 12:16:11,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 12:16:11,308 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-11-09 12:16:11,309 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-11-09 12:16:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 588107993, now seen corresponding path program 1 times [2024-11-09 12:16:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483943802] [2024-11-09 12:16:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385685994] [2024-11-09 12:16:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:11,348 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-11-09 12:16:11,350 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-11-09 12:16:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:11,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 12:16:11,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:11,471 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-11-09 12:16:11,477 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-11-09 12:16:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 12:16:11,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:16:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 12:16:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483943802] [2024-11-09 12:16:14,148 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:16:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385685994] [2024-11-09 12:16:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385685994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:16:14,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:16:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-09 12:16:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257562233] [2024-11-09 12:16:14,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:16:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 12:16:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 12:16:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-09 12:16:14,150 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 12:16:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:17,940 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2024-11-09 12:16:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 12:16:17,941 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2024-11-09 12:16:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:17,944 INFO L225 Difference]: With dead ends: 593 [2024-11-09 12:16:17,944 INFO L226 Difference]: Without dead ends: 592 [2024-11-09 12:16:17,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-09 12:16:17,945 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 624 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:17,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2943 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 12:16:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-09 12:16:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2024-11-09 12:16:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 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-11-09 12:16:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2024-11-09 12:16:17,965 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2024-11-09 12:16:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:17,966 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2024-11-09 12:16:17,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 12:16:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2024-11-09 12:16:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 12:16:17,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:17,972 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] [2024-11-09 12:16:17,992 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-11-09 12:16:18,176 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-11-09 12:16:18,177 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-11-09 12:16:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1051478680, now seen corresponding path program 1 times [2024-11-09 12:16:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611218100] [2024-11-09 12:16:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611218100] [2024-11-09 12:16:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611218100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:18,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515331579] [2024-11-09 12:16:18,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:18,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:18,397 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-11-09 12:16:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:18,639 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2024-11-09 12:16:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 44 [2024-11-09 12:16:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:18,645 INFO L225 Difference]: With dead ends: 560 [2024-11-09 12:16:18,648 INFO L226 Difference]: Without dead ends: 558 [2024-11-09 12:16:18,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-11-09 12:16:18,650 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:18,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-09 12:16:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2024-11-09 12:16:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 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-11-09 12:16:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2024-11-09 12:16:18,672 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2024-11-09 12:16:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:18,673 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2024-11-09 12:16:18,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-11-09 12:16:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2024-11-09 12:16:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 12:16:18,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:18,676 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-11-09 12:16:18,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 12:16:18,676 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-11-09 12:16:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1153699578, now seen corresponding path program 1 times [2024-11-09 12:16:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254529867] [2024-11-09 12:16:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254529867] [2024-11-09 12:16:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254529867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:18,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:18,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:16:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847583198] [2024-11-09 12:16:18,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:18,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:16:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:16:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:16:18,905 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 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-11-09 12:16:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:19,295 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2024-11-09 12:16:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:16:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 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-11-09 12:16:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:19,299 INFO L225 Difference]: With dead ends: 558 [2024-11-09 12:16:19,299 INFO L226 Difference]: Without dead ends: 557 [2024-11-09 12:16:19,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:16:19,300 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 309 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:19,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1695 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:16:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-09 12:16:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2024-11-09 12:16:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 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-11-09 12:16:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2024-11-09 12:16:19,320 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2024-11-09 12:16:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:19,320 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2024-11-09 12:16:19,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 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-11-09 12:16:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2024-11-09 12:16:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 12:16:19,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:19,321 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-11-09 12:16:19,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 12:16:19,322 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-11-09 12:16:19,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1404948637, now seen corresponding path program 1 times [2024-11-09 12:16:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:19,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343660007] [2024-11-09 12:16:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:19,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343660007] [2024-11-09 12:16:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343660007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314656541] [2024-11-09 12:16:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:19,573 INFO L87 Difference]: Start difference. First operand 453 states and 564 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-11-09 12:16:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:20,034 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2024-11-09 12:16:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:20,035 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-11-09 12:16:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:20,037 INFO L225 Difference]: With dead ends: 557 [2024-11-09 12:16:20,038 INFO L226 Difference]: Without dead ends: 556 [2024-11-09 12:16:20,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-11-09 12:16:20,039 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:20,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:16:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-09 12:16:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2024-11-09 12:16:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 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-11-09 12:16:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2024-11-09 12:16:20,054 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2024-11-09 12:16:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2024-11-09 12:16:20,055 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-11-09 12:16:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2024-11-09 12:16:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 12:16:20,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:20,057 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] [2024-11-09 12:16:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 12:16:20,057 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-11-09 12:16:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 603734876, now seen corresponding path program 1 times [2024-11-09 12:16:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883935734] [2024-11-09 12:16:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:20,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883935734] [2024-11-09 12:16:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883935734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:20,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:20,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187645415] [2024-11-09 12:16:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:20,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:20,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:20,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:20,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:20,218 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-11-09 12:16:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:20,426 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2024-11-09 12:16:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 48 [2024-11-09 12:16:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:20,429 INFO L225 Difference]: With dead ends: 568 [2024-11-09 12:16:20,429 INFO L226 Difference]: Without dead ends: 566 [2024-11-09 12:16:20,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-11-09 12:16:20,430 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:20,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-09 12:16:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2024-11-09 12:16:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 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-11-09 12:16:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2024-11-09 12:16:20,446 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2024-11-09 12:16:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:20,447 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2024-11-09 12:16:20,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-11-09 12:16:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2024-11-09 12:16:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 12:16:20,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:20,448 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] [2024-11-09 12:16:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 12:16:20,448 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-11-09 12:16:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 368633790, now seen corresponding path program 1 times [2024-11-09 12:16:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768286178] [2024-11-09 12:16:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:20,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784322564] [2024-11-09 12:16:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:20,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:20,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:20,497 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-11-09 12:16:20,499 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-11-09 12:16:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:20,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 12:16:20,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:20,623 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-11-09 12:16:20,628 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-11-09 12:16:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:16:21,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:16:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768286178] [2024-11-09 12:16:21,959 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:16:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784322564] [2024-11-09 12:16:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784322564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:16:21,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:16:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-09 12:16:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127905979] [2024-11-09 12:16:21,960 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 12:16:21,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 12:16:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 12:16:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:16:21,962 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:16:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:23,835 INFO L93 Difference]: Finished difference Result 586 states and 605 transitions. [2024-11-09 12:16:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 12:16:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-11-09 12:16:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:23,838 INFO L225 Difference]: With dead ends: 586 [2024-11-09 12:16:23,840 INFO L226 Difference]: Without dead ends: 584 [2024-11-09 12:16:23,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 12:16:23,842 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 806 mSDsluCounter, 3054 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:23,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 3306 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 12:16:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-09 12:16:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 453. [2024-11-09 12:16:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 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-11-09 12:16:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2024-11-09 12:16:23,863 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 50 [2024-11-09 12:16:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2024-11-09 12:16:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:16:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2024-11-09 12:16:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 12:16:23,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:23,864 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] [2024-11-09 12:16:23,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 12:16:24,065 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-11-09 12:16:24,066 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-11-09 12:16:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2069756960, now seen corresponding path program 1 times [2024-11-09 12:16:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859624343] [2024-11-09 12:16:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859624343] [2024-11-09 12:16:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859624343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682717459] [2024-11-09 12:16:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:24,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:24,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:24,268 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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-11-09 12:16:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:24,455 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2024-11-09 12:16:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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 52 [2024-11-09 12:16:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:24,458 INFO L225 Difference]: With dead ends: 576 [2024-11-09 12:16:24,458 INFO L226 Difference]: Without dead ends: 574 [2024-11-09 12:16:24,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-11-09 12:16:24,459 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:24,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-09 12:16:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2024-11-09 12:16:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 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-11-09 12:16:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2024-11-09 12:16:24,475 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2024-11-09 12:16:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:24,476 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2024-11-09 12:16:24,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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-11-09 12:16:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2024-11-09 12:16:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 12:16:24,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:24,477 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-11-09 12:16:24,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 12:16:24,477 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-11-09 12:16:24,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:24,478 INFO L85 PathProgramCache]: Analyzing trace with hash 466583682, now seen corresponding path program 1 times [2024-11-09 12:16:24,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:24,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436803392] [2024-11-09 12:16:24,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:24,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436803392] [2024-11-09 12:16:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436803392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:24,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:24,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:16:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275247567] [2024-11-09 12:16:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:24,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:16:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:16:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:16:24,694 INFO L87 Difference]: Start difference. First operand 453 states and 557 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-11-09 12:16:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:25,011 INFO L93 Difference]: Finished difference Result 574 states and 594 transitions. [2024-11-09 12:16:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:16:25,012 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-11-09 12:16:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:25,014 INFO L225 Difference]: With dead ends: 574 [2024-11-09 12:16:25,015 INFO L226 Difference]: Without dead ends: 572 [2024-11-09 12:16:25,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:16:25,016 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 303 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:25,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1653 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:16:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-09 12:16:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2024-11-09 12:16:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7647058823529411) internal successors, (510), 427 states have internal predecessors, (510), 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-11-09 12:16:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 555 transitions. [2024-11-09 12:16:25,052 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 555 transitions. Word has length 54 [2024-11-09 12:16:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:25,052 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 555 transitions. [2024-11-09 12:16:25,052 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-11-09 12:16:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 555 transitions. [2024-11-09 12:16:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 12:16:25,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:25,053 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, 1] [2024-11-09 12:16:25,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 12:16:25,053 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-11-09 12:16:25,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1579192357, now seen corresponding path program 1 times [2024-11-09 12:16:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617064037] [2024-11-09 12:16:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617064037] [2024-11-09 12:16:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617064037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:25,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 12:16:25,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72109810] [2024-11-09 12:16:25,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:16:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:16:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:16:25,668 INFO L87 Difference]: Start difference. First operand 453 states and 555 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 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-11-09 12:16:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:26,669 INFO L93 Difference]: Finished difference Result 548 states and 568 transitions. [2024-11-09 12:16:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:16:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 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 55 [2024-11-09 12:16:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:26,672 INFO L225 Difference]: With dead ends: 548 [2024-11-09 12:16:26,672 INFO L226 Difference]: Without dead ends: 546 [2024-11-09 12:16:26,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:16:26,673 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 292 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:26,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1797 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 12:16:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-09 12:16:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2024-11-09 12:16:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7577854671280277) internal successors, (508), 427 states have internal predecessors, (508), 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-11-09 12:16:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 553 transitions. [2024-11-09 12:16:26,690 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 553 transitions. Word has length 55 [2024-11-09 12:16:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 553 transitions. [2024-11-09 12:16:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 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-11-09 12:16:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 553 transitions. [2024-11-09 12:16:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 12:16:26,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:26,692 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-11-09 12:16:26,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 12:16:26,692 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-11-09 12:16:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1656337381, now seen corresponding path program 1 times [2024-11-09 12:16:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962789266] [2024-11-09 12:16:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:26,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755107999] [2024-11-09 12:16:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:26,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:26,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:26,732 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-11-09 12:16:26,734 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-11-09 12:16:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:26,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 12:16:26,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:26,880 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-11-09 12:16:27,064 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-11-09 12:16:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:16:27,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:16:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962789266] [2024-11-09 12:16:27,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:16:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755107999] [2024-11-09 12:16:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755107999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:27,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:16:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532805673] [2024-11-09 12:16:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:27,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:16:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:16:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:16:27,080 INFO L87 Difference]: Start difference. First operand 453 states and 553 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-11-09 12:16:31,275 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-11-09 12:16:35,356 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-11-09 12:16:39,365 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-11-09 12:16:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:39,404 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2024-11-09 12:16:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:16:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 64 [2024-11-09 12:16:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:39,408 INFO L225 Difference]: With dead ends: 582 [2024-11-09 12:16:39,408 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 12:16:39,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:16:39,409 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 314 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:39,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1685 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 229 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2024-11-09 12:16:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 12:16:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2024-11-09 12:16:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.754325259515571) internal successors, (507), 427 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-11-09 12:16:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2024-11-09 12:16:39,427 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 64 [2024-11-09 12:16:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:39,427 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2024-11-09 12:16:39,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-11-09 12:16:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2024-11-09 12:16:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 12:16:39,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:39,432 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-11-09 12:16:39,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 12:16:39,633 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-11-09 12:16:39,633 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-11-09 12:16:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 193148854, now seen corresponding path program 1 times [2024-11-09 12:16:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203049235] [2024-11-09 12:16:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667729099] [2024-11-09 12:16:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:39,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:39,669 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-11-09 12:16:39,672 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-11-09 12:16:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:39,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 12:16:39,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:39,802 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-11-09 12:16:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:16:39,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:16:39,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:39,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203049235] [2024-11-09 12:16:39,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:16:39,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667729099] [2024-11-09 12:16:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667729099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:39,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:39,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:16:39,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886815918] [2024-11-09 12:16:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:39,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:16:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:16:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:16:39,980 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 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-11-09 12:16:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:40,183 INFO L93 Difference]: Finished difference Result 581 states and 600 transitions. [2024-11-09 12:16:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:16:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 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-11-09 12:16:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:40,185 INFO L225 Difference]: With dead ends: 581 [2024-11-09 12:16:40,185 INFO L226 Difference]: Without dead ends: 580 [2024-11-09 12:16:40,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:16:40,186 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 354 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:40,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1454 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-09 12:16:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 453. [2024-11-09 12:16:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7508650519031141) internal successors, (506), 427 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-11-09 12:16:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 551 transitions. [2024-11-09 12:16:40,203 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 551 transitions. Word has length 65 [2024-11-09 12:16:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:40,203 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 551 transitions. [2024-11-09 12:16:40,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 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-11-09 12:16:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 551 transitions. [2024-11-09 12:16:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 12:16:40,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:40,204 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] [2024-11-09 12:16:40,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 12:16:40,405 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-11-09 12:16:40,406 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-11-09 12:16:40,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1692647293, now seen corresponding path program 1 times [2024-11-09 12:16:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:40,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7539524] [2024-11-09 12:16:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:40,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:16:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7539524] [2024-11-09 12:16:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7539524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461096409] [2024-11-09 12:16:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:40,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:40,629 INFO L87 Difference]: Start difference. First operand 453 states and 551 transitions. Second operand has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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-11-09 12:16:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:40,847 INFO L93 Difference]: Finished difference Result 556 states and 576 transitions. [2024-11-09 12:16:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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 66 [2024-11-09 12:16:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:40,850 INFO L225 Difference]: With dead ends: 556 [2024-11-09 12:16:40,851 INFO L226 Difference]: Without dead ends: 554 [2024-11-09 12:16:40,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-11-09 12:16:40,852 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 274 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:40,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1423 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-09 12:16:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 453. [2024-11-09 12:16:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7439446366782008) internal successors, (504), 427 states have internal predecessors, (504), 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-11-09 12:16:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 549 transitions. [2024-11-09 12:16:40,867 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 549 transitions. Word has length 66 [2024-11-09 12:16:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:40,868 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 549 transitions. [2024-11-09 12:16:40,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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-11-09 12:16:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 549 transitions. [2024-11-09 12:16:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 12:16:40,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:40,869 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] [2024-11-09 12:16:40,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 12:16:40,869 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-11-09 12:16:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1158552865, now seen corresponding path program 1 times [2024-11-09 12:16:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734102120] [2024-11-09 12:16:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:40,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729358053] [2024-11-09 12:16:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:40,894 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-11-09 12:16:40,896 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-11-09 12:16:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:41,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 12:16:41,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:41,013 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-11-09 12:16:41,018 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-11-09 12:16:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:16:41,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:16:41,989 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-11-09 12:16:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 12:16:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734102120] [2024-11-09 12:16:42,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:16:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729358053] [2024-11-09 12:16:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729358053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:16:42,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:16:42,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-11-09 12:16:42,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392923994] [2024-11-09 12:16:42,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:16:42,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 12:16:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:42,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 12:16:42,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:16:42,083 INFO L87 Difference]: Start difference. First operand 453 states and 549 transitions. Second operand has 22 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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-11-09 12:16:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:43,446 INFO L93 Difference]: Finished difference Result 574 states and 593 transitions. [2024-11-09 12:16:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 12:16:43,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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 68 [2024-11-09 12:16:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:43,450 INFO L225 Difference]: With dead ends: 574 [2024-11-09 12:16:43,450 INFO L226 Difference]: Without dead ends: 572 [2024-11-09 12:16:43,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 12:16:43,451 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 632 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:43,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 3543 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 12:16:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-09 12:16:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2024-11-09 12:16:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7370242214532872) internal successors, (502), 427 states have internal predecessors, (502), 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-11-09 12:16:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 547 transitions. [2024-11-09 12:16:43,484 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 547 transitions. Word has length 68 [2024-11-09 12:16:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:43,484 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 547 transitions. [2024-11-09 12:16:43,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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-11-09 12:16:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 547 transitions. [2024-11-09 12:16:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 12:16:43,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:43,485 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] [2024-11-09 12:16:43,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 12:16:43,685 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-11-09 12:16:43,687 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-11-09 12:16:43,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash -972769727, now seen corresponding path program 1 times [2024-11-09 12:16:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:43,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636266580] [2024-11-09 12:16:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:43,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:43,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:16:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636266580] [2024-11-09 12:16:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636266580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:43,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849401155] [2024-11-09 12:16:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:43,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:43,973 INFO L87 Difference]: Start difference. First operand 453 states and 547 transitions. Second operand has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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-11-09 12:16:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:44,173 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2024-11-09 12:16:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:44,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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 70 [2024-11-09 12:16:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:44,176 INFO L225 Difference]: With dead ends: 564 [2024-11-09 12:16:44,176 INFO L226 Difference]: Without dead ends: 563 [2024-11-09 12:16:44,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-11-09 12:16:44,178 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 274 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:44,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1413 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-09 12:16:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 453. [2024-11-09 12:16:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7335640138408304) internal successors, (501), 427 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-11-09 12:16:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 546 transitions. [2024-11-09 12:16:44,195 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 546 transitions. Word has length 70 [2024-11-09 12:16:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:44,195 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 546 transitions. [2024-11-09 12:16:44,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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-11-09 12:16:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 546 transitions. [2024-11-09 12:16:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 12:16:44,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:44,197 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-11-09 12:16:44,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 12:16:44,197 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_39_0Err41ASSERT_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-11-09 12:16:44,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash -91090340, now seen corresponding path program 1 times [2024-11-09 12:16:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:44,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674069958] [2024-11-09 12:16:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:16:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:44,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674069958] [2024-11-09 12:16:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674069958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:44,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:44,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:44,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719792463] [2024-11-09 12:16:44,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:44,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:44,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:44,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:44,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:44,446 INFO L87 Difference]: Start difference. First operand 453 states and 546 transitions. Second operand has 6 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-11-09 12:16:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:44,648 INFO L93 Difference]: Finished difference Result 563 states and 583 transitions. [2024-11-09 12:16:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:44,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 71 [2024-11-09 12:16:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:44,652 INFO L225 Difference]: With dead ends: 563 [2024-11-09 12:16:44,652 INFO L226 Difference]: Without dead ends: 562 [2024-11-09 12:16:44,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-11-09 12:16:44,653 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 271 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:44,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1415 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-09 12:16:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 453. [2024-11-09 12:16:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7301038062283738) internal successors, (500), 427 states have internal predecessors, (500), 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-11-09 12:16:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 545 transitions. [2024-11-09 12:16:44,670 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 545 transitions. Word has length 71 [2024-11-09 12:16:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:44,671 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 545 transitions. [2024-11-09 12:16:44,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-11-09 12:16:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 545 transitions. [2024-11-09 12:16:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 12:16:44,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:44,672 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-11-09 12:16:44,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 12:16:44,672 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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-11-09 12:16:44,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1471166883, now seen corresponding path program 1 times [2024-11-09 12:16:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249959769] [2024-11-09 12:16:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573329266] [2024-11-09 12:16:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:44,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:44,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:44,703 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-11-09 12:16:44,704 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-11-09 12:16:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:44,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 12:16:44,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:44,828 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-11-09 12:16:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:16:45,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:16:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249959769] [2024-11-09 12:16:45,905 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:16:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573329266] [2024-11-09 12:16:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573329266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:16:45,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:16:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2024-11-09 12:16:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469943399] [2024-11-09 12:16:45,906 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 12:16:45,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 12:16:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 12:16:45,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2024-11-09 12:16:45,908 INFO L87 Difference]: Start difference. First operand 453 states and 545 transitions. Second operand has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 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-11-09 12:16:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:47,373 INFO L93 Difference]: Finished difference Result 574 states and 593 transitions. [2024-11-09 12:16:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 12:16:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 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 72 [2024-11-09 12:16:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:47,376 INFO L225 Difference]: With dead ends: 574 [2024-11-09 12:16:47,376 INFO L226 Difference]: Without dead ends: 572 [2024-11-09 12:16:47,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 12:16:47,377 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 546 mSDsluCounter, 4030 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 4280 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:47,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 4280 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 12:16:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-09 12:16:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2024-11-09 12:16:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7231833910034602) internal successors, (498), 427 states have internal predecessors, (498), 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-11-09 12:16:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 543 transitions. [2024-11-09 12:16:47,395 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 543 transitions. Word has length 72 [2024-11-09 12:16:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:47,395 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 543 transitions. [2024-11-09 12:16:47,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 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-11-09 12:16:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 543 transitions. [2024-11-09 12:16:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 12:16:47,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:47,396 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, 1] [2024-11-09 12:16:47,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 12:16:47,597 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,SelfDestructingSolverStorable22 [2024-11-09 12:16:47,598 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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-11-09 12:16:47,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1638466754, now seen corresponding path program 1 times [2024-11-09 12:16:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:47,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444251669] [2024-11-09 12:16:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:16:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:48,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444251669] [2024-11-09 12:16:48,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444251669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:48,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:48,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:16:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138542044] [2024-11-09 12:16:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:48,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:16:48,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:16:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:16:48,031 INFO L87 Difference]: Start difference. First operand 453 states and 543 transitions. Second operand has 7 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-11-09 12:16:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:48,774 INFO L93 Difference]: Finished difference Result 548 states and 568 transitions. [2024-11-09 12:16:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:16:48,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 73 [2024-11-09 12:16:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:48,777 INFO L225 Difference]: With dead ends: 548 [2024-11-09 12:16:48,777 INFO L226 Difference]: Without dead ends: 546 [2024-11-09 12:16:48,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-11-09 12:16:48,779 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 256 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:48,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1611 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 12:16:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-09 12:16:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2024-11-09 12:16:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7162629757785468) internal successors, (496), 427 states have internal predecessors, (496), 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-11-09 12:16:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 541 transitions. [2024-11-09 12:16:48,803 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 541 transitions. Word has length 73 [2024-11-09 12:16:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:48,804 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 541 transitions. [2024-11-09 12:16:48,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-11-09 12:16:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 541 transitions. [2024-11-09 12:16:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 12:16:48,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:48,809 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] [2024-11-09 12:16:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 12:16:48,809 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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-11-09 12:16:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash -814628251, now seen corresponding path program 1 times [2024-11-09 12:16:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067800941] [2024-11-09 12:16:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 12:16:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067800941] [2024-11-09 12:16:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067800941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960011586] [2024-11-09 12:16:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:49,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:49,033 INFO L87 Difference]: Start difference. First operand 453 states and 541 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-11-09 12:16:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:49,149 INFO L93 Difference]: Finished difference Result 457 states and 545 transitions. [2024-11-09 12:16:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:49,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 83 [2024-11-09 12:16:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:49,153 INFO L225 Difference]: With dead ends: 457 [2024-11-09 12:16:49,153 INFO L226 Difference]: Without dead ends: 455 [2024-11-09 12:16:49,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-11-09 12:16:49,154 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 62 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:49,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1508 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:16:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-09 12:16:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-09 12:16:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 291 states have (on average 1.711340206185567) internal successors, (498), 429 states have internal predecessors, (498), 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-11-09 12:16:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 543 transitions. [2024-11-09 12:16:49,175 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 543 transitions. Word has length 83 [2024-11-09 12:16:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:49,176 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 543 transitions. [2024-11-09 12:16:49,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-11-09 12:16:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 543 transitions. [2024-11-09 12:16:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 12:16:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:49,180 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-11-09 12:16:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 12:16:49,180 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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-11-09 12:16:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1173696761, now seen corresponding path program 1 times [2024-11-09 12:16:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518689384] [2024-11-09 12:16:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 12:16:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518689384] [2024-11-09 12:16:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518689384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929069451] [2024-11-09 12:16:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:49,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:49,565 INFO L87 Difference]: Start difference. First operand 455 states and 543 transitions. Second operand has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-11-09 12:16:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:49,773 INFO L93 Difference]: Finished difference Result 532 states and 552 transitions. [2024-11-09 12:16:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 85 [2024-11-09 12:16:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:49,775 INFO L225 Difference]: With dead ends: 532 [2024-11-09 12:16:49,775 INFO L226 Difference]: Without dead ends: 530 [2024-11-09 12:16:49,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-11-09 12:16:49,776 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 209 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:49,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1427 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-09 12:16:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 457. [2024-11-09 12:16:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 293 states have (on average 1.7064846416382253) internal successors, (500), 431 states have internal predecessors, (500), 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-11-09 12:16:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 545 transitions. [2024-11-09 12:16:49,811 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 545 transitions. Word has length 85 [2024-11-09 12:16:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:49,811 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 545 transitions. [2024-11-09 12:16:49,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-11-09 12:16:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 545 transitions. [2024-11-09 12:16:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 12:16:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:49,813 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-11-09 12:16:49,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 12:16:49,813 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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-11-09 12:16:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995937, now seen corresponding path program 1 times [2024-11-09 12:16:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134629349] [2024-11-09 12:16:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:16:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:16:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 12:16:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 12:16:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:16:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 12:16:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134629349] [2024-11-09 12:16:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134629349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949633785] [2024-11-09 12:16:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:50,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:50,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:50,104 INFO L87 Difference]: Start difference. First operand 457 states and 545 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-11-09 12:16:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:50,304 INFO L93 Difference]: Finished difference Result 463 states and 547 transitions. [2024-11-09 12:16:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:16:50,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 86 [2024-11-09 12:16:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:50,307 INFO L225 Difference]: With dead ends: 463 [2024-11-09 12:16:50,307 INFO L226 Difference]: Without dead ends: 459 [2024-11-09 12:16:50,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-11-09 12:16:50,308 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 112 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:50,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1187 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-09 12:16:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-11-09 12:16:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 294 states have (on average 1.6904761904761905) 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-11-09 12:16:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 543 transitions. [2024-11-09 12:16:50,324 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 543 transitions. Word has length 86 [2024-11-09 12:16:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:50,325 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 543 transitions. [2024-11-09 12:16:50,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-11-09 12:16:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 543 transitions. [2024-11-09 12:16:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 12:16:50,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:50,326 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] [2024-11-09 12:16:50,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 12:16:50,326 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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-11-09 12:16:50,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1653816233, now seen corresponding path program 1 times [2024-11-09 12:16:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195593469] [2024-11-09 12:16:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 12:16:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:50,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195593469] [2024-11-09 12:16:50,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195593469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:50,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:50,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:50,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924933567] [2024-11-09 12:16:50,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:50,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:50,731 INFO L87 Difference]: Start difference. First operand 459 states and 543 transitions. Second operand has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-11-09 12:16:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:50,985 INFO L93 Difference]: Finished difference Result 540 states and 560 transitions. [2024-11-09 12:16:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 87 [2024-11-09 12:16:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:50,988 INFO L225 Difference]: With dead ends: 540 [2024-11-09 12:16:50,989 INFO L226 Difference]: Without dead ends: 538 [2024-11-09 12:16:50,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-11-09 12:16:50,990 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 215 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:50,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1397 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-09 12:16:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 461. [2024-11-09 12:16:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 296 states have (on average 1.6858108108108107) internal successors, (499), 434 states have internal predecessors, (499), 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-11-09 12:16:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 545 transitions. [2024-11-09 12:16:51,014 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 545 transitions. Word has length 87 [2024-11-09 12:16:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:51,015 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 545 transitions. [2024-11-09 12:16:51,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-11-09 12:16:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 545 transitions. [2024-11-09 12:16:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 12:16:51,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:51,016 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, 1] [2024-11-09 12:16:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 12:16:51,016 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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-11-09 12:16:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 179505227, now seen corresponding path program 1 times [2024-11-09 12:16:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265411749] [2024-11-09 12:16:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 12:16:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265411749] [2024-11-09 12:16:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265411749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:16:51,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:16:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:16:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843290864] [2024-11-09 12:16:51,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:16:51,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:16:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:16:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:16:51,289 INFO L87 Difference]: Start difference. First operand 461 states and 545 transitions. Second operand has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-09 12:16:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:51,481 INFO L93 Difference]: Finished difference Result 550 states and 570 transitions. [2024-11-09 12:16:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:16:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 89 [2024-11-09 12:16:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:51,483 INFO L225 Difference]: With dead ends: 550 [2024-11-09 12:16:51,483 INFO L226 Difference]: Without dead ends: 548 [2024-11-09 12:16:51,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-11-09 12:16:51,484 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 225 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:51,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1443 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:16:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-09 12:16:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 463. [2024-11-09 12:16:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 436 states have internal predecessors, (501), 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-11-09 12:16:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 547 transitions. [2024-11-09 12:16:51,501 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 547 transitions. Word has length 89 [2024-11-09 12:16:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:51,501 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 547 transitions. [2024-11-09 12:16:51,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-09 12:16:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 547 transitions. [2024-11-09 12:16:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 12:16:51,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:51,503 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, 1] [2024-11-09 12:16:51,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 12:16:51,503 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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-11-09 12:16:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -585186275, now seen corresponding path program 1 times [2024-11-09 12:16:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067790236] [2024-11-09 12:16:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 12:16:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:51,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067790236] [2024-11-09 12:16:51,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067790236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:16:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609818817] [2024-11-09 12:16:51,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:51,959 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-11-09 12:16:51,961 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-11-09 12:16:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:52,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 12:16:52,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:52,474 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-11-09 12:16:52,517 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-11-09 12:16:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:52,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:16:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609818817] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:16:52,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:16:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2024-11-09 12:16:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85238441] [2024-11-09 12:16:52,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:16:52,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 12:16:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:52,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 12:16:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-09 12:16:52,760 INFO L87 Difference]: Start difference. First operand 463 states and 547 transitions. Second operand has 21 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 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-11-09 12:16:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:53,314 INFO L93 Difference]: Finished difference Result 466 states and 554 transitions. [2024-11-09 12:16:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 12:16:53,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 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 94 [2024-11-09 12:16:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:53,318 INFO L225 Difference]: With dead ends: 466 [2024-11-09 12:16:53,318 INFO L226 Difference]: Without dead ends: 463 [2024-11-09 12:16:53,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 177 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-09 12:16:53,321 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 726 mSDsluCounter, 3525 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:53,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 3872 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:16:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-09 12:16:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2024-11-09 12:16:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 298 states have (on average 1.6711409395973154) 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-11-09 12:16:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 544 transitions. [2024-11-09 12:16:53,342 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 544 transitions. Word has length 94 [2024-11-09 12:16:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:53,343 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 544 transitions. [2024-11-09 12:16:53,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 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-11-09 12:16:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 544 transitions. [2024-11-09 12:16:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 12:16:53,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:53,344 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, 1] [2024-11-09 12:16:53,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 12:16:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:53,549 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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-11-09 12:16:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -960905304, now seen corresponding path program 1 times [2024-11-09 12:16:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282969534] [2024-11-09 12:16:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:16:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 12:16:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 12:16:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 12:16:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 12:16:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:16:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282969534] [2024-11-09 12:16:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282969534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:16:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453834054] [2024-11-09 12:16:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:53,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:53,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:53,928 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-11-09 12:16:53,930 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-11-09 12:16:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:16:54,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 12:16:54,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:16:54,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 12:16:54,421 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-11-09 12:16:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:54,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:16:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:16:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453834054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:16:54,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:16:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-11-09 12:16:54,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117355524] [2024-11-09 12:16:54,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:16:54,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 12:16:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:16:54,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 12:16:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-09 12:16:54,639 INFO L87 Difference]: Start difference. First operand 460 states and 544 transitions. Second operand has 18 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 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-11-09 12:16:59,197 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-11-09 12:16:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:16:59,250 INFO L93 Difference]: Finished difference Result 591 states and 689 transitions. [2024-11-09 12:16:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 12:16:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 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 95 [2024-11-09 12:16:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:16:59,252 INFO L225 Difference]: With dead ends: 591 [2024-11-09 12:16:59,252 INFO L226 Difference]: Without dead ends: 588 [2024-11-09 12:16:59,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 182 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 12:16:59,254 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 891 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:16:59,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 3559 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 432 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 12:16:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-09 12:16:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 524. [2024-11-09 12:16:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 355 states have (on average 1.6788732394366197) internal successors, (596), 489 states have internal predecessors, (596), 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-11-09 12:16:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 658 transitions. [2024-11-09 12:16:59,293 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 658 transitions. Word has length 95 [2024-11-09 12:16:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:16:59,293 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 658 transitions. [2024-11-09 12:16:59,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 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-11-09 12:16:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 658 transitions. [2024-11-09 12:16:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 12:16:59,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:16:59,295 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, 1] [2024-11-09 12:16:59,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 12:16:59,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-09 12:16:59,496 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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-11-09 12:16:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:16:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 431466758, now seen corresponding path program 1 times [2024-11-09 12:16:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:16:59,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457429853] [2024-11-09 12:16:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:59,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:16:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:16:59,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58892931] [2024-11-09 12:16:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:16:59,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:16:59,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:16:59,533 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-11-09 12:16:59,535 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-11-09 12:16:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 12:16:59,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 12:16:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 12:16:59,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 12:16:59,801 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 12:16:59,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-11-09 12:16:59,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-11-09 12:16:59,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-11-09 12:16:59,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-11-09 12:16:59,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-11-09 12:16:59,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-11-09 12:16:59,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-11-09 12:16:59,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-11-09 12:16:59,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-11-09 12:16:59,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-11-09 12:16:59,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-11-09 12:16:59,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-11-09 12:16:59,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-11-09 12:16:59,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-11-09 12:16:59,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-11-09 12:16:59,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-11-09 12:16:59,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-11-09 12:16:59,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-11-09 12:16:59,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-11-09 12:16:59,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-11-09 12:16:59,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-11-09 12:16:59,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-11-09 12:16:59,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-11-09 12:16:59,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-11-09 12:16:59,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-11-09 12:16:59,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-11-09 12:16:59,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-11-09 12:16:59,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-11-09 12:16:59,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 12:17:00,028 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,SelfDestructingSolverStorable31 [2024-11-09 12:17:00,032 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, 1] [2024-11-09 12:17:00,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:17:00,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:17:00 BoogieIcfgContainer [2024-11-09 12:17:00,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:17:00,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:17:00,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:17:00,139 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:17:00,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:15:50" (3/4) ... [2024-11-09 12:17:00,141 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 12:17:00,213 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:17:00,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:17:00,214 INFO L158 Benchmark]: Toolchain (without parser) took 71942.84ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 128.0MB in the beginning and 188.7MB in the end (delta: -60.7MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,214 INFO L158 Benchmark]: CDTParser took 1.72ms. Allocated memory is still 184.5MB. Free memory was 145.4MB in the beginning and 145.1MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:17:00,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.70ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 113.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.09ms. Allocated memory is still 184.5MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,214 INFO L158 Benchmark]: Boogie Preprocessor took 59.96ms. Allocated memory is still 184.5MB. Free memory was 111.2MB in the beginning and 108.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,215 INFO L158 Benchmark]: RCFGBuilder took 1393.85ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 108.6MB in the beginning and 192.7MB in the end (delta: -84.1MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,215 INFO L158 Benchmark]: TraceAbstraction took 70025.93ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 191.7MB in the beginning and 196.0MB in the end (delta: -4.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,215 INFO L158 Benchmark]: Witness Printer took 74.02ms. Allocated memory is still 289.4MB. Free memory was 196.0MB in the beginning and 188.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 12:17:00,216 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.72ms. Allocated memory is still 184.5MB. Free memory was 145.4MB in the beginning and 145.1MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.70ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 113.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.09ms. Allocated memory is still 184.5MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.96ms. Allocated memory is still 184.5MB. Free memory was 111.2MB in the beginning and 108.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1393.85ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 108.6MB in the beginning and 192.7MB in the end (delta: -84.1MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * TraceAbstraction took 70025.93ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 191.7MB in the beginning and 196.0MB in the end (delta: -4.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 74.02ms. Allocated memory is still 289.4MB. Free memory was 196.0MB in the beginning and 188.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}] [L56] EXPR \read(*z) [L56] EXPR \read(*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L56] EXPR 6 * (*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L56] EXPR (6 * (*n)) + 6 VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5: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)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L57] EXPR \read(*y) [L57] EXPR \read(*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L57] EXPR 3 * (*n) [L57] EXPR \read(*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L57] EXPR (3 * (*n)) * (*n) [L57] EXPR \read(*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L57] EXPR 3 * (*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L57] EXPR ((3 * (*n)) * (*n)) + (3 * (*n)) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L57] EXPR (((3 * (*n)) * (*n)) + (3 * (*n))) + 1 VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5: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)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L58] EXPR \read(*x) [L58] EXPR \read(*n) [L58] EXPR \read(*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L58] EXPR (*n) * (*n) [L58] EXPR \read(*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L58] EXPR ((*n) * (*n)) * (*n) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5: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)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR \read(*y) [L59] EXPR \read(*z) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR (*y) * (*z) [L59] EXPR \read(*x) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR 18 * (*x) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR ((*y) * (*z)) - (18 * (*x)) [L59] EXPR \read(*y) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR 12 * (*y) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR (((*y) * (*z)) - (18 * (*x))) - (12 * (*y)) [L59] EXPR \read(*z) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR 2 * (*z) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR ((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z)) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L59] EXPR (((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6 VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5: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)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR \read(*z) [L60] EXPR \read(*z) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR (*z) * (*z) [L60] EXPR \read(*y) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR 12 * (*y) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR ((*z) * (*z)) - (12 * (*y)) [L60] EXPR \read(*z) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR 6 * (*z) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR (((*z) * (*z)) - (12 * (*y))) - (6 * (*z)) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L60] EXPR ((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12 VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5: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)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L61] EXPR \read(*n) [L61] EXPR \read(*a) VAL [\old(a)={6:0}, \old(n)={7:0}, \old(x)={9:0}, \old(y)={4:0}, \old(z)={5:0}, a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L61] COND TRUE !((*n) <= (*a)) [L92] RET func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [a={6:0}, n={7:0}, x={9:0}, y={4:0}, z={5:0}] [L93] EXPR \read(z) [L93] EXPR \read(n) [L93] EXPR 6 * n VAL [a={6:0}, x={9:0}, y={4:0}, z={5:0}] [L93] EXPR (6 * n) + 6 VAL [a={6:0}, x={9:0}, y={4:0}, z={5: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={6:0}, x={9:0}, y={4:0}, z={5:0}] [L94] EXPR \read(a) [L94] 6 * a VAL [a={6:0}, x={9:0}, y={4:0}, z={5: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, 317 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 69.8s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 49.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 10691 SdHoareTripleChecker+Valid, 45.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10593 mSDsluCounter, 58959 SdHoareTripleChecker+Invalid, 44.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50018 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9674 IncrementalHoareTripleChecker+Invalid, 10227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 8941 mSDtfsCounter, 9674 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1377 GetRequests, 967 SyntacticMatches, 61 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=31, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 2716 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 2585 NumberOfCodeBlocks, 2585 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2220 ConstructedInterpolants, 254 QuantifiedInterpolants, 20188 SizeOfPredicates, 122 NumberOfNonLiveVariables, 2590 ConjunctsInSsa, 291 ConjunctsInUnsatCore, 37 InterpolantComputations, 25 PerfectInterpolantSequences, 751/813 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-11-09 12:17:00,281 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)