./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-lit/AliasDarteFeautrierGonnord-SAS2010-wise.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 4c761fb15c9d367876fc9f1553874e9680fa1668 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:23:32,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:23:32,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:23:32,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:23:32,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:23:32,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:23:32,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:23:32,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:23:32,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:23:32,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:23:32,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:23:32,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:23:32,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:23:32,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:23:32,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:23:32,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:23:32,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:23:32,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:23:32,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:23:32,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:23:32,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:23:32,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:23:32,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:23:32,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:23:32,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:23:32,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:23:32,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:23:32,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:23:32,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:23:32,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:23:32,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:23:32,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:23:32,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:23:32,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:23:32,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:23:32,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:23:32,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:23:32,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:23:32,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:23:32,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:23:32,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:23:32,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:23:32,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:23:32,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:23:32,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:23:32,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:23:32,732 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:23:32,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:23:32,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:23:32,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:23:32,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:23:32,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:23:32,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:23:32,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:23:32,735 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:23:32,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:23:32,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:23:32,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:23:32,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:23:32,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:23:32,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:23:32,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:23:32,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:23:32,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:23:32,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:23:32,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:23:32,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:23:32,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:23:32,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:23:32,738 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:23:32,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2019-11-28 20:23:33,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:23:33,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:23:33,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:23:33,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:23:33,089 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:23:33,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-28 20:23:33,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b379df5bc/682e64e21cf2450ab8406ea7acc2329e/FLAG3df780cb9 [2019-11-28 20:23:33,650 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:23:33,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-28 20:23:33,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b379df5bc/682e64e21cf2450ab8406ea7acc2329e/FLAG3df780cb9 [2019-11-28 20:23:34,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b379df5bc/682e64e21cf2450ab8406ea7acc2329e [2019-11-28 20:23:34,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:23:34,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:23:34,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:23:34,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:23:34,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:23:34,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14911ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34, skipping insertion in model container [2019-11-28 20:23:34,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:23:34,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:23:34,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:23:34,203 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:23:34,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:23:34,242 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:23:34,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34 WrapperNode [2019-11-28 20:23:34,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:23:34,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:23:34,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:23:34,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:23:34,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:23:34,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:23:34,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:23:34,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:23:34,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... [2019-11-28 20:23:34,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:23:34,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:23:34,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:23:34,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:23:34,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:23:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:23:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:23:34,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:23:34,629 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:23:34,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:34 BoogieIcfgContainer [2019-11-28 20:23:34,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:23:34,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:23:34,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:23:34,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:23:34,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:23:34" (1/3) ... [2019-11-28 20:23:34,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191bd96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:34, skipping insertion in model container [2019-11-28 20:23:34,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:34" (2/3) ... [2019-11-28 20:23:34,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191bd96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:34, skipping insertion in model container [2019-11-28 20:23:34,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:34" (3/3) ... [2019-11-28 20:23:34,645 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-28 20:23:34,661 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:23:34,671 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:23:34,708 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:23:34,746 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:23:34,747 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:23:34,747 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:23:34,747 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:23:34,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:23:34,748 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:23:34,748 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:23:34,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:23:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-28 20:23:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 20:23:34,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:34,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 20:23:34,771 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-11-28 20:23:34,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:34,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695441861] [2019-11-28 20:23:34,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:34,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695441861] [2019-11-28 20:23:34,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:34,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:34,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753012479] [2019-11-28 20:23:34,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:34,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:34,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:34,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:34,967 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-28 20:23:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:35,134 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-28 20:23:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:23:35,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-28 20:23:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:35,153 INFO L225 Difference]: With dead ends: 53 [2019-11-28 20:23:35,153 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 20:23:35,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 20:23:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2019-11-28 20:23:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:23:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-28 20:23:35,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 3 [2019-11-28 20:23:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:35,205 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-28 20:23:35,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-28 20:23:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 20:23:35,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:35,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 20:23:35,207 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash 957477, now seen corresponding path program 1 times [2019-11-28 20:23:35,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:35,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295358502] [2019-11-28 20:23:35,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:35,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295358502] [2019-11-28 20:23:35,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:35,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:35,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664913115] [2019-11-28 20:23:35,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:35,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:35,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:35,249 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2019-11-28 20:23:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:35,408 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-28 20:23:35,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:23:35,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-28 20:23:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:35,411 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:23:35,411 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 20:23:35,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 20:23:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-11-28 20:23:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:23:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-28 20:23:35,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 4 [2019-11-28 20:23:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:35,428 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-28 20:23:35,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-28 20:23:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:23:35,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:35,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:35,430 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -511748973, now seen corresponding path program 1 times [2019-11-28 20:23:35,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:35,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158595956] [2019-11-28 20:23:35,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:35,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158595956] [2019-11-28 20:23:35,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:35,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:23:35,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475249856] [2019-11-28 20:23:35,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:23:35,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:35,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:23:35,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:35,532 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-11-28 20:23:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:35,653 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2019-11-28 20:23:35,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:23:35,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-28 20:23:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:35,655 INFO L225 Difference]: With dead ends: 79 [2019-11-28 20:23:35,656 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 20:23:35,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:23:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 20:23:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-28 20:23:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:23:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2019-11-28 20:23:35,669 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 8 [2019-11-28 20:23:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:35,669 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2019-11-28 20:23:35,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:23:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2019-11-28 20:23:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:23:35,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:35,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:35,671 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -511749165, now seen corresponding path program 1 times [2019-11-28 20:23:35,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:35,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925465650] [2019-11-28 20:23:35,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:35,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925465650] [2019-11-28 20:23:35,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:35,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:23:35,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881921631] [2019-11-28 20:23:35,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:35,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:35,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:35,716 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand 4 states. [2019-11-28 20:23:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:35,789 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2019-11-28 20:23:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:23:35,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:23:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:35,791 INFO L225 Difference]: With dead ends: 96 [2019-11-28 20:23:35,791 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 20:23:35,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 20:23:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-28 20:23:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:23:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-28 20:23:35,812 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2019-11-28 20:23:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:35,813 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 20:23:35,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-28 20:23:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:23:35,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:35,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:35,815 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1315651091, now seen corresponding path program 1 times [2019-11-28 20:23:35,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:35,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936239888] [2019-11-28 20:23:35,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:35,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936239888] [2019-11-28 20:23:35,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:35,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:35,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550571109] [2019-11-28 20:23:35,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:35,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:35,868 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2019-11-28 20:23:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:35,905 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-28 20:23:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:35,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 20:23:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:35,907 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:23:35,909 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:23:35,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:23:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 20:23:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:23:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-28 20:23:35,927 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2019-11-28 20:23:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:35,929 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-28 20:23:35,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-11-28 20:23:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:23:35,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:35,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:35,932 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076497, now seen corresponding path program 1 times [2019-11-28 20:23:35,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:35,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803700147] [2019-11-28 20:23:35,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:35,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803700147] [2019-11-28 20:23:35,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:35,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:23:35,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956539399] [2019-11-28 20:23:35,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:35,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:35,997 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2019-11-28 20:23:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:36,048 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-28 20:23:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:23:36,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:23:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:36,052 INFO L225 Difference]: With dead ends: 75 [2019-11-28 20:23:36,052 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:23:36,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:23:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-28 20:23:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 20:23:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-28 20:23:36,063 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2019-11-28 20:23:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:36,064 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-28 20:23:36,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-28 20:23:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:23:36,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:36,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:36,065 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076689, now seen corresponding path program 1 times [2019-11-28 20:23:36,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:36,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751962622] [2019-11-28 20:23:36,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:36,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751962622] [2019-11-28 20:23:36,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:36,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:23:36,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023096855] [2019-11-28 20:23:36,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:23:36,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:23:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:36,130 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 5 states. [2019-11-28 20:23:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:36,238 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-28 20:23:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:23:36,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 20:23:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:36,240 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:23:36,240 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:23:36,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:23:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:23:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-28 20:23:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 20:23:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-28 20:23:36,251 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 10 [2019-11-28 20:23:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:36,251 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-28 20:23:36,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:23:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-28 20:23:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:23:36,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:36,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:36,253 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1142867855, now seen corresponding path program 1 times [2019-11-28 20:23:36,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:36,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188015004] [2019-11-28 20:23:36,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:36,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188015004] [2019-11-28 20:23:36,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:36,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:36,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150689611] [2019-11-28 20:23:36,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:36,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:36,296 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-11-28 20:23:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:36,318 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-11-28 20:23:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:36,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 20:23:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:36,321 INFO L225 Difference]: With dead ends: 44 [2019-11-28 20:23:36,321 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:23:36,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:23:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:23:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:23:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-28 20:23:36,331 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 11 [2019-11-28 20:23:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:36,332 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 20:23:36,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-11-28 20:23:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:23:36,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:36,334 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:36,334 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1620314709, now seen corresponding path program 1 times [2019-11-28 20:23:36,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:36,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884440895] [2019-11-28 20:23:36,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:36,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884440895] [2019-11-28 20:23:36,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:36,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:23:36,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497623928] [2019-11-28 20:23:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:23:36,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:23:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:36,385 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2019-11-28 20:23:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:36,460 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-11-28 20:23:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:23:36,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:23:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:36,461 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:23:36,461 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 20:23:36,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:23:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 20:23:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 20:23:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:23:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 20:23:36,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2019-11-28 20:23:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:36,466 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 20:23:36,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:23:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 20:23:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:23:36,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:36,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:36,467 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:36,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1069165097, now seen corresponding path program 1 times [2019-11-28 20:23:36,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:36,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318029811] [2019-11-28 20:23:36,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:36,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318029811] [2019-11-28 20:23:36,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:36,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:23:36,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274597526] [2019-11-28 20:23:36,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:23:36,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:36,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:23:36,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:36,514 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-11-28 20:23:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:36,572 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 20:23:36,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:23:36,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:23:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:36,575 INFO L225 Difference]: With dead ends: 28 [2019-11-28 20:23:36,575 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:23:36,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:23:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:23:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:23:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:23:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:23:36,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-11-28 20:23:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:36,577 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:23:36,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:23:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:23:36,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:23:36,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:23:36,665 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,665 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:23:36,665 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,665 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:23:36,666 INFO L246 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-11-28 20:23:36,666 INFO L246 CegarLoopResult]: For program point L17(lines 17 25) no Hoare annotation was computed. [2019-11-28 20:23:36,666 INFO L242 CegarLoopResult]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~y~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) [2019-11-28 20:23:36,666 INFO L246 CegarLoopResult]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2019-11-28 20:23:36,666 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-28 20:23:36,666 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,667 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,667 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:23:36,668 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:23:36,668 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:23:36,668 INFO L242 CegarLoopResult]: At program point L26(lines 13 27) the Hoare annotation is: (or (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 2147483647))) [2019-11-28 20:23:36,668 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-28 20:23:36,669 INFO L246 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-28 20:23:36,669 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 20:23:36,669 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 20:23:36,669 INFO L246 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,670 INFO L246 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,670 INFO L246 CegarLoopResult]: For program point L18-4(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,670 INFO L246 CegarLoopResult]: For program point L18-5(line 18) no Hoare annotation was computed. [2019-11-28 20:23:36,670 INFO L246 CegarLoopResult]: For program point L18-6(lines 18 24) no Hoare annotation was computed. [2019-11-28 20:23:36,670 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-28 20:23:36,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:23:36 BoogieIcfgContainer [2019-11-28 20:23:36,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:23:36,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:23:36,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:23:36,689 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:23:36,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:34" (3/4) ... [2019-11-28 20:23:36,695 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:23:36,705 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:23:36,705 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:23:36,753 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:23:36,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:23:36,756 INFO L168 Benchmark]: Toolchain (without parser) took 2749.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 956.3 MB in the beginning and 891.6 MB in the end (delta: 64.7 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:36,757 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:23:36,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.67 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:36,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -121.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:36,759 INFO L168 Benchmark]: Boogie Preprocessor took 25.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:36,759 INFO L168 Benchmark]: RCFGBuilder took 269.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:36,760 INFO L168 Benchmark]: TraceAbstraction took 2055.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 891.6 MB in the end (delta: 157.0 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:36,760 INFO L168 Benchmark]: Witness Printer took 65.09 ms. Allocated memory is still 1.1 GB. Free memory is still 891.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:23:36,768 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.67 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -121.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2055.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 891.6 MB in the end (delta: 157.0 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.09 ms. Allocated memory is still 1.1 GB. Free memory is still 891.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x <= 2147483647 || x <= y + 2147483647 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((x <= 2147483647 && y <= 2147483647) && 0 <= x) && 0 <= y - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 8 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 260 SDslu, 39 SDs, 0 SdLazy, 342 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 22 HoareAnnotationTreeSize, 2 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 2067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...