./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1-modified_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa 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/BradleyMannaSipma-CAV2005-Fig1-modified_false-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 f55c3c29f65baba8ba49ec35fe2e62008dfb74b3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:47:01,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:47:01,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:47:01,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:47:01,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:47:01,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:47:01,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:47:01,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:47:01,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:47:01,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:47:01,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:47:01,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:47:01,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:47:01,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:47:01,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:47:01,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:47:01,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:47:01,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:47:01,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:47:01,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:47:01,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:47:01,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:47:01,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:47:01,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:47:01,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:47:01,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:47:01,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:47:01,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:47:01,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:47:01,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:47:01,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:47:01,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:47:01,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:47:01,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:47:01,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:47:01,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:47:01,956 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:47:01,982 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:47:01,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:47:01,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:47:01,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:47:01,986 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:47:01,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:47:01,987 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:47:01,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:47:01,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:47:01,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:47:01,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:47:01,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:47:01,989 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:47:01,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:47:01,989 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:47:01,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:47:01,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:47:01,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:47:01,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:47:01,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:47:01,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:47:01,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:47:01,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:47:01,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:47:01,992 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:47:01,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:47:01,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:47:01,992 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 -> f55c3c29f65baba8ba49ec35fe2e62008dfb74b3 [2019-01-01 20:47:02,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:47:02,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:47:02,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:47:02,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:47:02,077 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:47:02,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1-modified_false-termination_true-no-overflow.c [2019-01-01 20:47:02,137 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8cd94a/09778edfd1214e78a1f26aaee19bac6f/FLAG05c6f08c2 [2019-01-01 20:47:02,617 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:47:02,618 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1-modified_false-termination_true-no-overflow.c [2019-01-01 20:47:02,625 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8cd94a/09778edfd1214e78a1f26aaee19bac6f/FLAG05c6f08c2 [2019-01-01 20:47:02,946 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8cd94a/09778edfd1214e78a1f26aaee19bac6f [2019-01-01 20:47:02,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:47:02,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:47:02,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:02,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:47:02,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:47:02,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:02" (1/1) ... [2019-01-01 20:47:02,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19de7f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:02, skipping insertion in model container [2019-01-01 20:47:02,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:02" (1/1) ... [2019-01-01 20:47:02,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:47:02,989 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:47:03,204 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:03,209 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:47:03,227 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:03,241 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:47:03,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03 WrapperNode [2019-01-01 20:47:03,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:03,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:03,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:47:03,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:47:03,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:03,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:47:03,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:47:03,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:47:03,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (1/1) ... [2019-01-01 20:47:03,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:47:03,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:47:03,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:47:03,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:47:03,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (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-01 20:47:03,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:47:03,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:47:03,673 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:47:03,674 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:47:03,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:03 BoogieIcfgContainer [2019-01-01 20:47:03,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:47:03,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:47:03,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:47:03,692 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:47:03,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:47:02" (1/3) ... [2019-01-01 20:47:03,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47725f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:03, skipping insertion in model container [2019-01-01 20:47:03,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:03" (2/3) ... [2019-01-01 20:47:03,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47725f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:03, skipping insertion in model container [2019-01-01 20:47:03,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:03" (3/3) ... [2019-01-01 20:47:03,696 INFO L112 eAbstractionObserver]: Analyzing ICFG BradleyMannaSipma-CAV2005-Fig1-modified_false-termination_true-no-overflow.c [2019-01-01 20:47:03,718 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:47:03,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:47:03,758 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:47:03,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:47:03,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:47:03,793 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:47:03,793 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:47:03,793 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:47:03,793 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:47:03,794 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:47:03,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:47:03,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:47:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-01-01 20:47:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:03,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:03,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:03,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 29684842, now seen corresponding path program 1 times [2019-01-01 20:47:03,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:03,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:03,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:04,018 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-01 20:47:04,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:04,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:04,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:04,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:04,043 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-01-01 20:47:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:04,227 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-01-01 20:47:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:47:04,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-01 20:47:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:04,239 INFO L225 Difference]: With dead ends: 28 [2019-01-01 20:47:04,239 INFO L226 Difference]: Without dead ends: 14 [2019-01-01 20:47:04,243 INFO L631 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-01-01 20:47:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-01 20:47:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 20:47:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 20:47:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 20:47:04,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 5 [2019-01-01 20:47:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:04,280 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 20:47:04,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-01 20:47:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:04,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:04,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:04,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:04,282 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-01-01 20:47:04,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:04,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:04,344 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-01 20:47:04,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:04,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:04,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:04,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:04,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:04,347 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-01-01 20:47:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:04,517 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-01-01 20:47:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:47:04,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-01 20:47:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:04,520 INFO L225 Difference]: With dead ends: 16 [2019-01-01 20:47:04,521 INFO L226 Difference]: Without dead ends: 14 [2019-01-01 20:47:04,522 INFO L631 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-01-01 20:47:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-01 20:47:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 20:47:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 20:47:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 20:47:04,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 5 [2019-01-01 20:47:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:04,529 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 20:47:04,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-01 20:47:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:47:04,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:04,530 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:47:04,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash -199749339, now seen corresponding path program 1 times [2019-01-01 20:47:04,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:04,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:04,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:04,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:04,614 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-01 20:47:04,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:04,615 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-01 20:47:04,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:04,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:04,804 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-01 20:47:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:47:04,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-01 20:47:04,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:04,826 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-01 20:47:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:05,226 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-01 20:47:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:05,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-01 20:47:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:05,233 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:47:05,233 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:47:05,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:47:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:47:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2019-01-01 20:47:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:47:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-01 20:47:05,240 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2019-01-01 20:47:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:05,241 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 20:47:05,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-01-01 20:47:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:47:05,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:05,243 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:05,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:05,244 INFO L82 PathProgramCache]: Analyzing trace with hash -199749147, now seen corresponding path program 1 times [2019-01-01 20:47:05,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:05,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:05,407 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-01 20:47:05,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:05,408 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-01 20:47:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:05,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:05,537 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-01 20:47:05,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:05,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-01-01 20:47:05,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:05,558 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 8 states. [2019-01-01 20:47:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:06,222 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-01 20:47:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:47:06,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-01 20:47:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:06,224 INFO L225 Difference]: With dead ends: 48 [2019-01-01 20:47:06,224 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 20:47:06,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:47:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 20:47:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-01-01 20:47:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 20:47:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-01-01 20:47:06,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 9 [2019-01-01 20:47:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:06,233 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-01 20:47:06,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-01-01 20:47:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:47:06,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:06,234 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:06,234 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash -22254561, now seen corresponding path program 1 times [2019-01-01 20:47:06,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:06,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:06,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:06,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:06,294 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-01 20:47:06,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:06,294 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-01 20:47:06,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:06,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:06,402 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-01 20:47:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:47:06,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-01 20:47:06,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:47:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:47:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:47:06,423 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 7 states. [2019-01-01 20:47:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:06,494 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-01-01 20:47:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:06,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-01 20:47:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:06,497 INFO L225 Difference]: With dead ends: 31 [2019-01-01 20:47:06,497 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 20:47:06,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 20:47:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-01-01 20:47:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 20:47:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 20:47:06,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 9 [2019-01-01 20:47:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:06,505 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 20:47:06,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:47:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-01-01 20:47:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:47:06,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:06,506 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:47:06,507 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -22254369, now seen corresponding path program 1 times [2019-01-01 20:47:06,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:06,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:06,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:06,570 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-01 20:47:06,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:06,570 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-01 20:47:06,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:06,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:06,667 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-01 20:47:06,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:47:06,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-01 20:47:06,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:06,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:06,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:06,688 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 8 states. [2019-01-01 20:47:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:06,825 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-01-01 20:47:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:06,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-01 20:47:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:06,828 INFO L225 Difference]: With dead ends: 33 [2019-01-01 20:47:06,828 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 20:47:06,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:47:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 20:47:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2019-01-01 20:47:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:47:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-01-01 20:47:06,834 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2019-01-01 20:47:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:06,834 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-01 20:47:06,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-01-01 20:47:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:47:06,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:06,835 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:47:06,836 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -573512235, now seen corresponding path program 1 times [2019-01-01 20:47:06,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:06,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:06,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:06,984 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-01 20:47:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:07,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:07,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:07,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-01-01 20:47:07,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:47:07,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:47:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:47:07,143 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 11 states. [2019-01-01 20:47:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:08,078 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2019-01-01 20:47:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 20:47:08,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-01-01 20:47:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:08,079 INFO L225 Difference]: With dead ends: 56 [2019-01-01 20:47:08,079 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:47:08,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=382, Invalid=878, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:47:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:47:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:47:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:47:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:47:08,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-01 20:47:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:08,082 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:47:08,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:47:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:47:08,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:47:08,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:47:08,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:47:08,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:47:08,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:47:08,399 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 9 [2019-01-01 20:47:08,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:47:08,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-01 20:47:08,401 INFO L444 ceAbstractionStarter]: At program point L29(lines 16 30) the Hoare annotation is: (<= ULTIMATE.start_main_~y1~0 2147483647) [2019-01-01 20:47:08,402 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-01 20:47:08,402 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-01 20:47:08,402 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-01 20:47:08,402 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 26) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-01-01 20:47:08,403 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 28) no Hoare annotation was computed. [2019-01-01 20:47:08,404 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 21 27) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~y1~0) (<= ULTIMATE.start_main_~y1~0 2147483647) (<= ULTIMATE.start_main_~y2~0 2147483647) (<= 0 ULTIMATE.start_main_~y2~0)) [2019-01-01 20:47:08,404 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 28) no Hoare annotation was computed. [2019-01-01 20:47:08,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:47:08 BoogieIcfgContainer [2019-01-01 20:47:08,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:47:08,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:47:08,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:47:08,418 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:47:08,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:03" (3/4) ... [2019-01-01 20:47:08,421 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:47:08,431 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:47:08,432 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:47:08,480 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:47:08,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:47:08,482 INFO L168 Benchmark]: Toolchain (without parser) took 5531.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.7 MB in the beginning and 834.5 MB in the end (delta: 118.2 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:08,483 INFO L168 Benchmark]: CDTParser took 0.18 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-01 20:47:08,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.94 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:08,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:08,484 INFO L168 Benchmark]: Boogie Preprocessor took 28.79 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:08,485 INFO L168 Benchmark]: RCFGBuilder took 363.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:08,487 INFO L168 Benchmark]: TraceAbstraction took 4734.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 834.5 MB in the end (delta: 269.6 MB). Peak memory consumption was 269.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:08,488 INFO L168 Benchmark]: Witness Printer took 63.47 ms. Allocated memory is still 1.2 GB. Free memory is still 834.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:08,492 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.18 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 289.94 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.79 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 363.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4734.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 834.5 MB in the end (delta: 269.6 MB). Peak memory consumption was 269.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.47 ms. Allocated memory is still 1.2 GB. Free memory is still 834.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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: 16]: Loop Invariant Derived loop invariant: y1 <= 2147483647 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((0 <= y1 && y1 <= 2147483647) && y2 <= 2147483647) && 0 <= y2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 4 error locations. SAFE Result, 4.6s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 193 SDslu, 3 SDs, 0 SdLazy, 427 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, 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, 7 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 238 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 431 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 5808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 20/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...