./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/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-0ed9222-m [2019-01-14 21:25:39,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:25:39,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:25:39,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:25:39,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:25:39,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:25:39,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:25:39,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:25:39,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:25:39,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:25:39,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:25:39,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:25:39,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:25:39,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:25:39,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:25:39,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:25:39,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:25:39,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:25:39,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:25:39,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:25:39,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:25:39,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:25:39,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:25:39,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:25:39,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:25:39,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:25:39,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:25:39,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:25:39,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:25:39,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:25:39,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:25:39,189 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:25:39,189 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:25:39,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:25:39,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:25:39,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:25:39,191 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:25:39,207 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:25:39,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:25:39,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:25:39,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:25:39,208 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:25:39,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:25:39,209 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:25:39,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:25:39,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:25:39,210 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:25:39,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:25:39,210 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:25:39,210 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:25:39,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:25:39,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:25:39,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:25:39,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:25:39,212 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:25:39,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:25:39,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:39,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:25:39,213 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:25:39,213 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:25:39,213 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:25:39,213 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:25:39,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:25:39,215 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 [2019-01-14 21:25:39,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:25:39,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:25:39,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:25:39,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:25:39,267 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:25:39,268 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 [2019-01-14 21:25:39,328 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cfc2157/6525507c980d42119e079f04f576dd5a/FLAG151c590d2 [2019-01-14 21:25:39,805 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:25:39,805 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 21:25:39,811 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cfc2157/6525507c980d42119e079f04f576dd5a/FLAG151c590d2 [2019-01-14 21:25:40,162 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cfc2157/6525507c980d42119e079f04f576dd5a [2019-01-14 21:25:40,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:25:40,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:25:40,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:40,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:25:40,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:25:40,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be1244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40, skipping insertion in model container [2019-01-14 21:25:40,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:25:40,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:25:40,381 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:40,389 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:25:40,418 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:40,452 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:25:40,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40 WrapperNode [2019-01-14 21:25:40,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:40,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:40,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:25:40,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:25:40,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:40,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:25:40,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:25:40,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:25:40,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... [2019-01-14 21:25:40,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:25:40,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:25:40,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:25:40,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:25:40,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:40,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 21:25:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:25:40,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:25:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 21:25:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 21:25:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 21:25:41,072 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:25:41,072 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 21:25:41,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:41 BoogieIcfgContainer [2019-01-14 21:25:41,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:25:41,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:25:41,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:25:41,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:25:41,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:25:40" (1/3) ... [2019-01-14 21:25:41,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207d44e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:41, skipping insertion in model container [2019-01-14 21:25:41,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:40" (2/3) ... [2019-01-14 21:25:41,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207d44e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:41, skipping insertion in model container [2019-01-14 21:25:41,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:41" (3/3) ... [2019-01-14 21:25:41,083 INFO L112 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 21:25:41,098 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:25:41,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:25:41,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:25:41,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:25:41,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:25:41,155 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:25:41,155 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:25:41,155 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:25:41,156 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:25:41,156 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:25:41,156 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:25:41,156 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:25:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-14 21:25:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:25:41,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:41,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:25:41,182 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2019-01-14 21:25:41,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:41,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:41,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:41,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:25:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:25:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:25:41,385 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-01-14 21:25:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:41,488 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-01-14 21:25:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:25:41,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 21:25:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:41,500 INFO L225 Difference]: With dead ends: 34 [2019-01-14 21:25:41,501 INFO L226 Difference]: Without dead ends: 18 [2019-01-14 21:25:41,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-14 21:25:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 21:25:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 21:25:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-14 21:25:41,541 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2019-01-14 21:25:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:41,541 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-14 21:25:41,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:25:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-14 21:25:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:25:41,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:41,542 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 21:25:41,543 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2019-01-14 21:25:41,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:41,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:25:41,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:41,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:41,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:25:41,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:25:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:25:41,619 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-01-14 21:25:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:41,728 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-14 21:25:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:25:41,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-14 21:25:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:41,729 INFO L225 Difference]: With dead ends: 18 [2019-01-14 21:25:41,730 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 21:25:41,731 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 [2019-01-14 21:25:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 21:25:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 21:25:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 21:25:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-14 21:25:41,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2019-01-14 21:25:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:41,735 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-14 21:25:41,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:25:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-14 21:25:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:25:41,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:41,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:41,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1607296535, now seen corresponding path program 1 times [2019-01-14 21:25:41,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:41,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:41,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:41,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:41,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:41,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:41,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:41,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:42,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 21:25:42,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:25:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:25:42,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:42,095 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-14 21:25:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:42,321 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-14 21:25:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:42,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-01-14 21:25:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:42,323 INFO L225 Difference]: With dead ends: 28 [2019-01-14 21:25:42,324 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 21:25:42,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 21:25:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-01-14 21:25:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 21:25:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-14 21:25:42,328 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-01-14 21:25:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:42,329 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-14 21:25:42,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:25:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-14 21:25:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:25:42,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:42,330 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 21:25:42,330 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2019-01-14 21:25:42,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:42,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:42,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:42,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:25:42,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-14 21:25:42,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:25:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:25:42,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:25:42,560 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2019-01-14 21:25:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:42,756 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-14 21:25:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:42,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-14 21:25:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:42,758 INFO L225 Difference]: With dead ends: 18 [2019-01-14 21:25:42,758 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 21:25:42,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 21:25:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 21:25:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 21:25:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-14 21:25:42,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-01-14 21:25:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:42,763 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-14 21:25:42,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:25:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-14 21:25:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 21:25:42,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:42,764 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:42,765 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:42,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1053474021, now seen corresponding path program 2 times [2019-01-14 21:25:42,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:42,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:42,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:42,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:42,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:42,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:25:42,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:25:42,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:42,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:42,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-14 21:25:42,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:25:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:25:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:42,958 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-14 21:25:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:43,210 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-14 21:25:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:43,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-01-14 21:25:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:43,212 INFO L225 Difference]: With dead ends: 30 [2019-01-14 21:25:43,212 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 21:25:43,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:25:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 21:25:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-14 21:25:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 21:25:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-14 21:25:43,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-01-14 21:25:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:43,217 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-14 21:25:43,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:25:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-14 21:25:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 21:25:43,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:43,218 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:43,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1100938783, now seen corresponding path program 3 times [2019-01-14 21:25:43,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:43,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:43,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:43,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:43,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:43,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:25:43,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:25:43,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:43,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:43,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:43,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-14 21:25:43,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:25:43,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:25:43,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:25:43,613 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-14 21:25:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:43,758 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-14 21:25:43,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:25:43,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-01-14 21:25:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:43,760 INFO L225 Difference]: With dead ends: 34 [2019-01-14 21:25:43,761 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 21:25:43,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:25:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 21:25:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-14 21:25:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 21:25:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-14 21:25:43,767 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2019-01-14 21:25:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:43,768 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-14 21:25:43,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:25:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-14 21:25:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 21:25:43,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:43,769 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:43,769 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1326737629, now seen corresponding path program 4 times [2019-01-14 21:25:43,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:43,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:43,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:43,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:43,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:25:43,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:25:43,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:43,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:44,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:44,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-14 21:25:44,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 21:25:44,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 21:25:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-14 21:25:44,048 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-14 21:25:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:44,362 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-14 21:25:44,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:25:44,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-01-14 21:25:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:44,364 INFO L225 Difference]: With dead ends: 38 [2019-01-14 21:25:44,364 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 21:25:44,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:25:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 21:25:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-14 21:25:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 21:25:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-14 21:25:44,371 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2019-01-14 21:25:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:44,373 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-14 21:25:44,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 21:25:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-14 21:25:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 21:25:44,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:44,375 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:44,375 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash 108793383, now seen corresponding path program 5 times [2019-01-14 21:25:44,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:44,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:44,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:44,598 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 [2019-01-14 21:25:44,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:25:44,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 21:25:44,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:44,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:44,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:44,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-14 21:25:44,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 21:25:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 21:25:44,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-01-14 21:25:44,712 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-14 21:25:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:45,037 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-14 21:25:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 21:25:45,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-01-14 21:25:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:45,041 INFO L225 Difference]: With dead ends: 42 [2019-01-14 21:25:45,041 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 21:25:45,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:25:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 21:25:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-01-14 21:25:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 21:25:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-14 21:25:45,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2019-01-14 21:25:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:45,051 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-14 21:25:45,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 21:25:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-14 21:25:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 21:25:45,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:45,054 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:45,055 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1590598869, now seen corresponding path program 6 times [2019-01-14 21:25:45,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:45,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:45,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:45,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:45,414 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 [2019-01-14 21:25:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:25:45,473 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 21:25:45,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:45,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:45,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:45,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-14 21:25:45,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 21:25:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 21:25:45,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:25:45,549 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-14 21:25:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:46,015 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-01-14 21:25:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 21:25:46,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-14 21:25:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:46,016 INFO L225 Difference]: With dead ends: 46 [2019-01-14 21:25:46,016 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 21:25:46,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:25:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 21:25:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-14 21:25:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 21:25:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-14 21:25:46,023 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2019-01-14 21:25:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:46,023 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-14 21:25:46,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 21:25:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-14 21:25:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 21:25:46,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:46,027 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:46,027 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:46,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2022926801, now seen corresponding path program 7 times [2019-01-14 21:25:46,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:46,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:46,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:46,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:46,279 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 [2019-01-14 21:25:46,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:46,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:46,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-14 21:25:46,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 21:25:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 21:25:46,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-01-14 21:25:46,809 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-14 21:25:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:47,434 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-14 21:25:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 21:25:47,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-01-14 21:25:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:47,436 INFO L225 Difference]: With dead ends: 50 [2019-01-14 21:25:47,436 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 21:25:47,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:25:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 21:25:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-14 21:25:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 21:25:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-14 21:25:47,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2019-01-14 21:25:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:47,445 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-14 21:25:47,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 21:25:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-14 21:25:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 21:25:47,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:47,448 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:47,449 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:47,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1492211917, now seen corresponding path program 8 times [2019-01-14 21:25:47,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:47,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:47,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:47,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:47,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:47,830 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 [2019-01-14 21:25:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:25:47,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:25:47,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:47,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:47,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:47,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-14 21:25:47,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 21:25:47,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 21:25:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-01-14 21:25:47,908 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-14 21:25:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:48,257 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-14 21:25:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 21:25:48,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-01-14 21:25:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:48,259 INFO L225 Difference]: With dead ends: 54 [2019-01-14 21:25:48,260 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 21:25:48,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-01-14 21:25:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 21:25:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-14 21:25:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 21:25:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-14 21:25:48,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-01-14 21:25:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:48,266 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-14 21:25:48,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 21:25:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-14 21:25:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 21:25:48,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:48,270 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:48,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 360224311, now seen corresponding path program 9 times [2019-01-14 21:25:48,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:48,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:48,566 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 [2019-01-14 21:25:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:25:48,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 21:25:48,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:48,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:48,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:48,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-14 21:25:48,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 21:25:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 21:25:48,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:25:48,689 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-14 21:25:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:48,951 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-14 21:25:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 21:25:48,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-01-14 21:25:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:48,954 INFO L225 Difference]: With dead ends: 58 [2019-01-14 21:25:48,954 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 21:25:48,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:25:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 21:25:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-14 21:25:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 21:25:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-14 21:25:48,962 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2019-01-14 21:25:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:48,962 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-14 21:25:48,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 21:25:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-14 21:25:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 21:25:48,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:48,965 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:48,965 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1334534971, now seen corresponding path program 10 times [2019-01-14 21:25:48,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:48,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:49,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:49,873 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 [2019-01-14 21:25:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:25:49,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:25:49,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:49,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:49,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:49,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-14 21:25:49,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 21:25:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 21:25:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-01-14 21:25:49,984 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-14 21:25:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:50,616 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-01-14 21:25:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 21:25:50,617 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-01-14 21:25:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:50,617 INFO L225 Difference]: With dead ends: 62 [2019-01-14 21:25:50,617 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 21:25:50,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 21:25:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 21:25:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-01-14 21:25:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 21:25:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-14 21:25:50,624 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-01-14 21:25:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:50,625 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-14 21:25:50,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 21:25:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-14 21:25:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 21:25:50,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:50,628 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:50,628 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2041056831, now seen corresponding path program 11 times [2019-01-14 21:25:50,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:50,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:50,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:51,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:51,051 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 [2019-01-14 21:25:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:25:51,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-14 21:25:51,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:51,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:51,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-14 21:25:51,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 21:25:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 21:25:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-01-14 21:25:51,237 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-14 21:25:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:51,537 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-14 21:25:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 21:25:51,538 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-01-14 21:25:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:51,539 INFO L225 Difference]: With dead ends: 66 [2019-01-14 21:25:51,540 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 21:25:51,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=989, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:25:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 21:25:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-14 21:25:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 21:25:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-14 21:25:51,546 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-01-14 21:25:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-14 21:25:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 21:25:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-14 21:25:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 21:25:51,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:51,548 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:51,548 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1615882429, now seen corresponding path program 12 times [2019-01-14 21:25:51,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:51,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:52,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:52,461 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 [2019-01-14 21:25:52,470 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:25:52,576 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-14 21:25:52,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:52,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:52,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:52,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-14 21:25:52,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 21:25:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 21:25:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-01-14 21:25:52,648 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-14 21:25:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:53,317 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-01-14 21:25:53,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 21:25:53,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-01-14 21:25:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:53,319 INFO L225 Difference]: With dead ends: 70 [2019-01-14 21:25:53,319 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 21:25:53,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 21:25:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 21:25:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-14 21:25:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 21:25:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-14 21:25:53,330 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2019-01-14 21:25:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:53,331 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-14 21:25:53,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 21:25:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-14 21:25:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 21:25:53,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:53,333 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:53,334 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash -184353209, now seen corresponding path program 13 times [2019-01-14 21:25:53,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:53,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:53,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:53,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:53,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 21:25:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:54,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:54,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:54,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-14 21:25:54,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 21:25:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 21:25:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-01-14 21:25:54,090 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-14 21:25:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:54,444 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-01-14 21:25:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 21:25:54,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-01-14 21:25:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:54,447 INFO L225 Difference]: With dead ends: 74 [2019-01-14 21:25:54,447 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 21:25:54,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:25:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 21:25:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-01-14 21:25:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 21:25:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-14 21:25:54,454 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-01-14 21:25:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:54,454 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-14 21:25:54,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 21:25:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-14 21:25:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 21:25:54,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:54,455 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:54,458 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 344146763, now seen corresponding path program 14 times [2019-01-14 21:25:54,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:54,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:54,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:54,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:54,965 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 [2019-01-14 21:25:54,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:25:55,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:25:55,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:55,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-14 21:25:55,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 21:25:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 21:25:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 21:25:55,093 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-14 21:25:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:55,715 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-14 21:25:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 21:25:55,716 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-01-14 21:25:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:55,717 INFO L225 Difference]: With dead ends: 78 [2019-01-14 21:25:55,717 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 21:25:55,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 21:25:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 21:25:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-01-14 21:25:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 21:25:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-14 21:25:55,728 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2019-01-14 21:25:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:55,728 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-14 21:25:55,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 21:25:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-14 21:25:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 21:25:55,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:55,729 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:55,729 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1083270735, now seen corresponding path program 15 times [2019-01-14 21:25:55,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:55,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:57,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:57,142 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 [2019-01-14 21:25:57,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:25:57,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 21:25:57,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:57,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:57,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:57,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-14 21:25:57,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-14 21:25:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-14 21:25:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 21:25:57,498 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-14 21:25:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:58,239 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-01-14 21:25:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 21:25:58,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-01-14 21:25:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:58,242 INFO L225 Difference]: With dead ends: 82 [2019-01-14 21:25:58,242 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 21:25:58,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=715, Invalid=1735, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:25:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 21:25:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-01-14 21:25:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 21:25:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-14 21:25:58,248 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2019-01-14 21:25:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:58,249 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-14 21:25:58,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-14 21:25:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-14 21:25:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 21:25:58,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:58,252 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:58,252 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1559337133, now seen corresponding path program 16 times [2019-01-14 21:25:58,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:58,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:58,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:58,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:58,743 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 [2019-01-14 21:25:58,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:25:58,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:25:58,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:25:58,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:58,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-14 21:25:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-14 21:25:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-14 21:25:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 21:25:58,864 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-14 21:25:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:59,371 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-01-14 21:25:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 21:25:59,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-01-14 21:25:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:59,373 INFO L225 Difference]: With dead ends: 86 [2019-01-14 21:25:59,373 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 21:25:59,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=802, Invalid=1954, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 21:25:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 21:25:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-14 21:25:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 21:25:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-14 21:25:59,379 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2019-01-14 21:25:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:59,380 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-14 21:25:59,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-14 21:25:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-14 21:25:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 21:25:59,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:59,381 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:59,381 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1923398057, now seen corresponding path program 17 times [2019-01-14 21:25:59,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:59,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:59,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:25:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:59,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:59,959 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 [2019-01-14 21:25:59,968 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:26:00,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-14 21:26:00,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:26:00,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:26:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:26:00,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:26:00,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-14 21:26:00,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 21:26:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 21:26:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 21:26:00,189 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-14 21:26:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:26:00,894 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-14 21:26:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 21:26:00,895 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-01-14 21:26:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:26:00,897 INFO L225 Difference]: With dead ends: 90 [2019-01-14 21:26:00,897 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 21:26:00,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=894, Invalid=2186, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 21:26:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 21:26:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-14 21:26:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 21:26:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-14 21:26:00,902 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2019-01-14 21:26:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:26:00,902 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-14 21:26:00,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 21:26:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-14 21:26:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 21:26:00,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:26:00,903 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2019-01-14 21:26:00,903 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:26:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:26:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1202125989, now seen corresponding path program 18 times [2019-01-14 21:26:00,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:26:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:26:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:26:00,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:26:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:26:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:26:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:26:01,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:26:01,420 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 [2019-01-14 21:26:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:26:01,882 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-01-14 21:26:01,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:26:01,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:26:02,109 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 [2019-01-14 21:26:02,113 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 [2019-01-14 21:26:02,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-14 21:26:02,266 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 [2019-01-14 21:26:02,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:02,311 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 [2019-01-14 21:26:02,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:02,440 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 [2019-01-14 21:26:02,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:02,483 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 [2019-01-14 21:26:02,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:02,652 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 [2019-01-14 21:26:02,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:02,658 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 [2019-01-14 21:26:02,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:02,749 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 [2019-01-14 21:26:02,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:02,755 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 [2019-01-14 21:26:02,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:02,955 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 [2019-01-14 21:26:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:02,959 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 [2019-01-14 21:26:02,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:02,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:03,097 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 [2019-01-14 21:26:03,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:03,102 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 [2019-01-14 21:26:03,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:03,235 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 [2019-01-14 21:26:03,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:03,242 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 [2019-01-14 21:26:03,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 21:26:03,392 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 [2019-01-14 21:26:03,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:26:03,403 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 [2019-01-14 21:26:03,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:03,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2019-01-14 21:26:03,561 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 [2019-01-14 21:26:03,755 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 [2019-01-14 21:26:03,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 21:26:03,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:04,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:04,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2019-01-14 21:26:04,831 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 [2019-01-14 21:26:04,847 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 [2019-01-14 21:26:04,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 21:26:04,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:04,897 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 [2019-01-14 21:26:04,907 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 [2019-01-14 21:26:04,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:04,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:04,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 21:26:04,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 21:26:05,118 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 [2019-01-14 21:26:05,135 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 [2019-01-14 21:26:05,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:05,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:05,525 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 [2019-01-14 21:26:05,723 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 [2019-01-14 21:26:05,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 21:26:05,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:05,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 21:26:05,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 21:26:05,967 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 [2019-01-14 21:26:05,970 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 [2019-01-14 21:26:05,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:05,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:05,999 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 [2019-01-14 21:26:06,012 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 [2019-01-14 21:26:06,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 21:26:06,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:06,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 21:26:06,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 21:26:06,185 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 [2019-01-14 21:26:06,187 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 [2019-01-14 21:26:06,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,214 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 [2019-01-14 21:26:06,229 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 [2019-01-14 21:26:06,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 21:26:06,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:06,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 21:26:06,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 21:26:06,419 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 [2019-01-14 21:26:06,425 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 [2019-01-14 21:26:06,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,454 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 [2019-01-14 21:26:06,474 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 [2019-01-14 21:26:06,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 21:26:06,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:26:06,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 21:26:06,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 21:26:06,681 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 [2019-01-14 21:26:06,683 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 [2019-01-14 21:26:06,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:26:06,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 21:26:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 78 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:26:06,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:26:06,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2019-01-14 21:26:06,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-14 21:26:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-14 21:26:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=4989, Unknown=0, NotChecked=0, Total=6006 [2019-01-14 21:26:06,773 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 78 states. [2019-01-14 21:26:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:26:09,354 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-01-14 21:26:09,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 21:26:09,355 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-14 21:26:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:26:09,357 INFO L225 Difference]: With dead ends: 93 [2019-01-14 21:26:09,357 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 21:26:09,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2413, Invalid=10243, Unknown=0, NotChecked=0, Total=12656 [2019-01-14 21:26:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 21:26:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-01-14 21:26:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 21:26:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-14 21:26:09,366 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2019-01-14 21:26:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:26:09,368 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-14 21:26:09,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-14 21:26:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-14 21:26:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 21:26:09,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:26:09,369 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:26:09,372 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:26:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:26:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash 145436095, now seen corresponding path program 1 times [2019-01-14 21:26:09,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:26:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:26:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:26:09,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:26:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:26:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:26:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-14 21:26:09,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:26:09,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:26:09,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:26:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:26:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:26:09,441 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 4 states. [2019-01-14 21:26:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:26:09,455 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-01-14 21:26:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:26:09,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-01-14 21:26:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:26:09,458 INFO L225 Difference]: With dead ends: 84 [2019-01-14 21:26:09,458 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:26:09,458 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 [2019-01-14 21:26:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:26:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:26:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:26:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:26:09,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-01-14 21:26:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:26:09,459 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:26:09,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:26:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:26:09,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:26:09,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:26:09,618 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2019-01-14 21:26:09,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:26:09,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 21:26:09,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 21:26:09,623 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-14 21:26:09,623 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 10 21) no Hoare annotation was computed. [2019-01-14 21:26:09,623 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-01-14 21:26:09,623 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-01-14 21:26:09,624 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-01-14 21:26:09,624 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. [2019-01-14 21:26:09,624 INFO L444 ceAbstractionStarter]: At program point L13-5(lines 13 15) the Hoare annotation is: (let ((.cse1 (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| 12)) 2147483647)) (.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0))) (or (and .cse0 (<= 5 ULTIMATE.start_main_~i~0) .cse1) (and .cse0 (= ULTIMATE.start_main_~i~0 1)) (and .cse0 (= ULTIMATE.start_main_~i~0 0)) (and .cse0 (= ULTIMATE.start_main_~i~0 4) .cse1) (and .cse0 (= ULTIMATE.start_main_~i~0 3)) (and .cse0 (= ULTIMATE.start_main_~i~0 2)))) [2019-01-14 21:26:09,624 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 21:26:09,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 21:26:09,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 21:26:09,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:26:09,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:26:09,625 INFO L451 ceAbstractionStarter]: At program point L20(lines 10 21) the Hoare annotation is: true [2019-01-14 21:26:09,626 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-14 21:26:09,626 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-14 21:26:09,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:26:09 BoogieIcfgContainer [2019-01-14 21:26:09,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:26:09,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:26:09,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:26:09,643 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:26:09,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:41" (3/4) ... [2019-01-14 21:26:09,650 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:26:09,661 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 21:26:09,661 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:26:09,661 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 21:26:09,698 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:26:09,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:26:09,699 INFO L168 Benchmark]: Toolchain (without parser) took 29533.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -269.4 MB). Peak memory consumption was 102.8 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:09,700 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:26:09,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.86 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:09,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.41 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:26:09,701 INFO L168 Benchmark]: Boogie Preprocessor took 40.98 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:09,703 INFO L168 Benchmark]: RCFGBuilder took 516.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -212.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:09,704 INFO L168 Benchmark]: TraceAbstraction took 28568.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.4 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:09,704 INFO L168 Benchmark]: Witness Printer took 55.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 618.8 kB). Peak memory consumption was 618.8 kB. Max. memory is 11.5 GB. [2019-01-14 21:26:09,709 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.86 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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 61.41 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.98 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 516.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -212.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28568.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.4 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. * Witness Printer took 55.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 618.8 kB). Peak memory consumption was 618.8 kB. 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 - 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: 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 - PositiveResult [Line: 18]: 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 [2019-01-14 21:26:09,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 21:26:09,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((a == 0 && 5 <= i) && unknown-#memory_int-unknown[a][a + 12] <= 2147483647) || (a == 0 && i == 1)) || (a == 0 && i == 0)) || ((a == 0 && i == 4) && unknown-#memory_int-unknown[a][a + 12] <= 2147483647)) || (a == 0 && i == 3)) || (a == 0 && i == 2) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. SAFE Result, 28.4s OverallTime, 22 OverallIterations, 19 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 717 SDslu, 2470 SDs, 0 SdLazy, 3564 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1387 GetRequests, 744 SyntacticMatches, 5 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7622 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 22 NumberOfFragments, 62 HoareAnnotationTreeSize, 2 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 1660 ConstructedInterpolants, 0 QuantifiedInterpolants, 316804 SizeOfPredicates, 194 NumberOfNonLiveVariables, 2167 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 41 InterpolantComputations, 4 PerfectInterpolantSequences, 788/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...