./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cf39454d83b4ec00341bd0b620b0fa6b2321ce21 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:06:00,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:06:00,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:06:00,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:06:00,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:06:00,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:06:00,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:06:00,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:06:00,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:06:00,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:06:00,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:06:00,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:06:00,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:06:00,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:06:00,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:06:00,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:06:00,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:06:00,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:06:00,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:06:00,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:06:00,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:06:00,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:06:00,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:06:00,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:06:00,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:06:00,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:06:00,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:06:00,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:06:00,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:06:00,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:06:00,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:06:00,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:06:00,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:06:00,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:06:00,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:06:00,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:06:00,619 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 23:06:00,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:06:00,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:06:00,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:06:00,649 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:06:00,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:06:00,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:06:00,653 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:06:00,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:06:00,653 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:06:00,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:06:00,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:06:00,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:06:00,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:06:00,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:06:00,654 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:06:00,654 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:06:00,657 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:06:00,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:06:00,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:06:00,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:06:00,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:06:00,660 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:06:00,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:06:00,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:06:00,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:06:00,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:06:00,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:06:00,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:06:00,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:06:00,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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf39454d83b4ec00341bd0b620b0fa6b2321ce21 [2018-11-28 23:06:00,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:06:00,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:06:00,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:06:00,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:06:00,750 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:06:00,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:00,825 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ce355e0/09ee384b14554b37a19f4ef695996121/FLAGddef71adf [2018-11-28 23:06:01,262 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:06:01,263 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:01,270 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ce355e0/09ee384b14554b37a19f4ef695996121/FLAGddef71adf [2018-11-28 23:06:01,627 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ce355e0/09ee384b14554b37a19f4ef695996121 [2018-11-28 23:06:01,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:06:01,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:06:01,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:01,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:06:01,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:06:01,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:01,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3682ba39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01, skipping insertion in model container [2018-11-28 23:06:01,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:01,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:06:01,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:06:01,914 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:01,922 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:06:01,950 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:01,979 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:06:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01 WrapperNode [2018-11-28 23:06:01,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:01,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:01,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:06:01,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:06:01,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:02,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:06:02,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:06:02,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:06:02,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... [2018-11-28 23:06:02,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:06:02,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:06:02,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:06:02,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:06:02,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:06:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:06:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:06:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:06:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:06:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:06:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:06:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:06:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:06:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:06:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:06:02,514 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:06:02,515 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 23:06:02,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:02 BoogieIcfgContainer [2018-11-28 23:06:02,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:06:02,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:06:02,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:06:02,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:06:02,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:06:01" (1/3) ... [2018-11-28 23:06:02,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bb5fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:02, skipping insertion in model container [2018-11-28 23:06:02,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:01" (2/3) ... [2018-11-28 23:06:02,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bb5fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:02, skipping insertion in model container [2018-11-28 23:06:02,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:02" (3/3) ... [2018-11-28 23:06:02,532 INFO L112 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:02,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:06:02,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-28 23:06:02,581 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-28 23:06:02,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:06:02,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:06:02,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:06:02,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:06:02,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:06:02,644 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:06:02,644 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:06:02,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:06:02,645 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:06:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-28 23:06:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:06:02,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:02,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:02,678 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:02,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 842098899, now seen corresponding path program 1 times [2018-11-28 23:06:02,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:02,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:02,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:02,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:02,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:02,919 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2018-11-28 23:06:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:03,036 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-28 23:06:03,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:03,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-28 23:06:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:03,047 INFO L225 Difference]: With dead ends: 40 [2018-11-28 23:06:03,048 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 23:06:03,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 23:06:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 23:06:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:06:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-28 23:06:03,091 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 9 [2018-11-28 23:06:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:03,091 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-28 23:06:03,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-28 23:06:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:06:03,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:03,093 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:03,093 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:03,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1995551887, now seen corresponding path program 1 times [2018-11-28 23:06:03,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:03,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:03,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:03,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:06:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:03,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:03,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:03,188 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2018-11-28 23:06:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:03,257 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-28 23:06:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:03,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-28 23:06:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:03,259 INFO L225 Difference]: With dead ends: 22 [2018-11-28 23:06:03,259 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 23:06:03,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 23:06:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 23:06:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:06:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:06:03,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 13 [2018-11-28 23:06:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:03,267 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:06:03,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 23:06:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:06:03,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:03,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:03,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:03,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1732517839, now seen corresponding path program 1 times [2018-11-28 23:06:03,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:03,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:03,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:03,387 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 [2018-11-28 23:06:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:03,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:03,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:03,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 23:06:03,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:06:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:06:03,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:03,633 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-28 23:06:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:03,897 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-28 23:06:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:03,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 23:06:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:03,899 INFO L225 Difference]: With dead ends: 32 [2018-11-28 23:06:03,899 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 23:06:03,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 23:06:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-28 23:06:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:06:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-28 23:06:03,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-28 23:06:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-28 23:06:03,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:06:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-28 23:06:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:06:03,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:03,906 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:03,907 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:03,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1732566402, now seen corresponding path program 1 times [2018-11-28 23:06:03,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:04,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:04,016 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 [2018-11-28 23:06:04,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:04,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:04,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:06:04,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-28 23:06:04,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:06:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:06:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:06:04,248 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-28 23:06:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:04,370 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-28 23:06:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:04,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-28 23:06:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:04,372 INFO L225 Difference]: With dead ends: 22 [2018-11-28 23:06:04,372 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 23:06:04,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:06:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 23:06:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 23:06:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:06:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:06:04,378 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-28 23:06:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:04,378 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:06:04,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:06:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 23:06:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 23:06:04,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:04,380 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:04,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:04,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1456064915, now seen corresponding path program 2 times [2018-11-28 23:06:04,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:04,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:04,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:04,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:04,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:04,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:04,515 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 [2018-11-28 23:06:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:04,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:04,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:04,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:04,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:04,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-28 23:06:04,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:06:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:06:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:04,612 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2018-11-28 23:06:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:04,895 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-28 23:06:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:04,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 23:06:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:04,898 INFO L225 Difference]: With dead ends: 34 [2018-11-28 23:06:04,898 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 23:06:04,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:06:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 23:06:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-28 23:06:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:06:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-28 23:06:04,909 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2018-11-28 23:06:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:04,909 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-28 23:06:04,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:06:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-28 23:06:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 23:06:04,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:04,912 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:04,914 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:04,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1411182935, now seen corresponding path program 3 times [2018-11-28 23:06:04,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:04,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:04,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:05,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:05,133 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 [2018-11-28 23:06:05,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:06:05,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:06:05,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:05,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:05,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:05,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-28 23:06:05,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:06:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:06:05,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:06:05,231 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-28 23:06:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:05,342 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-28 23:06:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:06:05,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-28 23:06:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:05,345 INFO L225 Difference]: With dead ends: 38 [2018-11-28 23:06:05,345 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 23:06:05,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:06:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 23:06:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-28 23:06:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:06:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-28 23:06:05,353 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2018-11-28 23:06:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:05,354 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-28 23:06:05,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:06:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-28 23:06:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:06:05,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:05,355 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:05,356 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1605462245, now seen corresponding path program 4 times [2018-11-28 23:06:05,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:05,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:05,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:05,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:05,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:05,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:05,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:06:05,631 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:06:05,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:05,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:05,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:05,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-28 23:06:05,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:06:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:06:05,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:06:05,725 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 13 states. [2018-11-28 23:06:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:05,941 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-28 23:06:05,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:06:05,942 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-28 23:06:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:05,943 INFO L225 Difference]: With dead ends: 42 [2018-11-28 23:06:05,943 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 23:06:05,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:06:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 23:06:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-28 23:06:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:06:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-28 23:06:05,950 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2018-11-28 23:06:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:05,950 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-28 23:06:05,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:06:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-28 23:06:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:06:05,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:05,951 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:05,952 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:05,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1947223329, now seen corresponding path program 5 times [2018-11-28 23:06:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:05,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:05,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:05,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:06,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:06,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:06:06,416 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:06:06,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:06,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-11-28 23:06:06,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 23:06:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:06:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:06:06,505 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 15 states. [2018-11-28 23:06:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:06,980 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-28 23:06:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:06:06,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-11-28 23:06:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:06,989 INFO L225 Difference]: With dead ends: 46 [2018-11-28 23:06:06,989 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 23:06:06,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:06:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 23:06:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-28 23:06:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 23:06:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-28 23:06:06,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2018-11-28 23:06:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:06,996 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-28 23:06:06,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 23:06:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-28 23:06:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:06:06,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:06,998 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:06,998 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:06,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1223598941, now seen corresponding path program 6 times [2018-11-28 23:06:06,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:06,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:07,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:07,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:07,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:07,213 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:06:07,330 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 23:06:07,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:07,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:07,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-11-28 23:06:07,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 23:06:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 23:06:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:06:07,754 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-11-28 23:06:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:08,053 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-28 23:06:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:06:08,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-11-28 23:06:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:08,055 INFO L225 Difference]: With dead ends: 50 [2018-11-28 23:06:08,056 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 23:06:08,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2018-11-28 23:06:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 23:06:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-28 23:06:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 23:06:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-28 23:06:08,063 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2018-11-28 23:06:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:08,063 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-28 23:06:08,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 23:06:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-28 23:06:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 23:06:08,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:08,065 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:08,065 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:08,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1363442791, now seen corresponding path program 7 times [2018-11-28 23:06:08,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:08,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:08,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:08,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:08,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:08,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:08,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:08,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:08,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-11-28 23:06:08,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 23:06:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 23:06:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-11-28 23:06:08,503 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2018-11-28 23:06:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:08,722 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-28 23:06:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 23:06:08,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-11-28 23:06:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:08,730 INFO L225 Difference]: With dead ends: 54 [2018-11-28 23:06:08,730 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 23:06:08,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2018-11-28 23:06:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 23:06:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-28 23:06:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 23:06:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-28 23:06:08,738 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-11-28 23:06:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:08,738 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-28 23:06:08,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 23:06:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-28 23:06:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 23:06:08,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:08,740 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:08,740 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:08,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1503271467, now seen corresponding path program 8 times [2018-11-28 23:06:08,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:08,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:09,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:09,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:09,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:09,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:09,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:09,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:09,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:09,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-11-28 23:06:09,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 23:06:09,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 23:06:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:06:09,189 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 21 states. [2018-11-28 23:06:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:09,497 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-28 23:06:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 23:06:09,498 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-11-28 23:06:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:09,500 INFO L225 Difference]: With dead ends: 58 [2018-11-28 23:06:09,500 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 23:06:09,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:06:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 23:06:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-28 23:06:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 23:06:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-28 23:06:09,508 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2018-11-28 23:06:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:09,508 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-28 23:06:09,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 23:06:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-28 23:06:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 23:06:09,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:09,509 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:09,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:09,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash -559729169, now seen corresponding path program 9 times [2018-11-28 23:06:09,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:09,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:10,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:10,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:10,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:06:10,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 23:06:10,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:10,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:10,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-11-28 23:06:10,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 23:06:10,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 23:06:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-11-28 23:06:10,706 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 23 states. [2018-11-28 23:06:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:10,963 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-28 23:06:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 23:06:10,965 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-11-28 23:06:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:10,966 INFO L225 Difference]: With dead ends: 62 [2018-11-28 23:06:10,966 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 23:06:10,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2018-11-28 23:06:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 23:06:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-11-28 23:06:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:06:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-28 23:06:10,976 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2018-11-28 23:06:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:10,976 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-28 23:06:10,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 23:06:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-28 23:06:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 23:06:10,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:10,977 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:10,978 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:10,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:10,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1047580595, now seen corresponding path program 10 times [2018-11-28 23:06:10,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:10,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:10,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:11,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:11,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:11,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:06:11,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:06:11,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:11,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:11,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-11-28 23:06:11,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 23:06:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 23:06:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-28 23:06:11,454 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 25 states. [2018-11-28 23:06:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:11,798 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-28 23:06:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 23:06:11,799 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-11-28 23:06:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:11,800 INFO L225 Difference]: With dead ends: 66 [2018-11-28 23:06:11,800 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 23:06:11,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 23:06:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 23:06:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-28 23:06:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 23:06:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-28 23:06:11,807 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2018-11-28 23:06:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:11,807 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-28 23:06:11,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 23:06:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-28 23:06:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 23:06:11,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:11,808 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:11,809 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:11,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1720969079, now seen corresponding path program 11 times [2018-11-28 23:06:11,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:11,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:12,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:12,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:12,162 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:06:12,215 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-28 23:06:12,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:12,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:12,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-11-28 23:06:12,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 23:06:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 23:06:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-11-28 23:06:12,291 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 27 states. [2018-11-28 23:06:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:12,699 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-28 23:06:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 23:06:12,700 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2018-11-28 23:06:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:12,701 INFO L225 Difference]: With dead ends: 70 [2018-11-28 23:06:12,701 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 23:06:12,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=989, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 23:06:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 23:06:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-28 23:06:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 23:06:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-28 23:06:12,709 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2018-11-28 23:06:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:12,709 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-28 23:06:12,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 23:06:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-28 23:06:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 23:06:12,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:12,710 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:12,711 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:12,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 337476923, now seen corresponding path program 12 times [2018-11-28 23:06:12,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:12,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:12,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:13,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:13,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:13,132 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:06:13,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-28 23:06:13,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:13,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:13,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:13,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-11-28 23:06:13,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 23:06:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 23:06:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:06:13,857 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 29 states. [2018-11-28 23:06:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:14,310 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-28 23:06:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 23:06:14,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-11-28 23:06:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:14,312 INFO L225 Difference]: With dead ends: 74 [2018-11-28 23:06:14,313 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 23:06:14,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 23:06:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 23:06:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-11-28 23:06:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:06:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-28 23:06:14,319 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2018-11-28 23:06:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:14,320 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-28 23:06:14,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 23:06:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-28 23:06:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 23:06:14,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:14,321 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:14,321 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:14,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 329158911, now seen corresponding path program 13 times [2018-11-28 23:06:14,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:14,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:14,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:14,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:14,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:15,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:15,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:15,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:15,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:15,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:15,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-11-28 23:06:15,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 23:06:15,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 23:06:15,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-11-28 23:06:15,713 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 31 states. [2018-11-28 23:06:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:16,130 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-28 23:06:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 23:06:16,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-11-28 23:06:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:16,133 INFO L225 Difference]: With dead ends: 78 [2018-11-28 23:06:16,133 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 23:06:16,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 23:06:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 23:06:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-11-28 23:06:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 23:06:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-28 23:06:16,142 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2018-11-28 23:06:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:16,143 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-28 23:06:16,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 23:06:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-28 23:06:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 23:06:16,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:16,144 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:16,144 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:16,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2128076093, now seen corresponding path program 14 times [2018-11-28 23:06:16,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:16,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:16,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:16,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:16,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:16,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:16,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:16,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:16,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:16,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2018-11-28 23:06:16,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 23:06:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 23:06:16,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 23:06:16,743 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 33 states. [2018-11-28 23:06:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:17,152 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-28 23:06:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 23:06:17,154 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-11-28 23:06:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:17,155 INFO L225 Difference]: With dead ends: 82 [2018-11-28 23:06:17,155 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 23:06:17,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 23:06:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 23:06:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-11-28 23:06:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 23:06:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-11-28 23:06:17,165 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2018-11-28 23:06:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:17,165 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-11-28 23:06:17,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 23:06:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-28 23:06:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 23:06:17,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:17,167 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:17,167 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:17,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash 139145863, now seen corresponding path program 15 times [2018-11-28 23:06:17,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:17,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:17,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:18,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:06:18,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-28 23:06:18,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:18,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:18,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2018-11-28 23:06:18,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 23:06:18,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 23:06:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 23:06:18,242 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 35 states. [2018-11-28 23:06:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:19,015 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-28 23:06:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 23:06:19,016 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-11-28 23:06:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:19,018 INFO L225 Difference]: With dead ends: 86 [2018-11-28 23:06:19,018 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 23:06:19,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=715, Invalid=1735, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 23:06:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 23:06:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-11-28 23:06:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 23:06:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-11-28 23:06:19,025 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2018-11-28 23:06:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:19,025 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-11-28 23:06:19,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 23:06:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-28 23:06:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 23:06:19,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:19,034 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:19,034 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:19,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash 605601867, now seen corresponding path program 16 times [2018-11-28 23:06:19,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:19,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:19,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:19,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:06:19,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:06:19,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:19,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:19,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-11-28 23:06:19,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 23:06:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 23:06:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 23:06:19,759 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 37 states. [2018-11-28 23:06:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,249 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-28 23:06:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 23:06:20,251 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-11-28 23:06:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,252 INFO L225 Difference]: With dead ends: 90 [2018-11-28 23:06:20,252 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 23:06:20,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=802, Invalid=1954, Unknown=0, NotChecked=0, Total=2756 [2018-11-28 23:06:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 23:06:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-11-28 23:06:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 23:06:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-28 23:06:20,257 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2018-11-28 23:06:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,258 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-28 23:06:20,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 23:06:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-28 23:06:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 23:06:20,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,259 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,259 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1596050447, now seen corresponding path program 17 times [2018-11-28 23:06:20,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:20,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:21,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:21,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:21,689 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:06:21,835 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-28 23:06:21,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:21,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:21,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:21,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2018-11-28 23:06:21,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 23:06:21,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 23:06:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 23:06:21,906 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 39 states. [2018-11-28 23:06:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:22,483 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-28 23:06:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 23:06:22,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2018-11-28 23:06:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:22,486 INFO L225 Difference]: With dead ends: 94 [2018-11-28 23:06:22,486 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 23:06:22,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=894, Invalid=2186, Unknown=0, NotChecked=0, Total=3080 [2018-11-28 23:06:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 23:06:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-11-28 23:06:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 23:06:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-11-28 23:06:22,492 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 78 [2018-11-28 23:06:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:22,495 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-11-28 23:06:22,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 23:06:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-11-28 23:06:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 23:06:22,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:22,496 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:22,499 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:22,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1820895789, now seen corresponding path program 18 times [2018-11-28 23:06:22,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:22,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:22,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:23,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:23,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:23,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:06:24,288 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-11-28 23:06:24,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:24,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:24,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 23:06:24,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 23:06:24,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:24,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:24,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:24,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-11-28 23:06:24,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:24,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:24,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:24,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:24,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:24,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:24,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:25,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:25,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:25,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:25,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:25,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:25,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:25,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:25,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:25,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:25,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:25,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:25,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:25,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:25,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:25,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:25,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:25,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:25,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:25,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:25,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:25,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:26,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:26,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:26,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:26,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-28 23:06:26,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:26,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:06:26,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 23:06:26,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:26,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2018-11-28 23:06:26,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 23:06:26,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2018-11-28 23:06:26,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 23:06:26,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:26,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:26,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-11-28 23:06:27,691 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 23:06:27,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 23:06:27,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2018-11-28 23:06:27,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 23:06:27,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:27,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 23:06:27,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 23:06:27,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:27,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:27,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:06:27,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2018-11-28 23:06:28,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 23:06:28,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 23:06:28,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 23:06:28,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2018-11-28 23:06:28,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:06:28,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2018-11-28 23:06:28,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 23:06:28,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 23:06:28,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 23:06:28,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2018-11-28 23:06:28,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:06:28,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2018-11-28 23:06:28,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 23:06:28,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 23:06:28,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 23:06:28,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2018-11-28 23:06:28,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:06:28,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2018-11-28 23:06:28,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 23:06:28,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 23:06:28,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:28,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 23:06:28,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2018-11-28 23:06:28,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:06:28,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:06:28,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2018-11-28 23:06:29,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 23:06:29,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 23:06:29,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:06:29,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:29,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:06:29,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 23:06:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 105 proven. 525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:29,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2018-11-28 23:06:29,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-28 23:06:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-28 23:06:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1001, Invalid=5005, Unknown=0, NotChecked=0, Total=6006 [2018-11-28 23:06:29,252 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 78 states. [2018-11-28 23:06:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:31,659 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-11-28 23:06:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-28 23:06:31,660 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 82 [2018-11-28 23:06:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:31,662 INFO L225 Difference]: With dead ends: 97 [2018-11-28 23:06:31,662 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 23:06:31,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4106 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2476, Invalid=10406, Unknown=0, NotChecked=0, Total=12882 [2018-11-28 23:06:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 23:06:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-28 23:06:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 23:06:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-28 23:06:31,671 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 82 [2018-11-28 23:06:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:31,671 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-28 23:06:31,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-28 23:06:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-28 23:06:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 23:06:31,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:31,672 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:31,672 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:31,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash 715216266, now seen corresponding path program 1 times [2018-11-28 23:06:31,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:31,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:31,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-28 23:06:31,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:31,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:31,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:31,738 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 4 states. [2018-11-28 23:06:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:31,754 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-28 23:06:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:31,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-28 23:06:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:31,757 INFO L225 Difference]: With dead ends: 88 [2018-11-28 23:06:31,757 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:06:31,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:06:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:06:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:06:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:06:31,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-28 23:06:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:31,762 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:06:31,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:06:31,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:06:31,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:06:31,926 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 23 [2018-11-28 23:06:31,929 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:06:31,930 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:06:31,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:31,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:31,930 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:06:31,930 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:06:31,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:06:31,930 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 21) no Hoare annotation was computed. [2018-11-28 23:06:31,930 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2018-11-28 23:06:31,930 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 10 21) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 21) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. [2018-11-28 23:06:31,931 INFO L444 ceAbstractionStarter]: At program point L13-5(lines 13 15) the Hoare annotation is: (let ((.cse0 (= |main_~#a~0.offset| 0))) (or (and (<= 4 main_~i~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) 2147483647) .cse0) (and (= main_~i~0 0) .cse0) (and (<= main_~i~0 3) (<= 1 main_~i~0) .cse0))) [2018-11-28 23:06:31,931 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-28 23:06:31,932 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 21) the Hoare annotation is: true [2018-11-28 23:06:31,934 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-28 23:06:31,934 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-11-28 23:06:31,934 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2018-11-28 23:06:31,934 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-28 23:06:31,942 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:06:31,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:06:31,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:06:31 BoogieIcfgContainer [2018-11-28 23:06:31,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:06:31,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:06:31,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:06:31,951 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:06:31,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:02" (3/4) ... [2018-11-28 23:06:31,955 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:06:31,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:06:31,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:06:31,966 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 23:06:31,967 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 23:06:31,967 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:06:32,016 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:06:32,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:06:32,017 INFO L168 Benchmark]: Toolchain (without parser) took 30385.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 951.3 MB in the beginning and 909.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:32,021 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:32,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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. [2018-11-28 23:06:32,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:32,022 INFO L168 Benchmark]: Boogie Preprocessor took 43.41 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:32,022 INFO L168 Benchmark]: RCFGBuilder took 455.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:32,022 INFO L168 Benchmark]: TraceAbstraction took 29431.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 909.7 MB in the end (delta: 171.4 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:32,024 INFO L168 Benchmark]: Witness Printer took 65.92 ms. Allocated memory is still 1.4 GB. Free memory is still 909.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:32,026 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 36.23 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.41 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 455.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29431.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 909.7 MB in the end (delta: 171.4 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. * Witness Printer took 65.92 ms. Allocated memory is still 1.4 GB. Free memory is still 909.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2018-11-28 23:06:32,032 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:06:32,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((4 <= i && unknown-#memory_int-unknown[a][a + 12] <= 2147483647) && a == 0) || (i == 0 && a == 0)) || ((i <= 3 && 1 <= i) && a == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 4 error locations. SAFE Result, 29.3s OverallTime, 22 OverallIterations, 19 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 895 SDslu, 3400 SDs, 0 SdLazy, 2677 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1464 GetRequests, 820 SyntacticMatches, 5 SemanticMatches, 639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7632 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=21, 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 55 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 24 NumberOfFragments, 38 HoareAnnotationTreeSize, 5 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 192 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1865 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 1824 ConstructedInterpolants, 0 QuantifiedInterpolants, 346068 SizeOfPredicates, 194 NumberOfNonLiveVariables, 2528 ConjunctsInSsa, 408 ConjunctsInUnsatCore, 41 InterpolantComputations, 4 PerfectInterpolantSequences, 815/8808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...