./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-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/AliasDarteFeautrierGonnord-SAS2010-complex_false-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 9f16087843ad8a83da47d6a6a4e9d674fa79150d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:34:46,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:46,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:46,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:46,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:46,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:46,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:46,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:46,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:46,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:46,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:46,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:46,102 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:46,105 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:46,106 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:46,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:46,110 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:46,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:46,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:46,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:46,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:46,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:46,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:46,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:46,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:46,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:46,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:46,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:46,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:46,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:46,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:46,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:46,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:46,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:46,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:46,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:46,139 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:34:46,165 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:46,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:46,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:46,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:46,169 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:46,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:46,170 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:46,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:46,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:46,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:46,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:46,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:46,171 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:46,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:46,171 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:46,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:46,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:46,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:46,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:46,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:46,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:46,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:46,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:46,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:46,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:46,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:46,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:46,176 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 -> 9f16087843ad8a83da47d6a6a4e9d674fa79150d [2019-01-01 20:34:46,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:46,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:46,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:46,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:46,253 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:46,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2019-01-01 20:34:46,322 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f25be7f/c8b01c1033e74764a2375200e4aba6f1/FLAGe4ba8264c [2019-01-01 20:34:46,719 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:46,719 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2019-01-01 20:34:46,727 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f25be7f/c8b01c1033e74764a2375200e4aba6f1/FLAGe4ba8264c [2019-01-01 20:34:47,094 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f25be7f/c8b01c1033e74764a2375200e4aba6f1 [2019-01-01 20:34:47,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:47,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:47,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:47,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:47,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:47,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f07dccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47, skipping insertion in model container [2019-01-01 20:34:47,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:47,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:47,319 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:47,326 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:47,349 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:47,366 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:47,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47 WrapperNode [2019-01-01 20:34:47,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:47,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:47,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:47,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:47,380 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:34:47" (1/1) ... [2019-01-01 20:34:47,386 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:34:47" (1/1) ... [2019-01-01 20:34:47,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:47,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:47,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:47,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:47,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (1/1) ... [2019-01-01 20:34:47,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:47,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:47,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:47,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:47,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (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:34:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:47,989 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:47,990 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 20:34:47,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:47 BoogieIcfgContainer [2019-01-01 20:34:47,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:47,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:47,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:47,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:47,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:47" (1/3) ... [2019-01-01 20:34:47,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f5caa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:47, skipping insertion in model container [2019-01-01 20:34:47,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:47" (2/3) ... [2019-01-01 20:34:47,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f5caa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:47, skipping insertion in model container [2019-01-01 20:34:47,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:47" (3/3) ... [2019-01-01 20:34:47,998 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2019-01-01 20:34:48,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:48,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-01-01 20:34:48,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-01-01 20:34:48,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:48,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:48,068 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:48,068 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:48,068 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:48,068 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:48,069 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:48,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:48,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-01-01 20:34:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:34:48,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:48,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:34:48,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash 964492, now seen corresponding path program 1 times [2019-01-01 20:34:48,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:48,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:48,218 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:34:48,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:48,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:48,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-01 20:34:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 20:34:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 20:34:48,239 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-01-01 20:34:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:48,257 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-01-01 20:34:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 20:34:48,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-01-01 20:34:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:48,272 INFO L225 Difference]: With dead ends: 65 [2019-01-01 20:34:48,272 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 20:34:48,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 20:34:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 20:34:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 20:34:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 20:34:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 20:34:48,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 4 [2019-01-01 20:34:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:48,319 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 20:34:48,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-01 20:34:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 20:34:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:34:48,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:48,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:34:48,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 963500, now seen corresponding path program 1 times [2019-01-01 20:34:48,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:48,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:48,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:48,372 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:34:48,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:48,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:48,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:48,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:48,375 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-01 20:34:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:48,534 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-01-01 20:34:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:48,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:34:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:48,538 INFO L225 Difference]: With dead ends: 49 [2019-01-01 20:34:48,538 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 20:34:48,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 20:34:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-01 20:34:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 20:34:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-01-01 20:34:48,547 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 4 [2019-01-01 20:34:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:48,547 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-01-01 20:34:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-01-01 20:34:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:48,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:48,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:48,549 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash 29868584, now seen corresponding path program 1 times [2019-01-01 20:34:48,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:48,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:48,591 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:34:48,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:48,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:34:48,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:48,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:48,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:48,593 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 3 states. [2019-01-01 20:34:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:48,666 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-01-01 20:34:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:48,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:34:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:48,668 INFO L225 Difference]: With dead ends: 39 [2019-01-01 20:34:48,668 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:34:48,670 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-01 20:34:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:34:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 20:34:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 20:34:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-01-01 20:34:48,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 5 [2019-01-01 20:34:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:48,676 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-01 20:34:48,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-01-01 20:34:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:48,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:48,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:48,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 29869546, now seen corresponding path program 1 times [2019-01-01 20:34:48,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:48,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:48,777 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:34:48,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:48,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:48,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:48,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:48,780 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 4 states. [2019-01-01 20:34:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:49,231 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-01-01 20:34:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:49,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-01 20:34:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:49,234 INFO L225 Difference]: With dead ends: 55 [2019-01-01 20:34:49,236 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 20:34:49,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:34:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 20:34:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2019-01-01 20:34:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 20:34:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-01-01 20:34:49,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 5 [2019-01-01 20:34:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:49,251 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-01-01 20:34:49,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-01-01 20:34:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:49,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:49,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:49,253 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash 925926190, now seen corresponding path program 1 times [2019-01-01 20:34:49,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:49,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:49,316 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:34:49,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:49,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:34:49,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:49,318 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-01-01 20:34:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:49,482 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-01-01 20:34:49,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:49,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:49,484 INFO L225 Difference]: With dead ends: 53 [2019-01-01 20:34:49,484 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 20:34:49,485 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-01 20:34:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 20:34:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-01-01 20:34:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 20:34:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-01-01 20:34:49,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 6 [2019-01-01 20:34:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:49,492 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-01-01 20:34:49,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-01-01 20:34:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:49,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:49,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:49,494 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash 925955982, now seen corresponding path program 1 times [2019-01-01 20:34:49,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:49,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:49,534 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:34:49,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:49,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:49,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:49,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:49,535 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-01-01 20:34:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:49,618 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2019-01-01 20:34:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:49,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:49,620 INFO L225 Difference]: With dead ends: 103 [2019-01-01 20:34:49,620 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 20:34:49,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 20:34:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-01-01 20:34:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 20:34:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-01-01 20:34:49,630 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 6 [2019-01-01 20:34:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:49,630 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-01-01 20:34:49,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2019-01-01 20:34:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:49,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:49,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:49,632 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash 925961940, now seen corresponding path program 1 times [2019-01-01 20:34:49,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:49,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:49,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:49,667 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:34:49,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:49,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:34:49,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:49,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:49,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:49,669 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand 3 states. [2019-01-01 20:34:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:49,713 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-01-01 20:34:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:49,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:49,718 INFO L225 Difference]: With dead ends: 58 [2019-01-01 20:34:49,718 INFO L226 Difference]: Without dead ends: 57 [2019-01-01 20:34:49,719 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-01 20:34:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-01 20:34:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-01 20:34:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 20:34:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-01-01 20:34:49,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 6 [2019-01-01 20:34:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:49,727 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-01 20:34:49,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2019-01-01 20:34:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:34:49,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:49,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:49,729 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:49,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1361059094, now seen corresponding path program 1 times [2019-01-01 20:34:49,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:49,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:34:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:34:49,763 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 20:34:49,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:49 BoogieIcfgContainer [2019-01-01 20:34:49,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:49,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:49,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:49,783 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:49,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:47" (3/4) ... [2019-01-01 20:34:49,786 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 20:34:49,826 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:49,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:49,827 INFO L168 Benchmark]: Toolchain (without parser) took 2727.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 950.0 MB in the beginning and 967.6 MB in the end (delta: -17.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:49,829 INFO L168 Benchmark]: CDTParser took 0.16 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:34:49,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.33 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:49,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.10 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:49,831 INFO L168 Benchmark]: Boogie Preprocessor took 30.10 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:49,831 INFO L168 Benchmark]: RCFGBuilder took 548.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -107.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:49,833 INFO L168 Benchmark]: TraceAbstraction took 1790.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 967.6 MB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:49,833 INFO L168 Benchmark]: Witness Printer took 43.81 ms. Allocated memory is still 1.1 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:49,839 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.16 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 266.33 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 43.10 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.10 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 548.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -107.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1790.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 967.6 MB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. * Witness Printer took 43.81 ms. Allocated memory is still 1.1 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 30]: integer overflow possible integer overflow possible We found a FailurePath: [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 [L17] COND FALSE !(b < a) [L29] EXPR a + 2 [L29] a = a + 2 [L30] b - 10 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 12 error locations. UNSAFE Result, 1.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 136 SDtfs, 119 SDslu, 40 SDs, 0 SdLazy, 161 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, 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, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...