./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec Calling Ultimate with: /usr/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/termination-crafted/MutualRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 10:41:19,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 10:41:19,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 10:41:19,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 10:41:19,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 10:41:19,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 10:41:19,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 10:41:19,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 10:41:19,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 10:41:19,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 10:41:19,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 10:41:19,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 10:41:19,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 10:41:19,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 10:41:19,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 10:41:19,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 10:41:19,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 10:41:19,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 10:41:19,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 10:41:19,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 10:41:19,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 10:41:19,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 10:41:19,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 10:41:19,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 10:41:19,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 10:41:19,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 10:41:19,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 10:41:19,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 10:41:19,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 10:41:19,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 10:41:19,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 10:41:19,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 10:41:19,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 10:41:19,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 10:41:19,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 10:41:19,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 10:41:19,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 10:41:19,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 10:41:19,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 10:41:19,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 10:41:19,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 10:41:19,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2021-08-27 10:41:19,352 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 10:41:19,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 10:41:19,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 10:41:19,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 10:41:19,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 10:41:19,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 10:41:19,354 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 10:41:19,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 10:41:19,355 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 10:41:19,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 10:41:19,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 10:41:19,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 10:41:19,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 10:41:19,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 10:41:19,356 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 10:41:19,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 10:41:19,356 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 10:41:19,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 10:41:19,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 10:41:19,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 10:41:19,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 10:41:19,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 10:41:19,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 10:41:19,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 10:41:19,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 10:41:19,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 10:41:19,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 10:41:19,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 10:41:19,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 10:41:19,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2021-08-27 10:41:19,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 10:41:19,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 10:41:19,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 10:41:19,665 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 10:41:19,666 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 10:41:19,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2021-08-27 10:41:19,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2507646/6a880f66b1484e559c91f983845a5526/FLAGab43e0cd7 [2021-08-27 10:41:20,132 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 10:41:20,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2021-08-27 10:41:20,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2507646/6a880f66b1484e559c91f983845a5526/FLAGab43e0cd7 [2021-08-27 10:41:20,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2507646/6a880f66b1484e559c91f983845a5526 [2021-08-27 10:41:20,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 10:41:20,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 10:41:20,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 10:41:20,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 10:41:20,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 10:41:20,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cc9a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20, skipping insertion in model container [2021-08-27 10:41:20,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 10:41:20,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 10:41:20,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 10:41:20,682 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 10:41:20,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 10:41:20,703 INFO L208 MainTranslator]: Completed translation [2021-08-27 10:41:20,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20 WrapperNode [2021-08-27 10:41:20,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 10:41:20,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 10:41:20,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 10:41:20,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 10:41:20,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 10:41:20,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 10:41:20,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 10:41:20,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 10:41:20,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 10:41:20,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 10:41:20,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 10:41:20,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 10:41:20,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (1/1) ... [2021-08-27 10:41:20,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 10:41:20,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:20,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 10:41:20,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 10:41:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-08-27 10:41:20,828 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-08-27 10:41:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure g [2021-08-27 10:41:20,828 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2021-08-27 10:41:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 10:41:20,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 10:41:21,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 10:41:21,076 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-27 10:41:21,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:21 BoogieIcfgContainer [2021-08-27 10:41:21,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 10:41:21,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 10:41:21,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 10:41:21,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 10:41:21,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:41:20" (1/3) ... [2021-08-27 10:41:21,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5424b8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:41:21, skipping insertion in model container [2021-08-27 10:41:21,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:20" (2/3) ... [2021-08-27 10:41:21,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5424b8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:41:21, skipping insertion in model container [2021-08-27 10:41:21,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:21" (3/3) ... [2021-08-27 10:41:21,085 INFO L111 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b.c [2021-08-27 10:41:21,089 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 10:41:21,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-08-27 10:41:21,167 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 10:41:21,176 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 10:41:21,176 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-08-27 10:41:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 10:41:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-27 10:41:21,203 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:21,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-27 10:41:21,205 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2021-08-27 10:41:21,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:21,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132181446] [2021-08-27 10:41:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:21,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:21,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:21,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132181446] [2021-08-27 10:41:21,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132181446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:21,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:21,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:21,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016505444] [2021-08-27 10:41:21,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:21,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:21,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:21,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:21,433 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:21,563 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2021-08-27 10:41:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 10:41:21,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-27 10:41:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:21,571 INFO L225 Difference]: With dead ends: 64 [2021-08-27 10:41:21,572 INFO L226 Difference]: Without dead ends: 56 [2021-08-27 10:41:21,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-08-27 10:41:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2021-08-27 10:41:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-27 10:41:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2021-08-27 10:41:21,606 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2021-08-27 10:41:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:21,607 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-08-27 10:41:21,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2021-08-27 10:41:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-27 10:41:21,607 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:21,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-27 10:41:21,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 10:41:21,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:21,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2021-08-27 10:41:21,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:21,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719519668] [2021-08-27 10:41:21,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:21,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:21,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:21,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719519668] [2021-08-27 10:41:21,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719519668] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:21,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:21,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:21,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064102671] [2021-08-27 10:41:21,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:21,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:21,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:21,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:21,629 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) [2021-08-27 10:41:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:21,645 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2021-08-27 10:41:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:21,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 [2021-08-27 10:41:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:21,647 INFO L225 Difference]: With dead ends: 52 [2021-08-27 10:41:21,647 INFO L226 Difference]: Without dead ends: 50 [2021-08-27 10:41:21,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-27 10:41:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2021-08-27 10:41:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-27 10:41:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2021-08-27 10:41:21,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2021-08-27 10:41:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:21,660 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2021-08-27 10:41:21,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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) [2021-08-27 10:41:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2021-08-27 10:41:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 10:41:21,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:21,661 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:21,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 10:41:21,662 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2021-08-27 10:41:21,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:21,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479609985] [2021-08-27 10:41:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:21,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:21,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:21,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479609985] [2021-08-27 10:41:21,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479609985] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:21,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:21,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 10:41:21,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989125273] [2021-08-27 10:41:21,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 10:41:21,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 10:41:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:21,808 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:22,036 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2021-08-27 10:41:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 10:41:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-27 10:41:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:22,045 INFO L225 Difference]: With dead ends: 66 [2021-08-27 10:41:22,045 INFO L226 Difference]: Without dead ends: 63 [2021-08-27 10:41:22,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 116.2ms TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 10:41:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-27 10:41:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2021-08-27 10:41:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 10:41:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2021-08-27 10:41:22,061 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2021-08-27 10:41:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:22,061 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2021-08-27 10:41:22,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2021-08-27 10:41:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 10:41:22,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:22,062 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:22,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 10:41:22,063 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2021-08-27 10:41:22,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:22,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944970856] [2021-08-27 10:41:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:22,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 10:41:22,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:22,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944970856] [2021-08-27 10:41:22,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944970856] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:22,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:22,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:22,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960758353] [2021-08-27 10:41:22,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:22,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:22,147 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:22,165 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2021-08-27 10:41:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 10:41:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:22,169 INFO L225 Difference]: With dead ends: 61 [2021-08-27 10:41:22,169 INFO L226 Difference]: Without dead ends: 60 [2021-08-27 10:41:22,170 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-08-27 10:41:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2021-08-27 10:41:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 10:41:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2021-08-27 10:41:22,177 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2021-08-27 10:41:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:22,177 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2021-08-27 10:41:22,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 10:41:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2021-08-27 10:41:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 10:41:22,178 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:22,178 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:22,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 10:41:22,179 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2021-08-27 10:41:22,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:22,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129500601] [2021-08-27 10:41:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:22,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 10:41:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 10:41:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 10:41:22,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:22,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129500601] [2021-08-27 10:41:22,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129500601] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:22,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:22,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 10:41:22,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211805803] [2021-08-27 10:41:22,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:22,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:22,259 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 10:41:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:22,297 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2021-08-27 10:41:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 10:41:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-08-27 10:41:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:22,300 INFO L225 Difference]: With dead ends: 93 [2021-08-27 10:41:22,300 INFO L226 Difference]: Without dead ends: 92 [2021-08-27 10:41:22,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-27 10:41:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2021-08-27 10:41:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2021-08-27 10:41:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2021-08-27 10:41:22,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2021-08-27 10:41:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:22,311 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2021-08-27 10:41:22,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 10:41:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2021-08-27 10:41:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 10:41:22,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:22,312 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:22,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 10:41:22,313 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2021-08-27 10:41:22,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:22,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959207229] [2021-08-27 10:41:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:22,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 10:41:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 10:41:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 10:41:22,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:22,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959207229] [2021-08-27 10:41:22,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959207229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:22,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:22,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 10:41:22,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027253237] [2021-08-27 10:41:22,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:22,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:22,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:22,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:22,403 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 10:41:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:22,439 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2021-08-27 10:41:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 10:41:22,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-08-27 10:41:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:22,440 INFO L225 Difference]: With dead ends: 93 [2021-08-27 10:41:22,440 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 10:41:22,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 10:41:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2021-08-27 10:41:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2021-08-27 10:41:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2021-08-27 10:41:22,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2021-08-27 10:41:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:22,451 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2021-08-27 10:41:22,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 10:41:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2021-08-27 10:41:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 10:41:22,452 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:22,452 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-08-27 10:41:22,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 10:41:22,452 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2082036524, now seen corresponding path program 1 times [2021-08-27 10:41:22,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:22,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960802259] [2021-08-27 10:41:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:22,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 10:41:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 10:41:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 10:41:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 10:41:22,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:22,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960802259] [2021-08-27 10:41:22,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960802259] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:22,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672906093] [2021-08-27 10:41:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:22,556 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 10:41:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:22,558 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) [2021-08-27 10:41:22,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 10:41:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:22,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 10:41:22,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 10:41:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 10:41:22,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672906093] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 10:41:22,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 10:41:22,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-08-27 10:41:22,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903528361] [2021-08-27 10:41:22,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 10:41:22,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 10:41:22,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:22,813 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 10:41:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:23,004 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2021-08-27 10:41:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 10:41:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2021-08-27 10:41:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:23,008 INFO L225 Difference]: With dead ends: 157 [2021-08-27 10:41:23,008 INFO L226 Difference]: Without dead ends: 82 [2021-08-27 10:41:23,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-08-27 10:41:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-27 10:41:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2021-08-27 10:41:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2021-08-27 10:41:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2021-08-27 10:41:23,034 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 32 [2021-08-27 10:41:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:23,035 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2021-08-27 10:41:23,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 10:41:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2021-08-27 10:41:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 10:41:23,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:23,043 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:23,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-27 10:41:23,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 10:41:23,256 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash 407346927, now seen corresponding path program 1 times [2021-08-27 10:41:23,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:23,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644573007] [2021-08-27 10:41:23,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:23,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 10:41:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-08-27 10:41:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-27 10:41:23,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:23,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644573007] [2021-08-27 10:41:23,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644573007] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:23,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:23,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 10:41:23,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567226178] [2021-08-27 10:41:23,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 10:41:23,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 10:41:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:23,457 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 10:41:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:23,529 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2021-08-27 10:41:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 10:41:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2021-08-27 10:41:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:23,536 INFO L225 Difference]: With dead ends: 78 [2021-08-27 10:41:23,536 INFO L226 Difference]: Without dead ends: 76 [2021-08-27 10:41:23,536 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-27 10:41:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-08-27 10:41:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2021-08-27 10:41:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2021-08-27 10:41:23,553 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 60 [2021-08-27 10:41:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:23,554 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2021-08-27 10:41:23,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 10:41:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2021-08-27 10:41:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 10:41:23,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:23,556 INFO L512 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:23,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 10:41:23,560 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2021-08-27 10:41:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash -319407487, now seen corresponding path program 1 times [2021-08-27 10:41:23,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:23,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625894358] [2021-08-27 10:41:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:23,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 10:41:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 10:41:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 10:41:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 10:41:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-27 10:41:23,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:23,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625894358] [2021-08-27 10:41:23,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625894358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:23,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:23,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 10:41:23,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174856194] [2021-08-27 10:41:23,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 10:41:23,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 10:41:23,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:23,793 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 10:41:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:23,845 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2021-08-27 10:41:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 10:41:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 69 [2021-08-27 10:41:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:23,847 INFO L225 Difference]: With dead ends: 76 [2021-08-27 10:41:23,847 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 10:41:23,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 10:41:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 10:41:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 10:41:23,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2021-08-27 10:41:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:23,848 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 10:41:23,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 10:41:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 10:41:23,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 10:41:23,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,853 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,853 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:23,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 10:41:23,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-27 10:41:23,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:23,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 10:41:24,023 INFO L857 garLoopResultBuilder]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2021-08-27 10:41:24,024 INFO L853 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (and (not (<= (+ |f_#in~x| 1) 0)) (or (and (<= |f_#in~x| f_~x) (<= f_~x 2147483645) (<= 1 f_~x)) (not (<= |f_#in~x| 2147483645)))) [2021-08-27 10:41:24,024 INFO L857 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2021-08-27 10:41:24,024 INFO L857 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,024 INFO L857 garLoopResultBuilder]: For program point L14-2(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,024 INFO L857 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,024 INFO L853 garLoopResultBuilder]: At program point L14-4(line 14) the Hoare annotation is: (and (or (and (<= 0 |f_#t~ret0|) (<= |f_#in~x| f_~x) (<= f_~x 2147483645) (<= 1 f_~x) (<= |f_#t~ret0| 0)) (not (<= |f_#in~x| 2147483645))) (not (<= (+ |f_#in~x| 1) 0))) [2021-08-27 10:41:24,024 INFO L857 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,024 INFO L857 garLoopResultBuilder]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point L14-6(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L860 garLoopResultBuilder]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2021-08-27 10:41:24,025 INFO L857 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L19(lines 19 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L853 garLoopResultBuilder]: At program point L20-2(line 20) the Hoare annotation is: (or (not (<= |g_#in~x| 2147483647)) (and (= |g_#in~x| g_~x) (<= 1 g_~x))) [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-4(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L853 garLoopResultBuilder]: At program point L20-6(line 20) the Hoare annotation is: (or (not (<= |g_#in~x| 2147483647)) (and (= |g_#in~x| g_~x) (<= 1 g_~x) (<= |g_#t~ret2| 0) (<= 0 |g_#t~ret2|))) [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-8(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,026 INFO L857 garLoopResultBuilder]: For program point L20-9(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L860 garLoopResultBuilder]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,027 INFO L857 garLoopResultBuilder]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2021-08-27 10:41:24,028 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-27 10:41:24,028 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-27 10:41:24,028 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-27 10:41:24,028 INFO L853 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2021-08-27 10:41:24,028 INFO L857 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2021-08-27 10:41:24,028 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 27) no Hoare annotation was computed. [2021-08-27 10:41:24,031 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 10:41:24,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:41:24 BoogieIcfgContainer [2021-08-27 10:41:24,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 10:41:24,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 10:41:24,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 10:41:24,035 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 10:41:24,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:21" (3/4) ... [2021-08-27 10:41:24,037 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 10:41:24,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2021-08-27 10:41:24,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2021-08-27 10:41:24,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-27 10:41:24,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 10:41:24,082 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 10:41:24,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 10:41:24,084 INFO L168 Benchmark]: Toolchain (without parser) took 3525.67 ms. Allocated memory was 65.0 MB in the beginning and 100.7 MB in the end (delta: 35.7 MB). Free memory was 45.5 MB in the beginning and 61.7 MB in the end (delta: -16.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:24,084 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 65.0 MB. Free memory was 47.1 MB in the beginning and 47.1 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 10:41:24,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.20 ms. Allocated memory is still 65.0 MB. Free memory was 45.3 MB in the beginning and 37.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:24,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.80 ms. Allocated memory is still 65.0 MB. Free memory was 36.8 MB in the beginning and 48.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:24,085 INFO L168 Benchmark]: Boogie Preprocessor took 15.50 ms. Allocated memory is still 65.0 MB. Free memory was 48.8 MB in the beginning and 48.1 MB in the end (delta: 701.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 10:41:24,085 INFO L168 Benchmark]: RCFGBuilder took 310.10 ms. Allocated memory is still 65.0 MB. Free memory was 47.9 MB in the beginning and 35.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:24,086 INFO L168 Benchmark]: TraceAbstraction took 2954.92 ms. Allocated memory was 65.0 MB in the beginning and 100.7 MB in the end (delta: 35.7 MB). Free memory was 35.2 MB in the beginning and 64.9 MB in the end (delta: -29.7 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:24,086 INFO L168 Benchmark]: Witness Printer took 48.17 ms. Allocated memory is still 100.7 MB. Free memory was 63.8 MB in the beginning and 61.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:24,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 65.0 MB. Free memory was 47.1 MB in the beginning and 47.1 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 142.20 ms. Allocated memory is still 65.0 MB. Free memory was 45.3 MB in the beginning and 37.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.80 ms. Allocated memory is still 65.0 MB. Free memory was 36.8 MB in the beginning and 48.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 15.50 ms. Allocated memory is still 65.0 MB. Free memory was 48.8 MB in the beginning and 48.1 MB in the end (delta: 701.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 310.10 ms. Allocated memory is still 65.0 MB. Free memory was 47.9 MB in the beginning and 35.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2954.92 ms. Allocated memory was 65.0 MB in the beginning and 100.7 MB in the end (delta: 35.7 MB). Free memory was 35.2 MB in the beginning and 64.9 MB in the end (delta: -29.7 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. * Witness Printer took 48.17 ms. Allocated memory is still 100.7 MB. Free memory was 63.8 MB in the beginning and 61.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2866.1ms, OverallIterations: 9, TraceHistogramMax: 6, EmptinessCheckTime: 15.6ms, AutomataDifference: 858.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 169.6ms, InitialAbstractionConstructionTime: 18.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 275 SDtfs, 209 SDslu, 843 SDs, 0 SdLazy, 474 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 347.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 394.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 113.5ms AutomataMinimizationTime, 9 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 7 LocationsWithAnnotation, 64 PreInvPairs, 76 NumberOfFragments, 85 HoareAnnotationTreeSize, 64 FomulaSimplifications, 69 FormulaSimplificationTreeSizeReduction, 53.4ms HoareSimplificationTime, 7 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 106.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 16.3ms SsaConstructionTime, 159.0ms SatisfiabilityAnalysisTime, 1053.8ms InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 557 SizeOfPredicates, 2 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 167/171 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 10:41:24,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...