./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 30f4e4ab 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.24-30f4e4a [2019-11-28 02:51:00,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:51:00,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:51:00,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:51:00,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:51:00,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:51:00,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:51:00,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:51:00,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:51:00,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:51:00,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:51:00,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:51:00,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:51:00,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:51:00,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:51:00,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:51:00,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:51:00,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:51:00,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:51:00,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:51:00,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:51:00,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:51:00,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:51:00,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:51:00,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:51:00,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:51:00,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:51:00,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:51:00,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:51:00,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:51:00,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:51:00,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:51:00,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:51:00,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:51:00,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:51:00,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:51:00,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:51:00,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:51:00,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:51:00,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:51:00,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:51:00,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:51:00,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:51:00,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:51:00,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:51:00,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:51:00,232 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:51:00,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:51:00,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:51:00,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:51:00,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:51:00,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:51:00,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:51:00,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:51:00,237 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:51:00,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:51:00,238 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:51:00,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:51:00,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:51:00,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:51:00,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:51:00,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:51:00,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:51:00,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:51:00,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:51:00,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:51:00,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:51:00,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:51:00,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:51:00,242 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 02:51:00,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:51:00,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:51:00,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:51:00,620 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:51:00,620 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:51:00,621 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 02:51:00,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b686075c/5c7cd48b1b9045f1b6cf8ad891b50444/FLAG9664fa372 [2019-11-28 02:51:01,113 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:51:01,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-28 02:51:01,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b686075c/5c7cd48b1b9045f1b6cf8ad891b50444/FLAG9664fa372 [2019-11-28 02:51:01,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b686075c/5c7cd48b1b9045f1b6cf8ad891b50444 [2019-11-28 02:51:01,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:51:01,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:51:01,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:51:01,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:51:01,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:51:01,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f7d783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01, skipping insertion in model container [2019-11-28 02:51:01,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:51:01,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:51:01,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:51:01,759 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:51:01,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:51:01,795 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:51:01,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01 WrapperNode [2019-11-28 02:51:01,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:51:01,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:51:01,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:51:01,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:51:01,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:51:01,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:51:01,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:51:01,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:51:01,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2019-11-28 02:51:01,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:51:01,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:51:01,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:51:01,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:51:01,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (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 02:51:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:51:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:51:02,242 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:51:02,243 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:51:02,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:51:02 BoogieIcfgContainer [2019-11-28 02:51:02,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:51:02,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:51:02,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:51:02,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:51:02,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:51:01" (1/3) ... [2019-11-28 02:51:02,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649f0e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:51:02, skipping insertion in model container [2019-11-28 02:51:02,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (2/3) ... [2019-11-28 02:51:02,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649f0e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:51:02, skipping insertion in model container [2019-11-28 02:51:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:51:02" (3/3) ... [2019-11-28 02:51:02,277 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-28 02:51:02,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:51:02,321 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:51:02,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:51:02,376 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:51:02,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:51:02,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:51:02,377 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:51:02,377 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:51:02,377 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:51:02,377 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:51:02,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:51:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-28 02:51:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 02:51:02,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:02,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 02:51:02,398 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 02:51:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-11-28 02:51:02,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:02,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030529988] [2019-11-28 02:51:02,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:02,593 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 02:51:02,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030529988] [2019-11-28 02:51:02,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:02,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:51:02,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121796907] [2019-11-28 02:51:02,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:51:02,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:51:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:51:02,633 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-28 02:51:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:02,829 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-28 02:51:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:51:02,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-28 02:51:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:02,843 INFO L225 Difference]: With dead ends: 53 [2019-11-28 02:51:02,844 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 02:51:02,847 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 02:51:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 02:51:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2019-11-28 02:51:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:51:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-28 02:51:02,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 3 [2019-11-28 02:51:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:02,884 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-28 02:51:02,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:51:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-28 02:51:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 02:51:02,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:02,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 02:51:02,885 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 02:51:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 957477, now seen corresponding path program 1 times [2019-11-28 02:51:02,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:02,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245294905] [2019-11-28 02:51:02,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:02,930 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 02:51:02,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245294905] [2019-11-28 02:51:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:51:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161512134] [2019-11-28 02:51:02,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:51:02,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:51:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:51:02,935 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2019-11-28 02:51:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,060 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-28 02:51:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:51:03,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-28 02:51:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,062 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:51:03,063 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 02:51:03,064 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 02:51:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 02:51:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-11-28 02:51:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:51:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-28 02:51:03,073 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 4 [2019-11-28 02:51:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,074 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-28 02:51:03,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:51:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-28 02:51:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:51:03,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,076 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 02:51:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash -511748973, now seen corresponding path program 1 times [2019-11-28 02:51:03,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117807874] [2019-11-28 02:51:03,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,133 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 02:51:03,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117807874] [2019-11-28 02:51:03,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:51:03,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369039549] [2019-11-28 02:51:03,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:51:03,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:51:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:51:03,136 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-11-28 02:51:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,258 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2019-11-28 02:51:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:51:03,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-28 02:51:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,260 INFO L225 Difference]: With dead ends: 79 [2019-11-28 02:51:03,260 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:51:03,261 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 02:51:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:51:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-28 02:51:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:51:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2019-11-28 02:51:03,274 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 8 [2019-11-28 02:51:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,274 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2019-11-28 02:51:03,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:51:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2019-11-28 02:51:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:51:03,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,276 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 02:51:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -511749165, now seen corresponding path program 1 times [2019-11-28 02:51:03,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790175735] [2019-11-28 02:51:03,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,332 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 02:51:03,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790175735] [2019-11-28 02:51:03,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:51:03,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033687227] [2019-11-28 02:51:03,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:51:03,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:51:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:51:03,335 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand 4 states. [2019-11-28 02:51:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,394 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2019-11-28 02:51:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:51:03,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:51:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,396 INFO L225 Difference]: With dead ends: 96 [2019-11-28 02:51:03,396 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 02:51:03,397 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 02:51:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 02:51:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-28 02:51:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:51:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-28 02:51:03,406 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2019-11-28 02:51:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,406 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 02:51:03,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:51:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-28 02:51:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:51:03,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,408 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 02:51:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1315651091, now seen corresponding path program 1 times [2019-11-28 02:51:03,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987597734] [2019-11-28 02:51:03,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,444 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 02:51:03,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987597734] [2019-11-28 02:51:03,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:51:03,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660077970] [2019-11-28 02:51:03,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:51:03,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:51:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:51:03,446 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2019-11-28 02:51:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,472 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-28 02:51:03,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:51:03,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 02:51:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,474 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:51:03,474 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 02:51:03,475 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 02:51:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 02:51:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 02:51:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:51:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-28 02:51:03,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2019-11-28 02:51:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,482 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-28 02:51:03,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:51:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-11-28 02:51:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:51:03,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,484 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 02:51:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076497, now seen corresponding path program 1 times [2019-11-28 02:51:03,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389623945] [2019-11-28 02:51:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,517 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 02:51:03,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389623945] [2019-11-28 02:51:03,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:51:03,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117395097] [2019-11-28 02:51:03,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:51:03,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:51:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:51:03,520 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2019-11-28 02:51:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,557 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-28 02:51:03,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:51:03,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:51:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,559 INFO L225 Difference]: With dead ends: 75 [2019-11-28 02:51:03,560 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:51:03,560 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 02:51:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:51:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-28 02:51:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:51:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-28 02:51:03,565 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2019-11-28 02:51:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,566 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-28 02:51:03,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:51:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-28 02:51:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:51:03,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,567 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 02:51:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076689, now seen corresponding path program 1 times [2019-11-28 02:51:03,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557972735] [2019-11-28 02:51:03,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,633 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 02:51:03,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557972735] [2019-11-28 02:51:03,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:51:03,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736305037] [2019-11-28 02:51:03,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:51:03,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:51:03,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:51:03,637 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 5 states. [2019-11-28 02:51:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,743 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-28 02:51:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:51:03,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 02:51:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,745 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:51:03,745 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:51:03,746 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 02:51:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:51:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-28 02:51:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 02:51:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-28 02:51:03,753 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 10 [2019-11-28 02:51:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,754 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-28 02:51:03,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:51:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-28 02:51:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:51:03,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,756 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 02:51:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1142867855, now seen corresponding path program 1 times [2019-11-28 02:51:03,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961387601] [2019-11-28 02:51:03,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,800 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 02:51:03,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961387601] [2019-11-28 02:51:03,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:51:03,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891120941] [2019-11-28 02:51:03,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:51:03,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:51:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:51:03,803 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-11-28 02:51:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,823 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-11-28 02:51:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:51:03,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 02:51:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,826 INFO L225 Difference]: With dead ends: 44 [2019-11-28 02:51:03,826 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 02:51:03,827 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 02:51:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 02:51:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 02:51:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:51:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-28 02:51:03,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 11 [2019-11-28 02:51:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,832 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 02:51:03,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:51:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-11-28 02:51:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:51:03,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,834 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,834 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 02:51:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1620314709, now seen corresponding path program 1 times [2019-11-28 02:51:03,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020957248] [2019-11-28 02:51:03,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:03,894 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 02:51:03,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020957248] [2019-11-28 02:51:03,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:03,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:51:03,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676929088] [2019-11-28 02:51:03,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:51:03,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:51:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:51:03,897 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2019-11-28 02:51:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:03,971 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-11-28 02:51:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:51:03,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 02:51:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:03,973 INFO L225 Difference]: With dead ends: 56 [2019-11-28 02:51:03,973 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 02:51:03,974 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 02:51:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 02:51:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 02:51:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 02:51:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 02:51:03,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2019-11-28 02:51:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:03,988 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 02:51:03,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:51:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 02:51:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:51:03,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:51:03,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:51:03,990 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 02:51:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:51:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1069165097, now seen corresponding path program 1 times [2019-11-28 02:51:03,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:51:03,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504361112] [2019-11-28 02:51:03,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:51:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:51:04,057 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 02:51:04,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504361112] [2019-11-28 02:51:04,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:51:04,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:51:04,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370384736] [2019-11-28 02:51:04,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:51:04,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:51:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:51:04,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:51:04,060 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-11-28 02:51:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:51:04,116 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 02:51:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:51:04,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:51:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:51:04,117 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:51:04,117 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:51:04,118 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 02:51:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:51:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:51:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:51:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:51:04,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-11-28 02:51:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:51:04,119 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:51:04,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:51:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:51:04,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:51:04,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:51:04,224 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,224 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:51:04,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:51:04,225 INFO L246 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-11-28 02:51:04,225 INFO L246 CegarLoopResult]: For program point L17(lines 17 25) no Hoare annotation was computed. [2019-11-28 02:51:04,225 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 02:51:04,226 INFO L246 CegarLoopResult]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2019-11-28 02:51:04,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-28 02:51:04,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:51:04,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:51:04,227 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:51:04,227 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 02:51:04,228 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-28 02:51:04,228 INFO L246 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-28 02:51:04,228 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 02:51:04,228 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 02:51:04,229 INFO L246 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,229 INFO L246 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,229 INFO L246 CegarLoopResult]: For program point L18-4(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,229 INFO L246 CegarLoopResult]: For program point L18-5(line 18) no Hoare annotation was computed. [2019-11-28 02:51:04,229 INFO L246 CegarLoopResult]: For program point L18-6(lines 18 24) no Hoare annotation was computed. [2019-11-28 02:51:04,230 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-28 02:51:04,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:51:04 BoogieIcfgContainer [2019-11-28 02:51:04,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:51:04,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:51:04,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:51:04,252 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:51:04,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:51:02" (3/4) ... [2019-11-28 02:51:04,257 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:51:04,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:51:04,271 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:51:04,328 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:51:04,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:51:04,331 INFO L168 Benchmark]: Toolchain (without parser) took 2798.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 968.0 MB in the end (delta: -11.7 MB). Peak memory consumption was 139.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:51:04,337 INFO L168 Benchmark]: CDTParser took 1.52 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 02:51:04,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.02 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 02:51:04,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:51:04,340 INFO L168 Benchmark]: Boogie Preprocessor took 33.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:51:04,342 INFO L168 Benchmark]: RCFGBuilder took 287.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:51:04,344 INFO L168 Benchmark]: TraceAbstraction took 1993.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.0 MB in the end (delta: 155.3 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:51:04,345 INFO L168 Benchmark]: Witness Printer took 77.19 ms. Allocated memory is still 1.2 GB. Free memory is still 968.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:51:04,351 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 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 263.02 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 127.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 287.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1993.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.0 MB in the end (delta: 155.3 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. * Witness Printer took 77.19 ms. Allocated memory is still 1.2 GB. Free memory is still 968.0 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.7s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 87 SDtfs, 260 SDslu, 39 SDs, 0 SdLazy, 342 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s 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.0s 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...