./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction_true-termination_true-no-overflow.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 85017c4a5a64f245bd703090448e8d5785d54b75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:39:04,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:39:04,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:39:04,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:39:04,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:39:04,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:39:04,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:39:04,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:39:04,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:39:04,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:39:04,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:39:04,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:39:04,324 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:39:04,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:39:04,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:39:04,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:39:04,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:39:04,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:39:04,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:39:04,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:39:04,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:39:04,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:39:04,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:39:04,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:39:04,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:39:04,344 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:39:04,345 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:39:04,346 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:39:04,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:39:04,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:39:04,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:39:04,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:39:04,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:39:04,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:39:04,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:39:04,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:39:04,354 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:39:04,370 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:39:04,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:39:04,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:39:04,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:39:04,372 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:39:04,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:39:04,372 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:39:04,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:39:04,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:39:04,374 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:39:04,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:39:04,374 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:39:04,374 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:39:04,374 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:39:04,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:39:04,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:39:04,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:39:04,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:39:04,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:39:04,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:39:04,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:39:04,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:39:04,377 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:39:04,377 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:39:04,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:39:04,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:39:04,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 85017c4a5a64f245bd703090448e8d5785d54b75 [2019-01-14 21:39:04,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:39:04,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:39:04,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:39:04,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:39:04,458 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:39:04,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction_true-termination_true-no-overflow.c [2019-01-14 21:39:04,525 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b26ee6d/c0940cdfefd642bfad93a2358470716f/FLAG8514500db [2019-01-14 21:39:04,987 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:39:04,989 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction_true-termination_true-no-overflow.c [2019-01-14 21:39:04,997 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b26ee6d/c0940cdfefd642bfad93a2358470716f/FLAG8514500db [2019-01-14 21:39:05,335 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b26ee6d/c0940cdfefd642bfad93a2358470716f [2019-01-14 21:39:05,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:39:05,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:39:05,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:39:05,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:39:05,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:39:05,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7129d1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05, skipping insertion in model container [2019-01-14 21:39:05,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:39:05,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:39:05,541 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:39:05,545 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:39:05,560 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:39:05,574 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:39:05,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05 WrapperNode [2019-01-14 21:39:05,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:39:05,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:39:05,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:39:05,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:39:05,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:39:05,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:39:05,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:39:05,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:39:05,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (1/1) ... [2019-01-14 21:39:05,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:39:05,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:39:05,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:39:05,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:39:05,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (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-01-14 21:39:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:39:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:39:05,895 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:39:05,896 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 21:39:05,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:39:05 BoogieIcfgContainer [2019-01-14 21:39:05,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:39:05,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:39:05,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:39:05,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:39:05,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:39:05" (1/3) ... [2019-01-14 21:39:05,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6436e4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:39:05, skipping insertion in model container [2019-01-14 21:39:05,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:05" (2/3) ... [2019-01-14 21:39:05,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6436e4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:39:05, skipping insertion in model container [2019-01-14 21:39:05,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:39:05" (3/3) ... [2019-01-14 21:39:05,905 INFO L112 eAbstractionObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Introduction_true-termination_true-no-overflow.c [2019-01-14 21:39:05,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:39:05,923 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:39:05,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:39:05,971 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:39:05,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:39:05,972 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:39:05,972 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:39:05,972 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:39:05,972 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:39:05,973 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:39:05,973 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:39:05,973 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:39:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-01-14 21:39:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 21:39:05,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:05,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 21:39:05,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-14 21:39:06,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:06,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:06,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:39:06,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:39:06,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:39:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:39:06,206 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-01-14 21:39:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:06,368 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-14 21:39:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:39:06,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-14 21:39:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:06,381 INFO L225 Difference]: With dead ends: 26 [2019-01-14 21:39:06,381 INFO L226 Difference]: Without dead ends: 13 [2019-01-14 21:39:06,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-14 21:39:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-14 21:39:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-14 21:39:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 21:39:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-14 21:39:06,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 3 [2019-01-14 21:39:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:06,426 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-14 21:39:06,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:39:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-14 21:39:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:39:06,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:06,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:39:06,429 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-14 21:39:06,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:06,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:06,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:06,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:39:06,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:39:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:39:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:39:06,621 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-01-14 21:39:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:06,735 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-14 21:39:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:39:06,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-14 21:39:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:06,737 INFO L225 Difference]: With dead ends: 17 [2019-01-14 21:39:06,738 INFO L226 Difference]: Without dead ends: 15 [2019-01-14 21:39:06,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:39:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-14 21:39:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 21:39:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 21:39:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-14 21:39:06,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2019-01-14 21:39:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:06,745 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-14 21:39:06,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:39:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-14 21:39:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:39:06,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:06,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:39:06,746 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-01-14 21:39:06,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:06,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:06,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:39:06,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:39:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:39:06,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:39:06,794 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-01-14 21:39:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:06,833 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-14 21:39:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:39:06,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 21:39:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:06,835 INFO L225 Difference]: With dead ends: 14 [2019-01-14 21:39:06,835 INFO L226 Difference]: Without dead ends: 13 [2019-01-14 21:39:06,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-14 21:39:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-14 21:39:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 21:39:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 21:39:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-14 21:39:06,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2019-01-14 21:39:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:06,839 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-14 21:39:06,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:39:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-14 21:39:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:39:06,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:06,840 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 21:39:06,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 577431471, now seen corresponding path program 1 times [2019-01-14 21:39:06,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:07,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:39:07,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:39:07,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:07,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:39:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:07,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:39:07,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-14 21:39:07,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:39:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:39:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:39:07,373 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-01-14 21:39:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:07,549 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-14 21:39:07,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:39:07,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-14 21:39:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:07,550 INFO L225 Difference]: With dead ends: 14 [2019-01-14 21:39:07,551 INFO L226 Difference]: Without dead ends: 13 [2019-01-14 21:39:07,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:39:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-14 21:39:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-14 21:39:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 21:39:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-14 21:39:07,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2019-01-14 21:39:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:07,555 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-14 21:39:07,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:39:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-14 21:39:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:39:07,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:07,556 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 21:39:07,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash 720506461, now seen corresponding path program 1 times [2019-01-14 21:39:07,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:07,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:07,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:39:07,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:39:07,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:07,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:39:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:39:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2019-01-14 21:39:07,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:39:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:39:07,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:39:07,795 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-14 21:39:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:08,014 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-14 21:39:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:39:08,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-14 21:39:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:08,017 INFO L225 Difference]: With dead ends: 23 [2019-01-14 21:39:08,017 INFO L226 Difference]: Without dead ends: 21 [2019-01-14 21:39:08,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:39:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-14 21:39:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 21:39:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 21:39:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-14 21:39:08,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 9 [2019-01-14 21:39:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:08,023 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-14 21:39:08,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:39:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-14 21:39:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:39:08,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:08,024 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-14 21:39:08,025 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1716869967, now seen corresponding path program 1 times [2019-01-14 21:39:08,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:08,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:08,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:39:08,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:39:08,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:08,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:39:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:08,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:39:08,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:39:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:39:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:39:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:39:08,417 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2019-01-14 21:39:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:08,500 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-14 21:39:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:39:08,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 21:39:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:08,503 INFO L225 Difference]: With dead ends: 28 [2019-01-14 21:39:08,503 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 21:39:08,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:39:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 21:39:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 21:39:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 21:39:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-14 21:39:08,509 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-14 21:39:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:08,510 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-14 21:39:08,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:39:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-14 21:39:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 21:39:08,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:08,511 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-14 21:39:08,512 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash -333652957, now seen corresponding path program 2 times [2019-01-14 21:39:08,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:08,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:08,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:08,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:39:08,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:39:08,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:39:08,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:39:08,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:39:08,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:39:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:08,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:39:08,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 21:39:08,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:39:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:39:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:39:08,737 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 7 states. [2019-01-14 21:39:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:08,827 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-14 21:39:08,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:39:08,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-14 21:39:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:08,829 INFO L225 Difference]: With dead ends: 33 [2019-01-14 21:39:08,830 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 21:39:08,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:39:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 21:39:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-14 21:39:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 21:39:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-14 21:39:08,838 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-14 21:39:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:08,839 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-14 21:39:08,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:39:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-14 21:39:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 21:39:08,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:08,842 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-14 21:39:08,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash -302154767, now seen corresponding path program 3 times [2019-01-14 21:39:08,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:08,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:08,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:39:08,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:09,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:39:09,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:39:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:39:09,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 21:39:09,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:39:09,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:39:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:39:09,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:39:09,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 14 [2019-01-14 21:39:09,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 21:39:09,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 21:39:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-14 21:39:09,451 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 15 states. [2019-01-14 21:39:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:10,558 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-14 21:39:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 21:39:10,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-01-14 21:39:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:10,561 INFO L225 Difference]: With dead ends: 38 [2019-01-14 21:39:10,561 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:39:10,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=384, Invalid=876, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:39:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:39:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:39:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:39:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:39:10,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-14 21:39:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:10,563 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:39:10,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 21:39:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:39:10,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:39:10,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:39:10,692 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-14 21:39:10,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:39:10,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:39:10,693 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-14 21:39:10,693 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-01-14 21:39:10,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:39:10,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:39:10,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:39:10,694 INFO L451 ceAbstractionStarter]: At program point L22(lines 14 23) the Hoare annotation is: true [2019-01-14 21:39:10,694 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 21:39:10,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-14 21:39:10,694 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 21:39:10,695 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 21) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0))) (or (and (exists ((v_ULTIMATE.start_main_~y~0_25 Int)) (and (<= (+ (* 2 v_ULTIMATE.start_main_~y~0_25) ULTIMATE.start_main_~x~0) 2147483648) (<= ULTIMATE.start_main_~y~0 (+ v_ULTIMATE.start_main_~y~0_25 1)))) .cse0 (<= ULTIMATE.start_main_~y~0 2147483647) (<= ULTIMATE.start_main_~x~0 2147483646)) (and (<= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 2147483646)) .cse0))) [2019-01-14 21:39:10,695 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 21) no Hoare annotation was computed. [2019-01-14 21:39:10,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:39:10 BoogieIcfgContainer [2019-01-14 21:39:10,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:39:10,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:39:10,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:39:10,710 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:39:10,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:39:05" (3/4) ... [2019-01-14 21:39:10,713 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:39:10,723 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:39:10,723 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:39:10,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_ULTIMATE.start_main_~y~0_25 : int :: 2 * v_ULTIMATE.start_main_~y~0_25 + x <= 2147483648 && y <= v_ULTIMATE.start_main_~y~0_25 + 1) && 1 <= y) && y <= 2147483647) && x <= 2147483646) || ((y <= 1 && x <= y + 2147483646) && 1 <= y) [2019-01-14 21:39:10,762 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:39:10,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:39:10,763 INFO L168 Benchmark]: Toolchain (without parser) took 5425.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.3 MB in the beginning and 838.2 MB in the end (delta: 109.1 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:10,765 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:39:10,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.97 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:10,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.64 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:39:10,767 INFO L168 Benchmark]: Boogie Preprocessor took 15.16 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:39:10,767 INFO L168 Benchmark]: RCFGBuilder took 273.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:10,768 INFO L168 Benchmark]: TraceAbstraction took 4810.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 838.2 MB in the end (delta: 256.2 MB). Peak memory consumption was 256.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:10,769 INFO L168 Benchmark]: Witness Printer took 52.72 ms. Allocated memory is still 1.1 GB. Free memory is still 838.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:39:10,773 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.97 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 33.64 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.16 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 273.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4810.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 838.2 MB in the end (delta: 256.2 MB). Peak memory consumption was 256.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.72 ms. Allocated memory is still 1.1 GB. Free memory is still 838.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2019-01-14 21:39:10,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-14 21:39:10,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] Derived loop invariant: ((((\exists v_ULTIMATE.start_main_~y~0_25 : int :: 2 * v_ULTIMATE.start_main_~y~0_25 + x <= 2147483648 && y <= v_ULTIMATE.start_main_~y~0_25 + 1) && 1 <= y) && y <= 2147483647) && x <= 2147483646) || ((y <= 1 && x <= y + 2147483646) && 1 <= y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 4 error locations. SAFE Result, 4.7s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 105 SDslu, 16 SDs, 0 SdLazy, 196 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 38 HoareAnnotationTreeSize, 2 FomulaSimplifications, 141 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 77 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 197 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 184 ConstructedInterpolants, 4 QuantifiedInterpolants, 12794 SizeOfPredicates, 2 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 54/296 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...