./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/bitvector/byte_add_1_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/byte_add_1_false-no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash c172e82b435756efbbcf3396e72051c66081518f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:57:29,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:57:29,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:57:29,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:57:29,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:57:29,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:57:29,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:57:29,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:57:29,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:57:29,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:57:29,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:57:29,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:57:29,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:57:29,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:57:29,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:57:29,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:57:29,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:57:29,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:57:29,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:57:29,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:57:29,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:57:29,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:57:29,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:57:29,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:57:29,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:57:29,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:57:29,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:57:29,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:57:29,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:57:29,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:57:29,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:57:29,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:57:29,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:57:29,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:57:29,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:57:29,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:57:29,635 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 01:57:29,651 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:57:29,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:57:29,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:57:29,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:57:29,653 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:57:29,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:57:29,654 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 01:57:29,654 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:57:29,654 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:57:29,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 01:57:29,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:57:29,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:57:29,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:57:29,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:57:29,656 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:57:29,656 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 01:57:29,656 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:57:29,657 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:57:29,657 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:57:29,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:57:29,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:57:29,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:57:29,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:57:29,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:57:29,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:57:29,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:57:29,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:57:29,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:57:29,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:57:29,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:57:29,661 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c172e82b435756efbbcf3396e72051c66081518f [2019-01-14 01:57:29,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:57:29,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:57:29,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:57:29,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:57:29,715 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:57:29,716 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_1_false-no-overflow.i [2019-01-14 01:57:29,765 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad32e9224/893f10dc65ef40cf89b067f3c1723c50/FLAG63c4396b9 [2019-01-14 01:57:30,218 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:57:30,219 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_1_false-no-overflow.i [2019-01-14 01:57:30,226 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad32e9224/893f10dc65ef40cf89b067f3c1723c50/FLAG63c4396b9 [2019-01-14 01:57:30,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad32e9224/893f10dc65ef40cf89b067f3c1723c50 [2019-01-14 01:57:30,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:57:30,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:57:30,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:57:30,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:57:30,575 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:57:30,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:30,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30, skipping insertion in model container [2019-01-14 01:57:30,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:30,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:57:30,616 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:57:30,877 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:57:30,882 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:57:30,937 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:57:30,957 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:57:30,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30 WrapperNode [2019-01-14 01:57:30,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:57:30,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:57:30,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:57:30,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:57:30,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:30,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:57:31,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:57:31,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:57:31,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:57:31,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... [2019-01-14 01:57:31,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:57:31,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:57:31,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:57:31,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:57:31,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:57:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:57:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:57:32,129 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:57:32,129 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 01:57:32,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:32 BoogieIcfgContainer [2019-01-14 01:57:32,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:57:32,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:57:32,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:57:32,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:57:32,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:57:30" (1/3) ... [2019-01-14 01:57:32,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ede114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:57:32, skipping insertion in model container [2019-01-14 01:57:32,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:30" (2/3) ... [2019-01-14 01:57:32,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ede114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:57:32, skipping insertion in model container [2019-01-14 01:57:32,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:32" (3/3) ... [2019-01-14 01:57:32,139 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1_false-no-overflow.i [2019-01-14 01:57:32,147 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:57:32,155 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-01-14 01:57:32,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-01-14 01:57:32,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:57:32,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:57:32,200 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:57:32,201 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:57:32,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:57:32,201 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:57:32,202 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:57:32,202 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:57:32,202 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:57:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-14 01:57:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 01:57:32,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:32,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 01:57:32,242 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-14 01:57:32,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:32,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:32,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:32,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:32,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:32,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:32,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:57:32,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 01:57:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 01:57:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 01:57:32,417 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-14 01:57:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:32,441 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-01-14 01:57:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 01:57:32,443 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-01-14 01:57:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:32,456 INFO L225 Difference]: With dead ends: 134 [2019-01-14 01:57:32,456 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 01:57:32,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-14 01:57:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 01:57:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 01:57:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 01:57:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-01-14 01:57:32,503 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-01-14 01:57:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:32,503 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-01-14 01:57:32,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 01:57:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-01-14 01:57:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:57:32,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:32,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:32,506 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:32,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-01-14 01:57:32,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:32,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:57:32,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:32,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:32,665 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-01-14 01:57:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:33,027 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-01-14 01:57:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:33,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 01:57:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:33,031 INFO L225 Difference]: With dead ends: 144 [2019-01-14 01:57:33,032 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 01:57:33,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 01:57:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-01-14 01:57:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 01:57:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-01-14 01:57:33,046 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-01-14 01:57:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:33,047 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-01-14 01:57:33,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-01-14 01:57:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:57:33,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:33,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:33,051 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-01-14 01:57:33,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:33,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:33,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:33,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:33,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:33,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:33,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:33,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:33,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:33,257 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 4 states. [2019-01-14 01:57:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:34,074 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2019-01-14 01:57:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:57:34,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-14 01:57:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:34,078 INFO L225 Difference]: With dead ends: 213 [2019-01-14 01:57:34,078 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 01:57:34,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 01:57:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2019-01-14 01:57:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 01:57:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2019-01-14 01:57:34,093 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 19 [2019-01-14 01:57:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:34,093 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-01-14 01:57:34,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2019-01-14 01:57:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:57:34,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:34,095 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:34,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1023692700, now seen corresponding path program 1 times [2019-01-14 01:57:34,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:34,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:34,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 01:57:34,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:34,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:34,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:34,278 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand 4 states. [2019-01-14 01:57:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:34,699 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2019-01-14 01:57:34,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:57:34,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-14 01:57:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:34,702 INFO L225 Difference]: With dead ends: 313 [2019-01-14 01:57:34,703 INFO L226 Difference]: Without dead ends: 221 [2019-01-14 01:57:34,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-14 01:57:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2019-01-14 01:57:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 01:57:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2019-01-14 01:57:34,719 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 26 [2019-01-14 01:57:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:34,720 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2019-01-14 01:57:34,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2019-01-14 01:57:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 01:57:34,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:34,723 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:34,725 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash -421998743, now seen corresponding path program 1 times [2019-01-14 01:57:34,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:34,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:34,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 01:57:34,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:34,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:34,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:57:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:57:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:34,923 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand 5 states. [2019-01-14 01:57:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:35,659 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2019-01-14 01:57:35,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:35,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-14 01:57:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:35,663 INFO L225 Difference]: With dead ends: 454 [2019-01-14 01:57:35,663 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 01:57:35,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:57:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 01:57:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 170. [2019-01-14 01:57:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-14 01:57:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2019-01-14 01:57:35,679 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 33 [2019-01-14 01:57:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:35,679 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2019-01-14 01:57:35,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:57:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2019-01-14 01:57:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:57:35,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:35,682 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:35,684 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 337056594, now seen corresponding path program 1 times [2019-01-14 01:57:35,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:35,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:35,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 01:57:35,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:35,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:57:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:35,768 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand 3 states. [2019-01-14 01:57:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:35,784 INFO L93 Difference]: Finished difference Result 302 states and 425 transitions. [2019-01-14 01:57:35,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:35,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-14 01:57:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:35,787 INFO L225 Difference]: With dead ends: 302 [2019-01-14 01:57:35,787 INFO L226 Difference]: Without dead ends: 147 [2019-01-14 01:57:35,788 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-14 01:57:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-14 01:57:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-14 01:57:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-14 01:57:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 206 transitions. [2019-01-14 01:57:35,797 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 206 transitions. Word has length 36 [2019-01-14 01:57:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:35,797 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 206 transitions. [2019-01-14 01:57:35,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 206 transitions. [2019-01-14 01:57:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 01:57:35,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:35,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:35,801 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:35,801 INFO L82 PathProgramCache]: Analyzing trace with hash 819719165, now seen corresponding path program 1 times [2019-01-14 01:57:35,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:35,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:35,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:35,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:35,981 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-14 01:57:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:57:35,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:35,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:57:35,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:35,988 INFO L87 Difference]: Start difference. First operand 147 states and 206 transitions. Second operand 3 states. [2019-01-14 01:57:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:36,006 INFO L93 Difference]: Finished difference Result 204 states and 286 transitions. [2019-01-14 01:57:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:36,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-14 01:57:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:36,012 INFO L225 Difference]: With dead ends: 204 [2019-01-14 01:57:36,013 INFO L226 Difference]: Without dead ends: 174 [2019-01-14 01:57:36,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-14 01:57:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-01-14 01:57:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-14 01:57:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 244 transitions. [2019-01-14 01:57:36,025 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 244 transitions. Word has length 42 [2019-01-14 01:57:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:36,025 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 244 transitions. [2019-01-14 01:57:36,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 244 transitions. [2019-01-14 01:57:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 01:57:36,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:36,030 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:36,032 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash 310246075, now seen corresponding path program 1 times [2019-01-14 01:57:36,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:36,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:36,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:36,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 01:57:36,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:36,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:36,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:36,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:57:36,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:36,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-01-14 01:57:36,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:57:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:57:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:57:36,541 INFO L87 Difference]: Start difference. First operand 174 states and 244 transitions. Second operand 11 states. [2019-01-14 01:57:36,940 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 12 [2019-01-14 01:57:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:38,347 INFO L93 Difference]: Finished difference Result 953 states and 1358 transitions. [2019-01-14 01:57:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 01:57:38,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-01-14 01:57:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:38,354 INFO L225 Difference]: With dead ends: 953 [2019-01-14 01:57:38,354 INFO L226 Difference]: Without dead ends: 772 [2019-01-14 01:57:38,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-01-14 01:57:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-01-14 01:57:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 433. [2019-01-14 01:57:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-14 01:57:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 581 transitions. [2019-01-14 01:57:38,378 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 581 transitions. Word has length 42 [2019-01-14 01:57:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:38,378 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 581 transitions. [2019-01-14 01:57:38,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:57:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 581 transitions. [2019-01-14 01:57:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:57:38,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:38,381 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:38,382 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1652038945, now seen corresponding path program 1 times [2019-01-14 01:57:38,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:38,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:38,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:38,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:38,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:38,807 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2019-01-14 01:57:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 01:57:38,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:38,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:38,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 01:57:39,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:39,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 01:57:39,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:57:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:57:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:57:39,110 INFO L87 Difference]: Start difference. First operand 433 states and 581 transitions. Second operand 8 states. [2019-01-14 01:57:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:42,898 INFO L93 Difference]: Finished difference Result 1477 states and 1996 transitions. [2019-01-14 01:57:42,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:57:42,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-01-14 01:57:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:42,906 INFO L225 Difference]: With dead ends: 1477 [2019-01-14 01:57:42,907 INFO L226 Difference]: Without dead ends: 1022 [2019-01-14 01:57:42,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=203, Unknown=2, NotChecked=0, Total=272 [2019-01-14 01:57:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-01-14 01:57:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 674. [2019-01-14 01:57:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-01-14 01:57:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 877 transitions. [2019-01-14 01:57:42,940 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 877 transitions. Word has length 63 [2019-01-14 01:57:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 877 transitions. [2019-01-14 01:57:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:57:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 877 transitions. [2019-01-14 01:57:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 01:57:42,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:42,946 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:42,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash 641662652, now seen corresponding path program 1 times [2019-01-14 01:57:42,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:42,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:42,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:43,379 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-14 01:57:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 01:57:43,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:43,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:43,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:43,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 01:57:43,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:43,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-01-14 01:57:43,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:57:43,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:57:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:57:43,927 INFO L87 Difference]: Start difference. First operand 674 states and 877 transitions. Second operand 11 states. [2019-01-14 01:57:44,240 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 01:57:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:45,873 INFO L93 Difference]: Finished difference Result 2590 states and 3313 transitions. [2019-01-14 01:57:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:57:45,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2019-01-14 01:57:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:45,885 INFO L225 Difference]: With dead ends: 2590 [2019-01-14 01:57:45,885 INFO L226 Difference]: Without dead ends: 1912 [2019-01-14 01:57:45,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:57:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-01-14 01:57:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 694. [2019-01-14 01:57:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-01-14 01:57:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 931 transitions. [2019-01-14 01:57:45,930 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 931 transitions. Word has length 79 [2019-01-14 01:57:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:45,931 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 931 transitions. [2019-01-14 01:57:45,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:57:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 931 transitions. [2019-01-14 01:57:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-14 01:57:45,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:45,933 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:45,936 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1843684640, now seen corresponding path program 1 times [2019-01-14 01:57:45,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:45,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:45,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 64 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 01:57:46,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:46,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:46,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:46,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 01:57:46,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:46,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-01-14 01:57:46,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:57:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:57:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:57:46,574 INFO L87 Difference]: Start difference. First operand 694 states and 931 transitions. Second operand 10 states. [2019-01-14 01:57:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:48,044 INFO L93 Difference]: Finished difference Result 1835 states and 2450 transitions. [2019-01-14 01:57:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 01:57:48,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-01-14 01:57:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:48,048 INFO L225 Difference]: With dead ends: 1835 [2019-01-14 01:57:48,049 INFO L226 Difference]: Without dead ends: 781 [2019-01-14 01:57:48,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:57:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-01-14 01:57:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 669. [2019-01-14 01:57:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-01-14 01:57:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 883 transitions. [2019-01-14 01:57:48,079 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 883 transitions. Word has length 85 [2019-01-14 01:57:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:48,080 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 883 transitions. [2019-01-14 01:57:48,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:57:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 883 transitions. [2019-01-14 01:57:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 01:57:48,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:48,082 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:48,083 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1499605514, now seen corresponding path program 1 times [2019-01-14 01:57:48,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:48,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:48,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:48,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:48,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 01:57:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 01:57:48,222 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 01:57:48,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:57:48 BoogieIcfgContainer [2019-01-14 01:57:48,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:57:48,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:57:48,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:57:48,302 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:57:48,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:32" (3/4) ... [2019-01-14 01:57:48,307 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 01:57:48,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:57:48,310 INFO L168 Benchmark]: Toolchain (without parser) took 17740.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 951.4 MB in the beginning and 981.4 MB in the end (delta: -30.0 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:48,312 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-14 01:57:48,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:48,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:48,315 INFO L168 Benchmark]: Boogie Preprocessor took 91.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:48,316 INFO L168 Benchmark]: RCFGBuilder took 1010.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:48,317 INFO L168 Benchmark]: TraceAbstraction took 16169.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 981.4 MB in the end (delta: 103.8 MB). Peak memory consumption was 258.9 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:48,318 INFO L168 Benchmark]: Witness Printer took 5.87 ms. Allocated memory is still 1.3 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:57:48,326 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 387.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1010.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16169.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 981.4 MB in the end (delta: 103.8 MB). Peak memory consumption was 258.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.87 ms. Allocated memory is still 1.3 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] b = __VERIFIER_nondet_uint() [L109] a = 234770789 [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND FALSE !(a3 == (unsigned char)0) [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND TRUE i == (unsigned char)1 [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND TRUE i == (unsigned char)2 [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND TRUE i == (unsigned char)3 [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)255)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r1 << 8U [L97] r2 << 16U [L97] r3 << 24U - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 38 error locations. UNSAFE Result, 16.1s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 952 SDtfs, 2274 SDslu, 2019 SDs, 0 SdLazy, 2412 SolverSat, 327 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 286 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=694occurred in iteration=10, 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 2284 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 694 ConstructedInterpolants, 57 QuantifiedInterpolants, 278291 SizeOfPredicates, 12 NumberOfNonLiveVariables, 597 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 443/530 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...